1
FORMULAS FOR DECOMPOSING F 3n /F , Fgn / F n and L 5n /l^ < INTO A SUM OR DIFFERENCE OF TWO SQUARES Dov Jar den Jerusalem, Israel (1) F 3n /F n = L£ - (-l) n (1.1) Fgn/Fgn = L 2 n - 1 = ( L m - l)(L 2n + 1) (1-2) F 3 ( 2n+1 ) /Fjjn+i = Ll n+1 + 1 (2) F m /F n - (L 2n + (-l) n ) 2 - (-l) n L& (2.1) F 10n /F 2n = (L 4n + 1)2 - L i n = (L 4n + 1 - L 2n )(L 4n + 1 + L 2n ) (2.2) F 5 ( 2n+1 ) /F 2n+1 = (L 4n+2 - l) 2 + Lla+i (3) L 5n /LQ = (L 2n -(-l) n 3) 2 + (5F n ) 2 (3.1) Llon/L 2 n = (L 4n - 3) 2 + (5F n ) 2 (3.2) L 5 ( 2n+1 ) / L 2n+1 = (L 4n+2 - 3) 2 - (5F 2n+1 ) 2 = (L 4n+2 - 3-•5F 2n+1 )(L to + 2 - 3 + 5F 2n+1 ) The formulas (1), (2), (3) can be easily verified by putting n Q n Y = g-, L = a + 0 , a/3 = - 1 , n a - B n r > r and, for (3), also a - j3 = Vl>. Since for n > 0, (3.1) gives a decomposition of L^/L^ into a sum of two squares, and" since any divisor of a sum of two squares is'= 1 (mod 4), it follows that any primitive divisor of L 10n , n > 0, is =1 (mod 4), •*•••• 96

jarden

Embed Size (px)

DESCRIPTION

Maths.

Citation preview

FORMULAS FOR DECOMPOSING F 3 n / F , Fgn / F n and L 5 n /l^ <

INTO A SUM OR DIFFERENCE OF TWO SQUARES

Dov J a r den

J e r u s a l e m , I s r a e l

(1) F 3 n / F n = L£ - ( - l ) n

(1.1) F g n / F g n = L 2n - 1 = ( L m - l ) ( L 2 n + 1)

(1-2) F3(2 n + 1) /Fjjn+i = L l n + 1 + 1

(2) F m / F n - (L2 n + ( - l ) n ) 2 - (-l)nL&

(2.1) F 1 0 n / F 2 n = (L4 n + 1)2 - L i n = (L4 n + 1 - L 2 n ) ( L 4 n + 1 + L 2 n )

(2.2) F5(2 n + 1) / F 2 n + 1 = (L 4 n + 2 - l ) 2 + Lla+i

(3) L 5 n / L Q • = (L2 n - ( - l ) n 3 ) 2 + ( 5 F n ) 2

(3.1) L l o n / L 2 n = (L4 n - 3)2 + (5Fn)2

(3.2) L5(2n+1) / L 2 n + 1 = (L 4 n + 2 - 3)2 - (5F2 n + 1) 2 = ( L 4 n + 2 - 3 - •5F 2 n + 1 ) (L t o + 2 - 3 + 5F2 n + 1)

The formulas (1), (2), (3) can be eas i ly ver i f ied by putting

n Qn Y = g - , L = a + 0 , a/3 = - 1 ,

n a - B n r > r

and, for (3), also a - j3 = Vl>.

Since for n > 0, (3.1) gives a decomposi t ion of L ^ / L ^ into a sum of

two s q u a r e s , and" s ince any divisor of a sum of two squa re s i s '= 1 (mod 4), it

follows that any p r imi t ive d iv isor of L1 0 n , n > 0, i s =1 (mod 4),

• * • • • •

96