Scribd
Upload
104 views7 pages

Chapter 6 Practice Test

Uploaded by

Doctor Vidda
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
104 views7 pages

Chapter 6 Practice Test

Uploaded by

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

PRACTICE TEST

Chapter 6: Congruences

INSTRUCTIONS: Answer each question below. Once you finish taking the test, check
the answers provided in the Answer Key at the end of this test.

1. The least nonnegative integer x so that 121= x (mod 8).


A: 1
B: 9
C: 8
D: none of the above

2. Find the least nonnegative integer x so that 121= x (mod 4).


A: 1
B: 5
C: 4
D: none of the above

3. Find the least nonnegative integer x so that 121 = x (mod 11).


A: 0
B: 1
C: 11
D: none of the above

4. What is the remainder when 1+3+5+...+99 is divided by 2?


A: 0
B: 1
C: 2
D: none of the above

5. What is the remainder when 1! + 2! + 3! +...+ 150! is divided by 7?


A: 1
B: 3

©2010 Cengage Learning Asia Pte Ltd


C: 5
D: cannot be determined

6. What should for the digit x so that 2x369 is divisible by 11?


A: 0
B: 1
C: 3
D: 8

7. How many choices are there for the digit x be so that 235x4 is divisible by 6?
A: 1
B: 3
C: 4
D: 7

8. How many choices are there for the digits x and y so that 37542xy is divisible by
8?
A: 10
B: 11
C: 12
D: 13

9. If the first 9 digits of an ISBN are 0-534- 93189, then what is the check digit?
A: 3
B: 6
C: 8
D: X

10. If 0-89x77-264-7 is a valid ISBN what is x?


A: 2
B: 3
C: 5
D: 7

11. If the first 11 digits of a12 digit UPC are 0 74182 29082, then what is the check

©2010 Cengage Learning Asia Pte Ltd


digit?
A: 3
B: 5
C: 7
D: 9

12. Is 890103114519 6 a valid UPC?


A: no, check digit should be 2
B: yes
C: no, check digit should be 9
D: cannot be determined

13. Could 4368 2358 9683 1135 be a Master card or a Visa card number?
A: Mastercard
B: Visa
C: neither
D: could be either

14. If is 4368 2358 9683 1135 a Master card or a Visa card number, what is the check
digit?
A: 4
B: 5
C: 3
D: cannot be determined

15. Is 4368 2358 9683 1135 a valid Master card or a Visa card number?
A: no, because of the leading digit
B: yes
C: no, because of the last digit
D: cannot be determined

16. The check digit of a 13-digit ISBN 978-81-315-0172- is


A: 21
B: 19

©2010 Cengage Learning Asia Pte Ltd


C: 17
D: does not exist

17. Does 6x  8 (mod 12) have a solution?


A: no, since gcd(6,12) does not divide 8
B: no, since gcd(8,12) does not divide 6
C: yes, since gcd(6,8) divides 12
D: yes, since gcd(6,8) >1

18. How many solutions does 15x  7( mod 19) have modulo 19?
A: 0
B: 1
C: 7
D: 14

19. Find all solutions of 4x  10(mod 22).


A: 8
B: 8 and 17
C: there are no solutions
D: none of the above

20. Find an inverse of 19 modulo 40, if it exists.


A: 21
B: 19
C: 17
D: does not exist

21. Solve the system of congruences

x  2 (mod 3)
x  1 (mod 5)
x  3 (mod 7)

What is the smallest non-negative solution less than 105?


A: 101
B: 93

©2010 Cengage Learning Asia Pte Ltd


C: 1
D: there is not

22. Find the positive integer m < 105 that has modular representation (2,1,3) with
respect to the moduli 3, 5, and 7.
A: 101
B: 93
C: 1
D: there is not one

23. Find the smallest positive integer greater than 100 that when divided by 2, 5, and
7 leaves a remainder of 1, 2, and 4 respectively.
A: 133
B: 137
C: 167
D: there is not one

24. Suppose there are five workers in a shop and there ID’s are 942, 105, 286, 715,
and 809. Suppose the hash table is of size 7 indexed by 0, 1, 2, ... , 6. If the hash
function h(k) = k (mod 7) will there be collisions?
A: yes, 105 and 715 collide
B: yes, 942 and 286 collide
C: yes, 942 and 809 collide
D: no there are no collisions

25. What is the remainder when 9513 is divided by 11?


A: 3
B: 5
C: 7
D: 9

26. Find the integer in the unit place of 713.


A: 1
B: 3
C: 7

©2010 Cengage Learning Asia Pte Ltd


D: 9

27. Find (245).


A: 245
B: 168
C: 84
D: none of the above

28. Find the remainder when 31171 is divided by 245.


A: 1
B: 131
C: 146
D: none of the above

29. Find the remainder when 16! is divided by 17.


A: 10
B: 12
C: 14
D: 16

30. The remainder when 54 + 84 -1 is divided by 40.


A: 0
B: 1
C: 5
D: 8

©2010 Cengage Learning Asia Pte Ltd


Answers:

1. A 2. A 3. C 4. B 5. C 6. D 7. B 8. D 9. C 10. C
11. B 12. A 13. B 14. B 15. C 16. B 17. A 18. B 19. D 20. B
21. A 22. A 23. B 24. C 25. A 26. C 27. B 28. C 29. D 30. A

©2010 Cengage Learning Asia Pte Ltd

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