Scribd
Upload
58 views8 pages

Chapter 2 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
58 views8 pages

Chapter 2 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/ 8

PRACTICE TEST

Chapter 2: Integers and Mathematical Induction

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.

For exercises 1 through 11, let a = 250 and b =111.

1. Use the Euclidean algorithm to find the gcd (a, b).


A: 250
B: 111
C: 1
D: 3

2. Find integers s and t so that gcd(a,b) = sa + tb. Then the value of s is?
A: s = 4
B: s = -9
C: s = -4
D: s = 9

3. Find 250 mod 111.


A: 2
B: 28
C: 111
D: 1

©2010 Cengage Learning Asia Pte Ltd


4. Find 250 div 111.
A: 2
B: 28
C: 111
D: 1

5. Find lcm (a, b).


A: 250
B: 111
C: 27750
D: 1

6. Are a and b relatively prime?


A: yes, since gcd = 1
B: no, because gcd = 250
C: no, because gcd = 111
D: yes, because 250 div 2 111 = 2

7. Write b in binary form, the right most 4 digits are equal to


A: 1011
B: 0111
C: 0101
D: 1111

©2010 Cengage Learning Asia Pte Ltd


8. Write a in binary form, and compute the sum a + b, the right most 4 digits are
equal to
A: 1001
B: 0111
C: 0101
D: 1111

9. Write a in hexadecimal form, the right most digit is


A: A
B: B
C: F
D: 10

10. Represent b in two's complement, the last four digits are


A: 1001
B: 1010
C: 0101
D: 0001

11. Find the base 10 integer x whose binary representation would be b.


A: 10
B: 7
C: 111
D: 3

©2010 Cengage Learning Asia Pte Ltd


12. If one is to use Mathematical Induction to prove that 3 divides n3  n for all
positive integers n, what is the basis step?
A: n = 1
B: 3 divides 0
C: 1-1 = 0
D: 3 divides k3 – k

13. If one is to use Mathematical Induction to prove that n! > n2 for all integers n
greater than 4, what is the basis step?
A: n = 1
B: 1  1
C: 24 > 16
D: 120  25

14. If one is to use Mathematical Induction to prove that (3n+1) < 3n for all integers n
greater than 2, what is the induction hypothesis?
A: n = k
B: 7 < 9
C: 3 < 4
D: assume (3k+1) < 3k

15. You need to determine if 1367 is a prime. Your friend suggests you need to check
all integers up to 1367 to determine if one of these integers divides 1367. Is your
friend correct?
A: Yes
B: No, only check the primes up to 1367.
C: No, only check the primes up to the square root of 1367.
D: No, only check the primes up to n/2.

16. Determine which of the following are prime.


i. 10101
ii. 1010101
A: only (ii) is prime
B: only (i) is prime
C: both are prime

©2010 Cengage Learning Asia Pte Ltd


D: neither is prime

17. Explain why n3 + 27 is not a prime for any positive integer n.


A: because n+3 is a divisor
B: because 3 divides 27
C: because n divides n3
D: because 3 divides n3 + 27

18. Find a counterexample to the statement: n2 + 1 is prime when n is even. The


statement is false when
A: n = 4
B: n = 6
C: n = 8
D: n = 10

19. Is it true that n2 + 1 is not prime when n is odd?


A: yes
B: no, when n = 2, 5 is prime
C: no, when n = 1, 2 is prime
D: no, when n = 4, 17 is prime

20. What is the largest integer n so that n! has the same prime divisors as 19! ?
A: 23
B: 22
C: 21
D: 20

©2010 Cengage Learning Asia Pte Ltd


21. Explain why f(x) = ax2 + bx + c, where a, b, and c are positive integers, can not be
prime for every choice of an integer x.
A: x = a, fails
B: x = b, fails
C: x = c, fails
D: x = 0, fails

22. Express 24500 as a product of primes.


A: 4*125*49
B: 2*5*7
C: 10*245
D: 22*53*72

23. How many positive divisors does 24500 have? Explain.


A: 36
B: 24
C: 72
D: 42

24. Find all the prime factors of 100!


A: 2, 3, 5, 7, 9
B: 2, 5
C: 1, 2, 5
D: all primes  100

25. Seven consecutive composite numbers may be found if we begin with:


A: 7
B: 8
C: 7!
D: 8! + 2

©2010 Cengage Learning Asia Pte Ltd


26. Any odd prime > 3 must be of the form:
A: 6n+1
B: 6n+5
C: 6n+3
D: a or b

27. Why does the equation 15x + 12y = 17 have no solutions in the integers?
A: gcd (15, 12) = 3, and 3 does not divide 17.
B: gcd(15,17) =1
C: gcd(12,17) = 1
D: gcd(27,17) =1

28. For what values of c does the equation 15x + 12y = c have solutions in the
integers?
A: only c = 3
B: only c = 1
C: any multiple of 3
D: any integer

29. Any object of integer weight > 1 be weighted on a balance scale using only
weights of size 5 and 9 since
A: 9-4 is a prime squared
B: 9 div 4 = 2
C: 9 mod 4 = 1
D: gcd(5,9) = 1

30. Find all integral solutions to the equation 3x + 5y = 7.


A: There are no solutions
B: x = -21 and y = 14
C: x= -21+5n and y=14-3n
D: x=-21-3n and y=14+5n

©2010 Cengage Learning Asia Pte Ltd


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

©2010 Cengage Learning Asia Pte Ltd

You might also like