30782 - Number Theory and Its Applications Name (hoi

Mingyeong
Spring 2024 - Group Quiz # 1

1. Use the Euclidean Algorithm to obtain integers x and y satisfying

gcd(56, 72) = 56x + 72y.

) 172 56 )
gcd ( 56 72 = .

72 =
56 × + 16 10 ≤ 16 < 56 ) 172 56 ).
=
( 56 1 b )
.

56 =
16 × 3 + & (0 ≤ & < 16 ) 5616 ) = 116 83 ,

1b =
&× 2 + 116 . 8 )
=1 &
0 ) =
8

8 5 b 1 bx 3
= -

,
16 =
n2 -
56 × )

= 8 =
56 - 172 - 5 b 1 ) ×3

=
56 X 4 -
72 X 3

5 bnt 72
y
=

4 3
Y
∴ = -
,
2. Determine all solutions in the POSITIVE integers of the Diophantine equation:

18x + 5y = 48.

(1& .
5) 1 , 148

ffhere arc infinitely many solutions

18 =
5X 3 + 3 .
0≤ 3 < 5

5 =
31 + 2 ,
2 < 3

3 = 2 X 1 + * , K

2 +

= 18. 5
) = 152312

1 =
3 -
21 = 3
- 15 - 31 )

=
32 .
51

= 18 -
53 ) - 51 2

=
18 . 2
- 56 -
51

=
18 2 . ~
57

49 =
48 × ( 182 - 57 )

=8 a
6- 5
- 336

ab 336
co
Y
: = = -

, .

e =
abt T n
5
,
y
= -

336 Ton Ea
,

=
96 t 5 n = -

336 -
1&m

K.
y > 96 t 5 n> 0 n 3 -
596
336
-
336- 18 n 30 1a - = -

596 < n k -

356
= n =
-
1a

÷ C= abf 5 × ( ya ) = 9
b- a

5=

y = -
336 -
18 × 1- 1 a )
=- 336 + 34

,
y6
3. (Previous Exam) Let {fn }1
n=1 be the Fibonacci sequence with f1 = f2 = 1. Prove that

fn+1 fn 1 fn2 = ( 1)n

for every positive integer n.

In first ne can define fo o in Fibonacci since fz f , + fo f tfo

sequence
=
=
,

Then lef sprovefnyifnt -fn 1 u ) n With Induction

'
=
.

fzfo fiz
'
ont × - = ll )

o- t = -
t . tue

) Iffktifkt - fk= - 17k fk 2 fk fk+ ip H 3 kf

(
WTS
②
, +
- :

fktz fptf ffk fk+1 fRtz fp fk fkt fpf

= = -

,
=
2
-
,

fkt1 fp fkl fp+= fpt fk

=
+ -

fpe( fky fkz ffkt fk) ( fpt- fp) fk

- =
2
- .

=
fkt2fkt -fRtzfp .fpifp + fkrfpNN
= -
fptzfp + fk+1 lfpta fk ) -

2 -
fp+2 fkt fptI X fR+* = -
fpt fk + fp
2 +*
r
=
l H3
-
k

f fktafptfb p )
-

+
=
- 97 k

=
fptafk fk -

+
*
= ( H]

By Induction ,
fnt* fn -fn +

H)
"