My Math Forum Fibonacci and primes

 Number Theory Number Theory Math Forum

 October 3rd, 2010, 12:26 PM #1 Member   Joined: Aug 2010 From: Vitória ES, Brazil Posts: 71 Thanks: 0 Fibonacci and primes Show that if $n$ is odd, and there is a odd prime $p$ that divides $F_n$ (n-th fibonacci term), so $p \equiv 1 \pmod{4}.$ Can you guys give me a hint?

 Tags fibonacci, primes

 Thread Tools Display Modes Linear Mode

 Similar Threads Thread Thread Starter Forum Replies Last Post caters Number Theory 67 March 19th, 2014 04:32 PM tahir.iman Number Theory 12 December 28th, 2012 04:53 AM restin84 Number Theory 5 December 14th, 2011 04:52 PM EPH Number Theory 7 April 22nd, 2010 01:00 PM soandos Number Theory 7 November 15th, 2007 02:42 PM

 Contact - Home - Forums - Cryptocurrency Forum - Top