1.
5,078 = 150(33)+128 is the first step in finding the greatest common divisor of two numbers. Which of the following is the next step in the Euclidian Algorithm?
A. 
B. 
C. 
D. 
2.
The Euclidian Algorithm is performed to find the greatest common divisor of 1,622 and 136. Which of the following is a step in this Euclidian Algorithm?
A. 
B. 
C. 
D. 
3.
If can be simplified to a fraction form , where a and b are mutually prime integers, what is a+b?
A. 
B. 
C. 
D. 
4.
If a and b share a greatest common divisor of c, what is the least common multiple of a and b?
A. 
B. 
C. 
D. 
5.
If can be simplified to a fraction form , where a and b are mutually prime integers, what is a+b?
A. 
B. 
C. 
D. 
6.
Let P represent the set of all numbers of the form where x, y, and z are prime numbers less than 20. How many elements are contained in set P ?
A. 
B. 
C. 
D. 
7.
How many factors does have if x, y, and z are integers?
A. 
B. 
C. 
D. 
8.
The greatest common divisor of . How many factors of X are there?
A. 
B. 
C. 
D. 
9.
What is the greatest common divisor of 4986, 5022, 5058, and 5490?
A. 
B. 
C. 
D. 
10.
Find the least common multiple of 12, 18, 24, and 30.
A. 
B. 
C. 
D. 
11.
Find the least common multiple of 18, 27, 36, 48, 81.
A. 
B. 
C. 
D. 
12.
How many integers between 1 and 1000, inclusive, are a multiple of either 3 or 7?
A. 
B. 
C. 
D. 
13.
How many integers between 1 and 1000, inclusive, are a multiple of either 5 or 9?
A. 
B. 
C. 
D. 
14.
To prove that , the first step in a proof by mathematical induction is which of the following?
A. 
B. 
C. 
D. 
15.
has a positive integer exponents and is between 4000 and 5000, which of the following could be x+y+z?
A. 
B. 
C. 
D.