Ask a New Question

Question

Find the sum of all primes p, such that p divides up, where up is the p- th Fibonacci number.

please tell me the answer it's urgent about this..///
12 years ago

Answers

George
If we use binets formula for the fibonacci numbers we can trivially see that Fp=5^(p-1)/2 mod p implying that the only prime p such that p divides Fp is 5 divides F5=5.
12 years ago

Related Questions

Find all primes less than 100 that can each be written in all three ways: p=a^2+b^2=c^2+2 e^2=f^2+3... How do you find the primes denote derivatives with respect to x. Such as xy'+ 5y= 7x^2, y(2)= 5 Find the sum of all primes a<1000, such that a^k +1 = b^{m+1} for some positive integers k,b,m. Find the sum of all primes q<1000 such that for some prime p<q , both q divides p^3 -1 and p divides... Find the sum of all primes p, such that p divides up, where up is the p-th Fibonacci number. Find the sum of all primes p, such that p divides u(p), where u(p) is the p-th Fibonacci number.... Find the sum of primes p such that p²+11 has exactly six different positive divisors (including 1 an...
Ask a New Question
Archives Contact Us Privacy Policy Terms of Use