EXERCISES

k positive inteqers
1) Show that if n and are ,

then t.cn -1hr ]

[ nn = +1

2)
If n is a composite Integer ,

then n has a
prime diviser less than

or
eqvd to Fn .

Exercise 1 ( page 17
3) Three proteins in .

30 NUMBER THEORY
FABRIKAM
① Nohow ñou direct proof

iiuwnlu .

p : 1- IT :b

q : Lh :') i b- 1

Ños motions in p →
q

rrwwñlñp = -1 • iii. 5%7=6

u9oÑwwWu b- i <
f- Eb

b- 11kt < n Eb ( h )

& info's
> ta b C- 2- ,
+
ñ, a < b 's
na a -11
sb

oinñ ( b- 1) k < n

( b ith th
- -
n

na : n tbh
h -
1 Lbk

nihilist ( k ith -
e n - r cbh

b- B'onisñiaduiw ftp.orriii LH -
n
t
n÷ b
-

i <

n -
n E ✗ < n

i. Thus , LI ) :b
'
- i e 1- ¥7 -
i

p→q uoioñoio %) =L I + I

A. E. D.

② .iWñou
IN contraposition

niuwnlñ
p : n is a composite integer
n has prime divisor less than equal to rn
q : or

riosnronoi ,
ng →
up
 has prime divisor than urn
N'srwoinui :/ n' in more
ET o n
Tq

,bEÉ
'

Ingrian ni ab Inori a n> i a > b

oiloi a > b > A

3, a > in nai born

n' ihr ab >n i. n =/ ab 1111 7 PET

i. an contraposition Fools,U7do's 7q→ -

p

QED .

③
 direct
g. 1 Wofoerñsco proof
ñiuwnui

p : m Inc and god Cm ,n ) = I

q : mlc

rioomorurrnoi ,
p →
q

an Benz out theorem

sin gcd (mint it

.eu?di,amebn--iia,bEztqwcnioosmramctbnc.-
ordinary
c- ①

arm
imlnc oilNoh mk . nc
, he zt -
②

oh ② tunnww ① amc + bruh iz

;
d- mcactbkl
-

i. Mld

ñgoyJ7Nin P →
9
Q .
E .
D .
 IN.oUdou direct proof

riiuunn p : mlc and nld

qi.mn/cdriosmrudnsdip-qouwnhip=-ToIoi ,
mlc and uld

ÉÑuu7Ñi

nj-dji.jc-ztnduicdimniji.mn
, mi :c
,

Icd

oIsgV7NiipsqQ.E.D.z@akfowdoodirectproodniuur9uipi.m
clhc

9 : mln

ñosmri wood ,
p→q

gainful PET oiñi , mdlhd

'

8) ivvuori meh inc LEZ

,
;

mh in

i. h In

%qv%i .
p→q
G. C- D
.
.

ID : 6331346821 Name :
Hanns {nisi
.

g) Ñ
?⃝