2018 AMC 10 B
Complete problem set with solutions and individual problem pages
How many of the first numbers in the sequence , , , , are divisible by ? (2018 AMC 10B Problem, Question#13)
- A.
- B.
- C.
- D.
- E.
The number is divisible by if and only if (mod ). We note that (mod ), so the powers of are periodic mod . It follows that (mod ) if and only if (mod ). In the given list, , , , , , the desired exponents are , , , , , and there are numbers in that list.
Note that for some odd will suffice mod . Each , so the answer is .
If we divide each number by , we see a pattern occuring in every numbers. , , , . We divide by to get with left over. Looking at our pattern of four numbers from above, the first number is divisible by . This means that the first of the left over will be divisible by , so our answer is .
Note that is divisible by , and thus is too. We know that is divisible and isn't so let us start from . We subtract to get . Likewise from we subtract, but we instead subtract times or to get . We do it again and multiply the by to get . Following the same knowledge, we can use mod to finish the problem. The sequence will just be subtracting , multiplying by , then adding . Thus the sequence is , , , , , . Thus it repeats every four. Consider the sequence after the term and we have numbers. Divide by four to get remainder . Thus the answer is plus the term or .
