|
5. When positive integer n is divided by 5, the remainder is x. When 2n is divided by
5, the remainder is y. Which pair (x, y) is not possible?
If you divide by 5, there are 5 possible remainders: 0, 1, 2, 3, or 4. If you double
the number you double the number of 5's and you double the remainder to 0, 2, 4, 6, or 8.
But wait, if the remainder is 6 or 8 you get another 5 so the remainders for 2n are
actually: 0, 2, 4, 1, and 3. So the pair of remainders could be: (0,0) or (1,2) or
(2,4) or (3,1) or (4,3). Choice (E) is not possible so this is the answer.
Show Answer Choices
|
Questions 6-8: The modulus is defined as follows:
j mod k = R where R is the remainder when positive integer j
is divided by positive integer k.
6. If j mod k = R which statement is true for any j and k?
You are dividing by k. If k were 5, the possible remainders would be 0, 1, 2, 3, or 4.
The remainder R is anywhere from 0 to k–1. The answer is (D).
Show Answer Choices
|
|
7. If j mod k = R and j < k then:
Now you are dividing a small number (j) by a big number (k). Suppose you do
7 divided by 25. The answer in "remainder language" is 0 with remainder 7. Whenever
you divide a small number by a big number the remainder is always the small number.
The answer is (A).
Show Answer Choices
|
8. If j mod k = R and k < j < 2k then:
Now you are doing something like 40 (j) divided by 25 (k)
(j is bigger than k but smaller than 2k). There is one 25 in 40 and the
remainder is 15 or j-k. The answer is (C). Note that it is very useful on SAT
problems to work with a concrete example. You are NOT writing your Ph.D. thesis
in mathematics; you just want the answer.
Show Answer Choices
|