0% found this document useful (0 votes)
86 views8 pages

Test Sma3043 Answer-2

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
86 views8 pages

Test Sma3043 Answer-2

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

CONFIDENTIAL

UNIVERSITI PENDIDIKAN SULTAN IDRIS

TEST
SEMESTER 2 SESSION 2023/2024
DATE : 23 JUNE 2024 (SUNDAY)
TIME : 2.30PM – 4.00PM (1 HOUR 30 MINUTES)

ANSWER
CODE : SMA3043 COURSE : ELEMENTARY NUMBER THEORY

INSTRUCTIONS

1. SHOW YOUR WORK. Marks may be deducted for incomplete work.

QUESTION MARKS
QUESTION 1 / 20
QUESTION 2 / 10
QUESTION 3 / 10
QUESTION 4 / 10
TOTAL / 50

NAME:

MATRIC NUMBER:

GROUP:

LECTURER : DR. NOR HAFIZAH BINTI MD HUSIN (A / B / C / D)


DR. NOR SURIYA BINTI ABD KARIM (E / F)
DR. RAWDAH ADAWIYAH BINTI TARMIZI (F)

CONFIDENTIAL
TEST SMA3043: Elementary Number Theory A232

Instructions: Answer ALL questions


[50 marks]

1. Suppose that x , y ∈ ℤ+ . Solve the Linear Diophantine Equation 102x + 1001y = 1.


(Show your steps).

[20 marks]

2. i. By using trial division of primality test show that 57 is not prime number.

[5 marks]

ii. Next, list all the prime numbers less than 57 using Sieve of Eratosthenes.

[5 marks]

3. Show that this set {−81, − 62, − 44, − 33, − 14, 41, 60, 79, 89} will form a complete set
of residue modulo 9.

[10 marks]

4. Find the reminder of (2127 )(411 ) divided by 5. [Hint: 24 ≡ 1(mod 5); 42 ≡ 1(mod 5)]

[10 marks]

END OF QUESTIONS
a b
T & C

Solution :

Let a = 102, b = 1001, C = /

O Find See (102 2001


,

By
1
Euld's hamme, let a = 1001, = 102 Then
.

1001 = 1029) 83 2 1001 102(a)


+
8383
-

, = =
,

102 = 834) + 19 ,
re : 19 19 = 102-8321)

83 =
14(4) + 7 .3 = 77 : 83-19(4)

15
5 = -
712)
13 :
=(2) + 5 ,
ry = 5

7 =
-(1) + 2 = 2 2 = z - 521)
, 5

5 = 1 = 5 -
22]
:
22) + 1
,
r6

2 1(2) +O =0
=
, rg = step
su

God (102 ,
1001) = 1

& chea scala


Since ged (102 ,
1001 : 1 and c= 1 fun

1) /() 1= 1213

Are , the execution has solution


⑧ Determine no , yo

By usig back tracking ;

1 = 5 - 2(2)

=
5 -
[7 543)(2) -

=
5 -

7(2) + 522)

=
5(3) -
H2)

=
[19-7121] (33 -
(12)

=
14(3) -
7 (8)

=
19(3) + 71 -
8)

=
19(3) + [83 -
19(43](-8)
=
19(3) + 83( 8) -
+ 19(32)
=
19(35) + 832 -
8)
=
[102 8343] -
List + 83(d)

= 102(35) + 83( -
43)

= 102 (35) + [1001 -

102(a)] ( 43)
-

=
102(35) + 1001 ( 43) 1021387)
-

=
102 (422) + 1001 ( 43) -

The 1 102 (422) + 1001(-43) n 102n +


compare
=
,

T
100ly : /

u0 Yo
Henk , no 422 43
=
%0
-
=
,
⑦ Determine May

we ow that : 10 + (felt and :


%o- (felt
Thu
,

(2) :
x
() y 43
= =
422
- -
+ +

= -
43 - 12t
= 422 + 1001 t

And
Since
My Ezit ,
fun nTO , y30 .

2 = 422 + 1001 + 70 y = -
43-10270

- 102+ > -
43
1001 t > 427 -

+ 2 - 43
-
G > + 7 0
- .

42152 S
-
102

!
I
1 -
1 I c
0.4215
-
0 .
426
-
+ 7/0 ~
I - 0 .
4216 O
2 -
I

& · & &

I I
- I O

Hea , tree soluti


au no portine
solution :

Let n = 57 ,
In = 557 :
7 5498
.

Ther
7(7 549818 .

The possible less fun or earl to - are


prime divisors that are

2, 3 , 5, 7

However
, 57 : 3() =) 3157 ·

Thus , since 57 is divisible bys ,


turn 57 is not a
prime number
.

From (1) , prime number less fun or eul to >-


a
2, 3 , 5,7

The , we need to eliminate multiples of 2, 3 , 5 , 7

* * * * * *

II # 13 X5 ↓ 17 19 x

* * 23 W X * & 20

3 ⑫ & 25 37
*

41243 * 47

# * 53 * * * =
thus ,
the prime numbers less then 57 all

2, 3 5, 7 11 13 17 13 23 , 29 31 37
, , , ,
, , , , , 41 , 43 , 47 , 53
m

solution

Note that residu muddo a =


20 , 1 , 2 , 3 , 4 , 5, 6 1 7
, 83.
,
the

a hine 81 9(4) +0
-21 = 0 mod - =

9(-7)
:
62
1
-

62 a +
-

: I mod

a
-
43
:
9(-5) + 2
-
43 : 2 mod
9( 4) - + 3
a
-
33 :

-
33 : 3 mod

14 : 9() +
4
14
-

mod a
-
: 4

41 : 5 mod a 41 =
9(2) + 5

60 a 60 = -(4) + 6
: 6 mod
78 9 (6) 7
78 mod a
: +
I
(8)
=

9 +8
T

89 = 8 mod 9 89

Thus , the set 2-51 ,


-43 ,
-33 , -14 , 41 60, 78 893 form
, , a

complete set of residue modulo 9


.
soltron

Note that 24 = 1 mod 5 and 42E1 mod 5

the

3
2124
127 Il
+ 10 + 1

. 4
2 = ·
4

=
(2 23] [144*. 41] .

= Cc" 8] [15 41] .

mods

= 8 .
4 mod 5

=
3 .
4 mod 5

= 12 mod 5

E 2 mod 5

thus , the remainder


of (2127((4") divided
by 5
is .
2

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy