Scribd
Upload
11 views

Lecture 4 MATH 212

Uploaded by

farhanmasih1903
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
11 views

Lecture 4 MATH 212

Uploaded by

farhanmasih1903
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/ 10

1 MATH 212

Elementary Number Theory


Lecture 4
2 2.2 The Division Algorithm
The Division Algorithm.
When an integer a is divided by a positive integer b, then there exist
unique integers q and r satisfying
a = bq + r where 0 ≤ r < b.
The integer q is called the quotient and integer r is called the
remainder.
3 Problems 2.2
Q6. Show that the cube of any integer is of the form 7k or 7k±1.
Solution: By the Division Algorithm, any integer n is representable in
one of the forms 7q, 7q+1, 7q+2, 7q+3, 7q+4, 7q+5 or 7q+6.
We compute the cube of a representative form 7q+r, with r = 0, 1, …,6
as follows:
n3 = (7q+r)3 = (7q)3 + 3(7q)2 r + 3(7q) r2 + r3
= 7[49q3 + 21q2 r + 3qr2] + r3 = 7k+ r3
When r=0, r3 = 0 and so n3 = 7k.
When r=1, r3 = 1 and so n3 = 7k + 1
When r=2, r3 = 8 = 7 +1 and so n3 = 7(k+1) + 1 = 7k' + 1
4 When r=3, r3 = 27 = 28 -1 and so n3 = 7(k+4) - 1 = 7k' – 1
When r=4, r3 = 64 = 63 +1 and so n3 = 7(k+9) + 1 = 7k' + 1
When r=5, r3 = 125 = 126 -1 and so n3 = 7(k+18) - 1 = 7k' - 1
When r=6, r3 = 216 = 217 -1 and so n3 = 7(k+31) - 1 = 7k' - 1
Accordingly, n3 takes one of the forms 7k or 7k±1.
5 Q8. Prove that no integer in the following sequence is a perfect
square.
11, 111, 1111, 11111, …
Solution:
We shall make use of the result that a perfect square leaves a
remainder of 0 or 1 when divided by 4.
Now every integer n in the given sequence can be written as:
n = 100q + 11 = 100q + 8 + 3 = 4(25q + 2) +3 = 4k + 3.
This shows that n leaves a remainder 3 when divided by 4, so it cannot
be a perfect square.
6 Alternative:
Assume that a representative integer in the sequence is a perfect
square.
Since the unit digit is 1, and the digits whose squares end with 1 are 1
and 9 only (12 = 1 and 92 = 81), the number in the sequence is of the
form (10n+1)2 or (10n+9)2.
Since (10n+1)2 = 100n2 + 20n +1 and (10n+9)2 = 100n2 + 180n +1,
so in either case, the tens digit would be even, which contradicts with
the give form of integers in which the tens digit is also a 1.
Thus, no integer in the given sequence is a perfect square.
7 Q10. For n ≥ 1, establish that the integer n(7n2 + 5) is of the form 6k.
Solution:
By the Division Algorithm, any integer n ≥ 1 can be expressed in one of
the forms 6q, 6q+1, 6q+2, 6q+3, 6q+4 or 6q+5.
If n = 6q, then n(7n2 + 5) = 6q(7(6q)2 + 5)) = 6∙q[7(6q)2 + 5)] = 6k
If n = 6q+1, then n(7n2 + 5) = (6q+1)(7(6q+1)2 + 5)
= (6q+1)(7∙36q2+ 7∙12q+12)
= 12∙(6q+1)(7∙3q2+ 7q+1) = 6k
If n = 6q+2, then n(7n2 + 5) = (6q+2)(7(6q+2)2 + 5)
= 2(3q+1)(7∙36q2+ 7∙24q+33)
= 2∙3(3q+1)(7∙12q2+ 7∙8q+11) = 6k
8 If n = 6q+3, then n(7n2 + 5) = (6q+3)(7(6q+3)2 + 5)
= 3(2q+1)(7∙36q2+ 7∙36q+68)
= 3∙4(2q+1)(7∙9q2+ 7∙9q+17) = 6k
If n = 6q+4, then n(7n2 + 5) = (6q+4)(7(6q+4)2 + 5)
= 2(3q+2)(7∙36q2+ 7∙48q+117)
= 2∙3(3q+1)(7∙12q2+ 7∙16q+39) = 6k
If n = 6q+5, then n(7n2 + 5) = (6q+5)(7(6q+5)2 + 5)
= (6q+5)(7∙36q2+ 7∙60q+180)
= 12∙(6q+1)(7∙3q2+ 7∙5q+15) = 6k
Alternative
Use Mathematical Induction to prove the result.
9 Q11. If n is an odd integer, show that n4+4n2+11 is of the form 16k.
Solution:
We shall make use of the result that the square of an odd integer is of the
form 8q+1, for some integer q.
Suppose n is an odd integer, then n2 = 8q+1. Therefore,
n4+4n2+11 = (8q+1)2 + 4(8q+1) +11
= 64q2 + 48q + 16
= 16(4q2 + 3q + 1) = 16k
Practice Questions
Problems 2.2
Q 1 - 6, 8 – 11

10 THANK YOU

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