Final 1.

Numbertheory
Definition1.1

0
,

final1

| b a

Example1.1
2|6 3 6
7|

b a

3 2

21 3 6

2 51

51

Example1.2
(a)
(b)

2(

|1

1|

1, 1

1|

(c)
(d) |

3 2

Remark
1.1 0|
0|0

Theorem1.1(LinearCombination)
| | ,

, 1,1,

Final 1.4

Example1.3* ( 14 84)

2,

3 |4

|2
1

LinearCombination | 2 2

1 4

| (NOTE2ndedition:
4

Example1.4( 5 82)

|15

27 |3

LinearCombination
17

| 1 15

27

5 3

17

17, 1,1,17

117

Theorem1.2(DivisionAlgorithm DA)

0,1,2, ,

, ,

Definition1.2
DA 2
2 01
2 0, 1
Remark
DA

5 )

Final 1.4

Example1.5
?
4 0, 1, 2, 3
4 0, 2
4 1,3
4

1 4

Technique DA
( 1)
3 0, 1, 2

Example1.6

4 4

14

1,

16

8 2

8|

3,

16

24

1 8|

8 2

Example1.7( 11 83)

2 2

,
4

2
1 2

Final 1.4

8|
2

4 2

8|

1
2

4
2

2
2

1
1

4 2

8|
Definition1.3
1.

, ,

2. , ,
3. , ,

| |

4. , ,

| |

Final 1.4

Remark
(1)

0,

(2) 0,

0,0

0,0

(3) ()
(4) ...

,,

(5)

...

(4)...
6424,524,233,1642

233,524,1642,6424

Example1.8( 3 90)
... 8, 10, 12

8,10,12

8,10 , 12

2,12

... 6, 15, 21

6,15,21

6,15 , 21

3,21

Example1.9
... 6, 15, 21

6,15,21

6,15 , 21

30,21

210

Theorem1.3(EuclideanAlgorithm)
... , ..

Final 1.4

Example1.10
...

455,1001

455,1001

455,91

2 455

455

5 91 , 91

0,91

91

:
1001
455

455 2
91 5

91
0

0 | |... ( absolute)

...
1001
468
65

468 2
65 7
13 5

65
13

... 13
Example1.11

1001
468
65

468 2
65 7
13 5

13

65
13

0
468

65 7

468

1001

468 2
468 15

13

1001

468

1001 7

468 15

1001 7

468 14

Final 1.4

Example1.12( 4 91)

629

357
272

272

2 272

187

1 187

187
85

357

2 85
5 17

85
17

... 17
17 187 2 85
187 2 272 187
187
2 272
2 187
3 187
2 272
3
357
2 272
2 272
3
357
6 272
2 272
3
357
4 272
357
3
357
4 629
4 629
7
357

357,629

357 7

629 4

Theorem1.4
,
,

Theorem1.5
,

1 ,

(. )

Final 1.4

Example1.13

, , |

1 ,

Example1.14( 12 93)

1 ,

1 ...
,

!^^
.