Scribd
Upload
88 views

Chapter4 - Test Bank

This document contains 100 multiple choice and proof-based questions related to number theory topics like modular arithmetic, prime factorization, greatest common divisors, and more. The questions range in difficulty from basic computations to proofs. An answer key is provided with explanations for some proof-based questions. The questions are numbered 1 through 100 and cover a wide variety of concepts tested in a typical number theory course.

Uploaded by

busati
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
88 views

Chapter4 - Test Bank

This document contains 100 multiple choice and proof-based questions related to number theory topics like modular arithmetic, prime factorization, greatest common divisors, and more. The questions range in difficulty from basic computations to proofs. An answer key is provided with explanations for some proof-based questions. The questions are numbered 1 through 100 and cover a wide variety of concepts tested in a typical number theory course.

Uploaded by

busati
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Chapter 4 Test Bank 497

Questions for Chapter 4


1. What does a 60-second stop watch read 82 seconds after it reads 27 seconds?
2. What does a 60-second stop watch read 54 seconds before it reads 19 seconds?
In 3–6 suppose that a and b are integers, a ≡ 4 (mod 7), and b ≡ 6 (mod 7). Find the integer c with 0 ≤ c ≤ 6
such that
3. c ≡ 3a (mod 7)
4. c ≡ 5b (mod 7)
5. c ≡ 2a + 4b (mod 7)
6. c ≡ a2 − b2 (mod 7)
7. Prove or disprove: For all integers a, b, c, d , if a | b and c | d, then (a + c) | (b + d).
8. Prove or disprove: For all integers a, b, c , if a | b and b | c then a | c.
9. Prove or disprove: For all integers a, b, c , if a | c and b | c, then (a + b) | c.
10. Prove or disprove: For all integers a, b, c, d , if a | b and c | d, then (ac) | (b + d).
11. Prove or disprove: For all integers a, b , if a | b and b | a, then a = b.
12. Prove or disprove: For all integers a, b, c , if a | (b + c), then a | b and a | c.
13. Prove or disprove: For all integers a, b, c , if a | bc , then a | b or a | c .
14. Prove or disprove: For all integers a, b, c , if a | c and b | c , then ab | c2 .
15. Find the prime factorization of 1,024.
16. Find the prime factorization of 1,025.
17. Find the prime factorization of 510,510 .
18. Find the prime factorization of 8,827 .
19. Find the prime factorization of 45,617 .
20. Find the prime factorization of 111,111 .
21. List all positive integers less than 30 that are relatively prime to 20.
22. Find gcd(20!, 12!) by directly finding the largest divisor of both numbers.
23. Find gcd(289 , 2346 ) by directly finding the largest divisor of both numbers.
24. Find lcm (20!, 12!) by directly finding the smallest positive multiple of both numbers.
25. Find lcm (289 , 2346 ) by directly finding the smallest positive multiple of both numbers.
26. Suppose that the lcm of two numbers is 400 and their gcd is 10. If one of the numbers is 50, fi
nd the other number.
27. Applying the division algorithm with a = −41 and d = 6 yields what value of r ?
28. Find 18 mod 7 .
29. Find −88 mod 13 .
30. Find 289 mod 17 .
31. Find the hexadecimal expansion of (ABC) 16 + (2F5) 16 .
32. Prove or disprove: A positive integer congruent to 1 modulo 4 cannot have a prime
factor congruent to 3 modulo 4.
33. Find 50! mod 50.
34. Find 50! mod 49!.
35. Prove or disprove: The sum of two primes is a prime.
36. Prove or disprove: If p and q are primes ( > 2 ), then p + q is composite.
37. Prove or disprove: There exist two consecutive primes, each greater than 2.
38. Prove or disprove: The sum of two irrational numbers is irrational.
39. Prove or disprove: If a and b are rational numbers (not equal to zero), then ab is rational.
40. Prove or disprove: If f (n) = n2 − n + 17 , then f (n) is prime for all positive integers n .
498 Test Bank Questions and Answers

41. Prove or disprove: If p and q are primes ( > 2 ), then pq + 1 is never prime.
42. Find three integers m such that 13 ≡ 7 (mod m).
43. Find the smallest integer a > 1 such that a + 1 ≡ 2a (mod 11 ).
44. Find four integers b (two negative and two positive) such that 7 ≡ b (mod 4).
45. Find an integer a such that a ≡ 3a (mod 7).
46. Find integers a and b such that a + b ≡ a − b (mod 5).
47. Find a div m and a mod m when a = 76, m = 52.
48. Find a div m and a mod m when a = −33, m = 67.
49. Find a div m and a mod m when a = 511, m = 113.
50. Find the integer a such that a = 71 (mod 47) and −46 ≤ a ≤ 0 .
51. Find the integer a such that a = 89 (mod 19) and −9 ≤ a ≤ 9 .
52. Find the integer a such that a = 71 (mod 41) and 160 ≤ a ≤ 200.
In 53–56 find each of these values
53. (123 mod 19 + 342 mod 19) mod 19
54. (123 mod 19 · 342 mod 19) mod 19
55. (122 mod 17)3 mod 11
56. (54 mod 7)3 mod 13
57. Show that if a, b, k and m are integers such that k ≥ 1, m ≥ 2 , and a ≡ b (mod m ),
then ka ≡ kb (mod m ).
In questions 58–64 determine whether each of the following “theorems” is true or false. Assume that
a , b , c , d , and m are integers with m > 1 .
58. If a ≡ b (mod m ), and a ≡ c (mod m ), then a ≡ b + c (mod m) .
59. If a ≡ b (mod m ) and c ≡ d (mod m ), then ac ≡ b + d (mod m ).
60. If a ≡ b (mod m ), then 2a ≡ 2b (mod m ).
61. If a ≡ b (mod m ), then 2a ≡ 2b (mod 2m ).
62. If a ≡ b (mod m ), then a ≡ b (mod 2m ).
63. If a ≡ b (mod 2m ), then a ≡ b (mod m ).
64. If a ≡ b (mod m2 ), then a ≡ b (mod m ).
65. Either find an integer x such that x ≡ 2 (mod 6) and x ≡ 3 (mod 9) are both true, or else
prove that there is no such integer.
66. What sequence of pseudorandom numbers is generated using the pure multiplicative generator xn+1 =
3xn mod 11 with seed x0 = 2 ?
68. Prove or disprove: if p and q are prime numbers, then pq + 1 is prime.
69. (a) Find two positive integers, each with exactly three positive integer factors greater than 1.
(b) Prove that there are an infinite number of positive integers, each with exactly three
positive integer factors greater than 1.
70. Convert (204)10 to base 2.
71. Convert (1 1101) 2 to base 16.
72. Convert (1 1101) 2 to base 10.
73. Convert (2AC)16 to base 10.
74. Convert (10,000) 10 to base 2.
75. Convert (8091)10 to base 2.
76. Convert (BC1) 16 to base 2.
77. Convert (100 1100 0011) 2 to base 16.
78. Convert (271)8 to base 2.
79. Convert (6253)8 to base 2.
80. Convert (10 1011)2 to base 8.
81. Convert (110 1011 1100)2 to base 8.
502 Test Bank Questions and Answers

Answers for Chapter 4


1. 49 seconds
2. 25 seconds
3. 5
4. 2
5. 4
6. 1
7. False: a = b = c = 1, d = 2.
8. True: If b = ak and c = bl , then c = a(kl), so a | c.
9. False: a = b = c = 1.
10. False: a = b = 2, c = d = 1.
11. False: a = 1, b = −1 .
12. False: a = 2, b = c = 3.
13. False: a = 4, b = 2, c = 6.
14. True: If c = ak and c = bl , then c2 = ab(kl), so ab | c2 .
15. 210
16. 52 · 41
17. 2 · 3 · 5 · 7 · 11 · 13 · 17
18. 7 · 13 · 97
19. 112 · 13 · 29
20. 3 · 7 · 11 · 13 · 37
21. 1, 3, 7, 9, 11, 13, 17, 19, 21, 23, 27, 29
22. 12!
23. 289
24. 20!
25. 2346
26. 80
27. 1
28. 4
29. 3
30. 0
31. (DB1) 16
32. False: 9 = 4·2+1 = 3·3
33. 0
34. 0
35. False; 3 + 5 is not prime.
36. p + q is even, hence composite.
37. False; one of any two consecutive integers is even, hence not prime.
Chapter 4 Test Bank 503

√ √
38. False; 2 + (− 2) = 0.
√
39. False; (1/2)1/2 = 2/2 , which is not rational.
40. False, f (17) is divisible by 17 .
41. pq + 1 is an even number, hence not prime.
42. 2, 3, 6
43. 12
44. 3, 7, 11, 15, . . . , −1, −5, −9, . . .
45. 0, ±7, ±14, . . .
46. b = 0, ±5, ±10, ±15, . . . ; a any integer
47. 1, 24
48. −1 , 34
49. 4, 59
50. −23
51. -6
52. 194
53. 9
54. 0
55. 6
56. 8
57. The hypothesis a ≡ b (mod m ) means that m | (a − b). Therefore m | (k · (a − b)), which means precisely
that ka ≡ kb (mod m ).
58. False
59. False
60. True
61. True
62. False
63. True
64. True
65. There is no such x ; if there were, then there would be integers k and l such that x − 2 = 6k and x − 3 = 9l .
Hence 1 = 6k − 9l = 3(2k − 3l), which is not possible.
70. 1100 1100
71. 1D
72. 29
73. 684
74. 10 0111 0001 0000
75. 1 1111 1001 1011
76. 1011 1100 0001
77. 4C3
78. (1011 1001)2
79. (1100 1010 1011)2
80. (53)8
81. (3274)8
504 Test Bank Questions and Answers

66. The sequence 2, 6, 7, 10, 8 repeats.


b
67. a | b is a statement; represents a number.
a
68. False: p = q = 3 .
69. (a) 8, 27 (b) Any integer of the form p3 where p is prime

hence n2 ≡ 1 (mod 4).


95. 4
96. 1
97. 1
98. 100
99. 1
100. 20

You might also like