Scribd
Upload
1K views3 pages

En 0104 Serge Lang Basic Mathematics Answers

Cap 01 (#4) Serge Lang Basic Mathematics 1971 Resolução Exercícios Álgebra Números Inteiros pares e ímpares Divisibilidade Chap 01 (#4) Answers to Exercises Algebra Numbers Even and odd integers Divisibility

Uploaded by

RM_1958
Copyright
© Public Domain
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
1K views3 pages

En 0104 Serge Lang Basic Mathematics Answers

Cap 01 (#4) Serge Lang Basic Mathematics 1971 Resolução Exercícios Álgebra Números Inteiros pares e ímpares Divisibilidade Chap 01 (#4) Answers to Exercises Algebra Numbers Even and odd integers Divisibility

Uploaded by

RM_1958
Copyright
© Public Domain
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/ 3

Lang, Serge − Basic Mathematics. Addison-Wesley Publishing Company Inc. 1st ed., 1971.

COMPLETE ANSWER KEY

T HIS PUBLICATION IS NEITHER OFFICIAL NOR AUTHORIZED .


This is a Complete Answer Key for the book Basic Mathematics by Serge Lang.
It was created with the sole purpose of helping students find a more or
less reliable source for solutions to the exercises proposed in the book.
NO FINANCIAL GAIN IS INTENDED HERE .

Created by Renato de Melo.


Email: [email protected].
Last modified: 2023-12-14

Part One ALGEBRA


1 Numbers
§ 4. EVEN AND ODD INTEGERS; DIVISIBILITY
A NSWERS TO S ELECTED E XERCISES
[The exercises with numbers in bold show answers to the 'selected
exercises' from the book itself; the others show my own answers.]
EXERCISES pg 025 (041)
1. Give the proofs for the cases of Theorem 1 which were not proved in the
text.
a) If a = 2n, b = 2m, then a + b = 2n + 2m = 2 ( n + m ).
Setting k = n + m gives a + b = 2k, whence a + b is even,
b) If a = 2n + 1, b = 2m, then a + b = 2n + 1 + 2m = 2 ( n + m ) + 1.
Setting k = n + m gives a + b = 2k + 1, and a + b is odd.
c) If a = 2n + 1, b = 2m + 1, then a + b = 2n + 1 + 2m + 1 =
= 2n + 2m + 2 = 2 ( n + m + 1 ).
Setting k = n + m + 1 gives a + b = 2k, and a + b is even.

2. Prove: If a is even and b is any positive integer, then ab is even.


Let a = 2n, ab = 2nb .
Setting k = nb gives ab = 2k, whence ab is even.

3. Prove: If a is even, then a 3 is even.


Let a = 2n, a 3 = ( 2n )3 = 23n 3 .
Setting k = 22n 3 gives a 3 = 2k, whence a 3 is even.

4. Prove: If a is odd, then a 3 is odd.


Let a = 2n + 1, a 3 = ( 2n + 1 )3 = 8n 3 + 12n 2 + 6n + 1.
Setting k = 4n 3 + 6n 3 + 3n gives a 3 = 2k + 1, whence a 3 is odd.

5. Prove: If n is even, then ( − 1 ) n = 1.


Let n = 2k, ( − 1 ) n = ( − 1 ) 2k = ( ( − 1 ) 2 )k = 1k , since ( − 1 ) 2 = +1.
Then 1k = 1 for all integers, k .

Chapter 1 - § 4 Page 1 out of 3


Lang, Serge − Basic Mathematics. Addison-Wesley Publishing Company Inc. 1st ed., 1971. COMPLETE ANSWER KEY

6. Prove: If n is odd, then ( − 1 ) n = −1.


Let n = 2k + 1.
Then ( − 1 ) n = ( − 1 ) 2k+1 = ( − 1 ) 2k ( − 1 ) = 1 ( − 1 ) = −1.

7. Prove: If m, n are odd, then the product mn is odd.


Let m = 2k + 1, n = 2q + 1.
Then mn = ( 2k + 1 ) ( 2q + 1 ) = 4kq + 2q + 2k + 1.
Setting t = 2kq + q + k gives mn = 2t + 1. Hence mn is odd.

Find the largest power of 2 which divides the following integers.


4 3 5
8. 16 = 2 → 4 9. 24 = 2 → 3 10. 32 = 2 → 5
2 1 6
11. 20 = 2 → 2 12. 50 = 2 → 1 13. 64 = 2 → 6
2 2
14. 100 = 2 → 2 15. 36 = 2 → 2

Find the largest power of 3 which divides the following integers.


1 3 2
16. 30 = 3 → 1 17. 27 = 3 → 3 18. 63 = 3 → 2
2 1
19. 99 = 3 → 2 20. 60 = 3 → 1
0
21. 50 is not divisible by 3. Thus 50 = 3 ∙ 50 → 0
1
22. 42 = 3 → 1
2
23. 45 = 3 → 2

24. Let a, b be integers. Define a ≡ b (mod 5), which we read “a is


congruent to b modulo 5”, to mean that a − b is divisible by 5. Prove:
If a ≡ b (mod 5) and x ≡ y (mod 5), then
a + x ≡ b + y (mod 5)
and
ax ≡ by (mod 5).
P ROOF.
a) There exist integers k, q such that a − b = 5k, x − y = 5q. Then
( a − b ) + ( x − y ) = 5 ( k + q ), whence
( a + x ) − ( b + y ) = 5 ( k + q ), i.e., a + x ≡ b + y (mod 5).
b) There exist integers k, q such that a = b + 5k, x = y + 5q. Then
ax = ( b + 5k ) ( y + 5q ) = by + 5 ( ky + bq + 5kq ). Setting
t = ky + bq + 5kq gives ax = by + 5t, i.e., ax ≡ by (mod 5).

Chapter 1 - § 4 Page 2 out of 3


Lang, Serge − Basic Mathematics. Addison-Wesley Publishing Company Inc. 1st ed., 1971. COMPLETE ANSWER KEY

25. Let d be a positive integer. Let a, b be integers. Define


a ≡ b ( mod d )
to mean that a − b is divisible by d. Prove that if a ≡ b ( mod d ) and
x ≡ y ( mod d ), then
a + x ≡ b + y ( mod d )
and
ax ≡ by ( mod d ).
P ROOF.
a) There exist integers k, q such that a − b = dk, x − y = dq. Then
( a − b ) + ( x − y ) = d ( k + q ), whence
( a + x ) − ( b + y ) = d ( k + q ), i.e., a + x ≡ b + y ( mod d ).
b) There exist integers k, q such that a = b + dk, x = y + dq. Then
ax = ( b + dk ) ( y + dq ) = by + d ( ky + bq + dkq ). Setting
t = ky + bq + dkq gives ax = by + dt, i.e., ax ≡ by ( mod d ).

26. Assume that every positive integer can be written in one of the forms 3k ,
3k + 1, 3k + 2 for some integer k. Show that if the square of a positive
integer is divisible by 3, then so is the integer.
P ROOF.
For any positive integer a, either:
a) a = 3k, b) a = 3k + 1, or c) a = 3k + 2.
a) Suppose a = 3k . Then
a 2 = ( 3k )2 = 9k 2 = 3 ( 3k 2 ).
a 2 is divisible by 3 and a is divisible by 3.
b) Suppose a = 3k + 1. Then
a 2 = ( 3k + 1 )2 = 9k 2 + 6k + 1 = 3 ( 3k 2 + 2k ) + 1.
a 2 is not divisible by 3 and a is not divisible by 3.
c) Suppose a = 3k + 2. Then
a 2 = ( 3k + 2 )2 = 9k 2 + 12k + 4 = 3 ( 3k 2 + 4k + 1) + 1.
a 2 is not divisible by 3 and a is not divisible by 3.

Chapter 1 - § 4 Page 3 out of 3

You might also like