20120608, 18:54  #1  
Noodles
"Mr. Tuch"
Dec 2007
Chennai, India
4E9_{16} Posts 
Lucasnumber prime factor form proofs
Quote:
How to Prove that any prime factor for L_{p} ≡ 1, 9 (mod 10) Last fiddled with by Raman on 20120608 at 19:53 

20120912, 13:21  #2  
Noodles
"Mr. Tuch"
Dec 2007
Chennai, India
3·419 Posts 
Quote:
For this example, consider with the following statements, in the fact, in the turning process, all at once any prime factor for F[sub]p[/sup] ≡ ±1 (mod p), p ≠ 5. On the other hand, any prime factor for F[sub]p[/sup] ≡ 1 (mod 4), why? i.e. all the values for F[sub]n[/sup] for all the odd values for the literal n, are being the sum of two squares, why? any prime factor for 2[sub]n[/sup]1, for odd n ≡ 1, 7 (mod 8) any prime factor for 2[sub]n[/sup]+1, for odd n ≡ 1, 3 (mod 8) any prime factor for 2[sub]n[/sup]+1, for even n ≡ 1, 5 (mod 8) i.e. all the values for 2[sub]n[/sup]1 for all the odd values for the literal n, aren't being the sum of two squares, i.e. all the values for 2[sub]n[/sup]+1 for all the odd values for the literal n, aren't being the sum of two squares, i.e. all the values for 2[sub]n[/sup]+1 for all the even values for the literal n, are being the sum of two squares, Last fiddled with by Raman on 20120912 at 14:20 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Special Form of Mersenne and Fermat Number Factors  michael  Math  31  20150904 05:57 
mersenne prime as a factor of another number  kurtulmehtap  Math  21  20101108 18:21 
62digit prime factor of a Mersenne number  ET_  Factoring  39  20060511 18:27 
Closed form solution of x^2 = 2 mod Fermat number  mpenguin  Factoring  10  20050929 07:46 
LucasCarmichael number  wpolly  Math  0  20041201 11:14 