1st Assignment

SMA 3043 ELEMENTARY NUMBER THEORY
ASSIGNMENT 1

Prepared by:

LECTURER : DR. NORASHIQIN MOHD IDRUS

NAME MATRIX NUMBER
SITI SHUHADA BINTI MOHD YUSOFF D20111048895
HALEEDA BINTI ROSDI D20111048896
MASITAH HUDA BINTI HUSSIN D20111048897
QUESTION 1
1. a) For all , prove:

+ + + .
[Hint:
+
= +
.]

Solution:

Given:
++ +

Want to show:
+
= +

Let =
+
such that

i.

:

=

:

+ + +
=
+ +

=

=

ii. + , given that .

+
=
+
+
+
+
+
++ +
=
++ +
=
+
+
++

=
+

:
+
=
+
+
+
=
+

=
b) Verify that for all ,
=
!
!

Solution:

Given:
=
!
!

Want to show:
+ =
+ !
+ !

Let =
+
such that

i.

=
= ()
=

=
!
!

=
() !
!

=

=

ii. + , given that .

+
=
!
!
+
=
!
!
+
=
! +
!

=
+ !
!

:

+ !
+ !
=
+ + !
+ !

=
+ + !
+ !

=
+ !
!

=

QUESTION 2
For all , derive each of the identities below:
a)

[Hint: Let a and b be some integers so that a+b=0.]

b)
[Hint: i) After expanding by the
Binomial Theorem,let b=1
ii) Note also that ]
1 > n
0 ) 1 ( ...
2 1 0
=
|
|
.
|
\
|
+
|
|
.
|
\
|
+
|
|
.
|
\
|
|
|
.
|
\
|
n
n n n n
n
1
2 ...
3
3
2
2
1

=
|
|
.
|
\
|
+
|
|
.
|
\
|
+
|
|
.
|
\
|
+
|
|
.
|
\
|
n
n
n
n
n
n n n
1
) 1 (

+
n
b n
.
1
) 1 (
1
|
|
.
|
\
|
+
+ =
|
|
.
|
\
|

k
n
k
k
n
n
ANSWER 2(a)
( )
( ) ( )
| | ( ) ( ) ( ) ( )
( ) ( ) ( ) ( )
( )
|
|
.
|
\
|
+
|
|
.
|
\
|
+
|
|
.
|
\
|
|
|
.
|
\
|
=
|
|
.
|
\
|
+ +
|
|
.
|
\
|
+
|
|
.
|
\
|
+
|
|
.
|
\
|
= +
|
|
.
|
\
|
=
= =
=
|
|
.
|
\
|
+
|
|
.
|
\
|
+
|
|
.
|
\
|
|
|
.
|
\
|

n
n n n n
n
n n
n n
k
n
b a let
n
n n n n
n
n n n n
n n n
k k n
n
k
n
1 ...
2 1 0
0
1 1 ... 1 1
2
1 1
1
1 1
0
) 1 ( 1
1 1 0
1 , 1
0 1 ...
2 1 0
2 2
1 1 0 0
0
Shown
ANSWER 2(b)
|
|
.
|
\
|
+
+ =
|
|
.
|
\
|

=
= +
=
|
|
.
|
\
|
+ +
|
|
.
|
\
|
+
|
|
.
|
\
|
+
|
|
.
|
\
|
1
) 1 (
1
2
1 , ) 1 (
2 ...
3
3
2
2
1
0
1
1
1
k
n
k
k
n
n n
b b n
n
n
n
n
n n n
n
k
n
n
n
( ) ( ) ( )
( ) ( ) ( ) ( )
( ) ( )
( ) ( )
|
|
.
|
\
|

+ +
|
|
.
|
\
|

+
|
|
.
|
\
|

+
|
|
.
|
\
|

=
|
|
.
|
\
|

+ +
|
|
.
|
\
|

+
|
|
.
|
\
|

+
|
|
.
|
\
|
= +
=
|
|
.
|
\
|
= +

n
n
n
n
n
n
n
n
n
n
n
n
n
n
n
n n n
b a
k
n
b a
n n n
n
n n
n
k
k n
n
k
n
1
...
2
1
1
1
0
1
1 1
1
...
1 1
2
1
1 1
1
1
1 1
0
1 - n
) 1 1 (
1, b let
Theorem Binomial using by
1
2 2 1
1 1 1 0 0 1
1
0
( ) ( ) ( ) ( )
( ) ( ) ( ) ( )
( ) ( ) ( ) ( )
( ) ( ) ( ) ( )
|
|
.
|
\
|
+ +
|
|
.
|
\
|
+
|
|
.
|
\
|
+
|
|
.
|
\
|
=
|
|
.
|
\
|
+ +
|
|
.
|
\
|
+
|
|
.
|
\
|
+
|
|
.
|
\
|
=
=
|
|
.
|
\
|
+ +
|
|
.
|
\
|
+
|
|
.
|
\
|
+
|
|
.
|
\
|
=
|
|
.
|
\
|
+
+ +
|
|
.
|
\
|
+
+ +
|
|
.
|
\
|
+
+ +
|
|
.
|
\
|
+
+ = +
n
n
n
n n n
n so
n
n
n
n n n
RHS
n
n
n
n
n n n
n
n
n
n
n n n
n
n
n
n
n
...
3
3
2
2
1
1 2 ,
...
3
3
2
2
1
1
2 LHS
...
3
3
2
2
1
1 ) 2 (
1
...
1 2
1 2
1 1
1 1
1 0
1 0 ) 1 1 (
1
1
1
1
QUESTION 3
3. The ancient Greek called a number
triangular if it is the sum of consecutive
integers, beginning with 1. Prove the
following facts concerning triangular
numbers:

a) A number is triangular if and only if it is of
the form
+
for some .
Solution:

i. If a number
is triangular, then
can be in the form of

+
for some .

is triangular, then we assume
as , , , , , , ,
+
.

We know that,

= =
+ = +

= =
+ = + +

= =
+ = + + +
.
.
.

= + + ++

Therefore, from previous slide, we can assume that triangular
number,
as:

= + + ++ +
=
=

By the other way,

= + ++ + +
= +
=
+ +
= +
=

+
=
= + + + ++ +

= + will be added times

= +

= +

=
+

ii. If
can be in the form of

+
for some , then
is
triangular number.

By mathematical induction,

=
+

= + + ++ +

When = ,

=
+
=
=
+

=

=

We want to show that = + is true, given that it is true for
= .

+
= + + ++ +

= +
+ +
= + + ++ + +

=

++
, =
+
+ +
=
+ + +
++

=
b) The integer is a triangular number if and only if + is a perfect
square.

Solution:

Let =

i. If the integer
is triangular, then
+ is a perfect square.

=
+
+ =?

is a perfect square if = .
=
+ =
+ =

triangular
+ =
triangular
=
+

Suppose
triangular, then
=
+
.

So,
+ =
+
+
= + +
=
+ +
= +

,
+

ii. If
+ is a perfect square, then integer

is triangular.

+ =
+ = +

+ =
+ +
=
+
=

=
+
,
+

c) The sum of any two consecutive triangular numbers is
a perfect square.

Solution:
By using
term:

term and
term.

+ =
+
+
+

d) If is a triangular number, then so are +, +
and +.

Solution:

+ =
+
+
=

+
=

++

=
+ +
,
+

So, this proved that it is triangular number when
+
.

+ =
+
+
=

+
=

++

=
+ +
,
+

So, this proved that it is triangular number
when
+
.

+ =
+
+
=

+
=

++

=
+ +
,
+

So, this proved that it is triangular number
when
+
.

QUESTION 4
4. Use the Division Algorithm to establish the following:

a) The square of any integer is either of the form or +.

Solution:

Let = ; = , , ; = + ;

= + = +
= + = +
= + = +

Value of must be in the range < .

For
,
+

=

= ; when =

For
,
+

=
+ +
=
+ +
= + ; when =
+

For
,
+

=
+ +
=
+ + +
=
+ + +
= + ; when =
+ +

The square of any integers is either of the form or +.
b) The cube of any integer has one of the forms:
, + and +.

Solution:

Let = ; = , , ; = +;

= + = +
= + = +
= + = +

Value of must not exceed 2 since = .

For
,
+

=

=

For
,
+

=
+ +
=
+ + +
= +

For
,
+

=
+ +
=
+ +
= +

The cube of any integer has one of the forms: , +, +

QUESTION 5
For , use the mathematical induction to
establish each of the following divisibility.

1 > n
5 5 3 7 2 | 24 b)
) 7 5 7 ( ) 7 5 ( 5 ) 7 5 : [hint
7 5 | 8 a)
2 2 2 1) 2(k
2n
- + -
- = + = +
+
+
n n
k
ANSWER 5(a)
true. is k n given that true is 1 k n Show
8 7 5 Given that
32 | 8
32 7 5
1 n let
1 n for ) 7 (5 | 8
2k
2(1)
2n
= + =
Z e = +
= +
=
> +
l where l
true is 7 5 | 8 ,
, 8
) 3 7 5 ( 8
) 3 ( 8 7 8 5
) 1 5 ( 7 ) 7 5 ( 5
7 ) 7 ( 5 ) 7 ( 5 5 5
7 5 5 7 5
true. is 7 5 | 8 WTS
) 1 ( 2
2
2
2 2 2
2 2 2 2
2 2 1) 2(k
1) 2(k
+
Z e =
- =
- - =
+ =
+ + - =
+ - = +
+
+
+
+
k
k
k
k
so
m m
l
l
ANSWER 5(b)

5 5 15 7 14
24 5 5 5 3 7 7 2
) 1 .....( 5 24 5 ) 3 ( 7 ) 2 (
24 5 5 ) 3 ( 7 ) 2 ( i.e , 5 5 ) 3 ( 7 ) 2 ( | 24 Given that
5 5 ) 3 ( 7 ) 2 ( | 24 WTS
1
) 1 ( 24 24 5 ) 5 )( 3 ( ) 7 )( 2 (
1 n let
, 24 5 5 ) 3 ( (2)7
Def. By
) 5 5 3 7 2 ( | 24
1 1
2
- + - =
Z e = - - + - -
= +
= + +
+
= + =
= = +
=
Z e = +
- + -
+ +
k k
k k
k k
k k k k
k k
n
n n
l l
l
l
. k is true n given that is true, k n Show that
l l
Z e =
Z e + + + =
+ + + =
+ + + =
+ + + + =
+ + =
Z e + = + =
Z e
+ + =
+ + =
+ - + - =
+
s s
l q p l q p
l q p
l q p
l q p
l
q p q p let
k all for odd each are and that Observe
l
l
l
with subs
k k
k k
k k
k k
k k k k
k k k k
24
, , ) 1 ( 24
24 ) 1 ( 24
24 ) 2 2 2 ( 12
24 ) 1 2 1 2 ( 12
24 ) 5 7 ( 12
, 1 2 5 1 2 7 ;
; 5 7
24 ) 3 15 ( 5 ) 2 14 ( 7
24 5 ) 3 ( 7 ) 2 ( 5 ) 15 ( 7 ) 14 (
] 24 5 ) 3 ( 7 ) 2 [( 5 15 7 14
) 1 (
QUESTION 6
Given integers a and b, prove the following:
a) There exist integers x and y for which
c=ax+by if and only if gcd(a,b)|c.
b) If there exist integers x and y for which
ax+by=gcd(a,b), then gcd(x,y)=1.
ANSWER 6(a)
If gcd(a,b)|c then
Let gcd(a,b)=d
By theorem,

d|a , d|b, so d|(ax+by) then d|c
where
conversely suppose gcd(a,b)|c
WTS, c=ax+by
gcd(a,b)=d
by ax c + =
by ax b a + = ) , gcd(
d by ax b a = + = ) , gcd(
Z e = k dk c ,
By the Euclidean Algorithm, there are integers
p and q such that

multiply by k,

we have,

bq ap d + =
bqk apk dk + =
by ax c
qk y pk x let qk b pk a
bqk apk
k bq ap
dk c
+ =
= = + =
+ =
+ =
=
, ) ( ) (
) (
assume
WTS
since gcd(a,b)=d (by theorem)

by ax c + =
c d |
by ax d b a + = = ) , gcd(
c d
c b a
l by ax c
l dl c
c d
|
| ) , gcd(
) (
,
|
=
=
+ =
Z e =
ANSWER 6(b)
Suppose
d
y dq x dp by ax d
qd b dp a
q p
b d a d
yq xp
y x b a by ax
y x
by side both dividing
) ( ) ( then
and
such that and integers are there so
. | and | then d b) gcd(a, let
1 WTS
1 ) , gcd( then ) , gcd( such that
,
+ = + =
= =
=
= +
= = +
Z e -
shown. is it then,
1 yq xp
q
dqy
d
dpx
d
d
+ =
+ =
QUESTION 7
Use the Euclidean Algorithm to obtain integers
x and y (for (a)), x, y and z (for (b)) satisfying
the following:

a) gcd(1769, 2378) = 1769x + 2378y
b) gcd(198, 288, 512) = 198x + 288y + 512z

ANSWER
a) gcd(1769, 2378) = 1769x + 2378y
) 2378 , 1769 gcd( 29
0 29 2 58
29 58 9 551
551 609 2 1769
609 1769 1769 2378
=
+ - =
+ - =
+ - =
+ - =
29 and 39 have we so,
) 29 ( 2378 ) 39 ( 1769
) 29 ( 2378 ) 39 ( 1769
) 29 ( 1769 ) 29 ( 2378 ) 10 ( 1769
) 29 )( 1769 2378 ( ) 10 ( 1769
) 29 ( 609 ) 10 ( 1769
) 9 ( 609 ) 10 )( 609 2 1769 (
) 9 ( 609 ) 10 ( 551
) 551 ( 9 ) 609 ( 9 551
] 551 609 [ 9 551
) 58 ( 9 551 29
= =
+ =
=
+ =
=
=
- =
=
+ =
=
=
y x
b) gcd(198, 288, 512) = 198x + 288y + 512z
First assume that

Then,find

18 ) 288 , 198 gcd(
0 ) 5 ( 18 90
18 ) 2 ( 90 198
90 ) 1 ( 198 288
= =
+ =
+ =
+ =
d
) 288 , 198 gcd( = d
) 512 , 18 gcd( ) 512 , gcd( = d
) 512 , 18 gcd( 2
0 ) 4 ( 2 8
2 ) 2 ( 8 18
8 ) 28 ( 18 512
=
+ =
+ =
+ =
) 2 ( 512 ) 114 ( 288 ) 171 ( 198
) 2 ( 512 ) 114 ( 288 ) 171 ( 198
) 2 ( 512 ) 114 ( 198 ) 114 ( 288 ) 57 ( 198
) 2 ( 512 ) 114 )( 198 288 ( ) 57 ( 198
) 2 ( 512 ) 114 ( 90 ) 57 ( 198
) 2 ( 512 ) 57 )]( 2 ( 90 198 [
) 2 ( 512 ) 57 ( 18
) 2 ( 512 ) 57 ( 18
) 56 ( 18 ) 2 ( 512 ) 1 ( 18
) 2 )]( 28 ( 18 512 [ ) 1 ( 18
) 2 ( 8 18 2
+ + =
+ =
+ + =
+ =
+ =
+ =
+ =
=
+ =
=
=
So,we have
2
114
171
=
=
=
z
y
x
QUESTION 8
Determine all solution in the positive integers
of the following Diophantine equation.

906 21 54 = + y x
ANSWER 8
302 3 906 3 ,
0 ) 3 ( 3 9
3 ) 1 ( 9 12
9 ) 1 ( 12 21
12 ) 2 ( 21 54
) 21 , 54 gcd(
906 21 54
= =
+ =
+ =
+ =
+ =
=
= +
where d hence
d find
y x
1510 , 604
302 5 , 2
) 5 ( 21 ) 2 ( 54
) 5 ( 21 ) 2 ( 54
) 1 ( 21 )] 4 ( 21 ) 2 ( 54 [
) 1 ( 21 ) 2 )]( 2 ( 21 54 [
) 1 ( 21 ) 2 ( 12
) 1 ( 12 ) 1 ( 21 12
) 1 )]( 1 ( 12 21 [ 12
) 1 ( 9 12 3
|
= =
= =
+ =
=
=
=
=
+ =
=
=
y x
by multiply y x
c d
84 86
8 . 83 28 . 86
18
1510
7
604
0 18 1510 0 7 604
0 0
18 1510 7 604
3
54
1510
3
21
604
integers positive find
0 0
s >
< >
< >
> > +
> >
= + =
= + =
t t
t t
t t
t t
y x
t t
t y t x

-86 -84
Overlapping at . Hence, there are an integer solution when

84 86 s s t
84 86 s s t
o
o
QUESTION 9
A farmer purchased 100 head of livestock for a
total cost of RM4000. Prices were as follows:
calves, RM120 each; lamb, RM50 each;
chicken RM25 each. If the farmer obtained at
least one animal of each type, how many of
each did he buy?

ANSWER
Let:

chicken of number
lambs of number
calves of number
=
=
=
z
y
x
) 3 ...( 100
) 2 ...( 100
) 1 ...( 4000 25 50 120
y x z
z y x
z y x
=
= + +
= + +
1500 25 95
4000 25 25 2500 50 120
4000 ) 100 ( 25 50 120
(1) into (3) substitute
= +
= + +
= + +
y x
y x y x
y x y x
5 ) 25 , 95 ( gcd
0 ) 4 ( 5 20
5 ) 1 ( 20 25
20 ) 3 ( 25 95
) 25 , 95 ( gcd
=
+ =
+ =
+ =
for
) 1200 ( 25 ) 300 ( 95 1500
300 with everything multiply *
) 4 ( 25 ) 1 ( 95
) 1 ( 95 ) 4 ( 25
) 3 ( 25 ) 1 ( 95 25
) 1 )]( 3 ( 25 95 [ 25
) 1 ( 20 25 5
+ =
+ =
=
+ =
=
=
60
300 5
0 5 300

5 300
)
5
25
( 300
) (
0
>
>
> +
Z e
+ =
+ =
+ =
t
t
t
t for
t
t
t
d
b
x x
63
2 . 63
1200 19
0 19 1200

19 1200
)
5
95
( 1200
) (
0
s
<
>
>
Z e
=
=
=
t
t
t
t
t for
t
t
t
d
a
y y
58
1 . 57
800 14
0 14 800

14 800
) 19 1200 ( ) 5 300 ( 100
100
>
>
>
> +
Z e
+ =
+ =
=
t
t
t
t
t for
t
t t
y x z

There are overlapping of t when 60 < 63.
Hence, t = 61, t=62 and t = 63.
When t=61, = 5, = 41 and = 54
When t=62, = 10, = 22 and = 68
When t=63, = 15, = 3 and = 82

57 60 63
o
o
o
t
The only integral values of t to satisfy three
inequalities are t=61,t=62 and t=63.
Thus, there are three possible purchases:
Case 1 where t=61
5 calves at RM120, 41 lambs at RM50
and 54 chicken at RM25.
Case 2 where t=62

Case 3 where t=63

1st Assignment

Caricato da

Informazioni sul documento

Copyright

Formati disponibili

Condividi questo documento

Condividi o incorpora il documento

Opzioni di condivisione

Hai trovato utile questo documento?

Questo contenuto è inappropriato?

Copyright:

Formati disponibili

1st Assignment

Caricato da

Copyright:

Formati disponibili

SMA 3043 ELEMENTARY NUMBER THEORY

can be in the form of

is triangular, then we assume

can be in the form of

for some , then

+ is a perfect square, then integer

Potrebbero piacerti anche