math
posted by jack .
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..///

If we use binets formula for the fibonacci numbers we can trivially see that Fp=5^(p1)/2 mod p implying that the only prime p such that p divides Fp is 5 divides F5=5.
Respond to this Question
Similar Questions

Grade 8 Math
URGENT HELP!Squares into Primes Some primes can be expressed as the sum of two squares, as in 13=2^2+3^2; some can't:7=/=a^2+b^2. Other primes can be c^2+2e^2 like 11=3^2+2*1^2; still others are f^2+3 g^2, like 31=2^2+ 3* 3^2. Find … 
urgent plsee
Let a,b,c be positive integers such that a divides b^2 , b divides c^2 and c divides a^2 . Prove that abc divides (a + b + c)7 . 
Math
Find the sum of all primes q<1000 such that for some prime p<q , both q divides p^3 1 and p divides q^3 1 
math
Find the sum of all primes p, such that p divides up, where up is the pth Fibonacci number. 
urgent...maths
Find the sum of all primes p, such that p divides u(p), where u(p) is the pth Fibonacci number. this iss very urgentt... 
math
For every prime p consider all polynomials f(x) with integer coefficients from 1 to p and degree at most p−1, such that for all integers x the number f(2x)−f(x) is divisible by p. Find the sum of all primes p<1000 such … 
math
For every prime p consider all polynomials f(x) with integer coefficients from 1 to p and degree at most p−1, such that for all integers x the number f(2x)−f(x) is divisible by p. Find the sum of all primes p<1000 such … 
heeeeeeelp math
Find the sum of all primes q<1000 such that for some prime p<q , both q divides p^31 and p divides q^31 
math waaaaarning
Find the sum of all primes q<1000 such that for some prime p<q , both q divides p^31 and p divides q^31 
mathno.theory
Find the sum of all primes q<1000 such that for some prime p<q , both q divides p^31 and p divides q^31