How many of the first numbers in the sequence are divisible by ?
- A)
- B)
- C)
- D)
- E)
Answer
C
Key insight
Terms are 10^k + 1 for k = 2 to 2019; since 100 is -1 mod 101, divisibility by 101 happens exactly when k is 2 mod 4.
Solution
The -th term is , so the first terms are for .
Work modulo . Since , the powers of cycle with period :
We need , which happens exactly when .
Count the exponents with : they are , an arithmetic progression with common difference , so there are
of them.
The answer is .
Why this works
Divisibility of by a fixed number depends only on modulo the order of ; here makes the order and singles out . Translate the problem into a congruence condition on the index, then count indices carefully, including the offset in where the sequence starts.
Alternative approach
Check the first few terms directly: is divisible, is not, is not, is not, is. Every fourth term starting with the first works, and among terms that is .
The trap
Indexing the exponent from 1 instead of 2 (the first term is 10^2 + 1), or counting every other term (1009) as divisible instead of every fourth.
Common mistakes
- Indexing the exponent from 1 instead of 2 (the first term is 10^2 + 1), or counting every other term (1009) as divisible instead of every fourth.
- Getting by computing and truncating, forgetting that the pattern starts at the very first term.
Techniques
Compute small cases, spot the pattern, generalize