Soru

Zorluk: OrtaRemainders and Units Digit Cyclicity

For any positive integer nn, let f(n)f(n) denote the remainder when 13n+17n13^n + 17^n is divided by 1010. What is the sum of all possible distinct values of f(n)f(n)?

  1. A
    00
  2. B
    88
  3. 1010Cevap
  4. D
    1818
  5. E
    2020

Cevap

The sum of all possible distinct values is 10.
Finding the remainder when a number is divided by 1010 is equivalent to finding its units digit. The units digit of 13n13^n follows the repeating pattern [3,9,7,1][3, 9, 7, 1], and the units digit of 17n17^n follows the repeating pattern [7,9,3,1][7, 9, 3, 1]. Adding these term-by-term yields units digits of (3+7)0(3+7) \rightarrow 0, (9+9)8(9+9) \rightarrow 8, (7+3)0(7+3) \rightarrow 0, and (1+1)2(1+1) \rightarrow 2. The set of distinct remainders is {0,8,2}\{0, 8, 2\}, and their sum is 0+8+2=100 + 8 + 2 = 10.

Adım Adım Çözüm

1
Relate division by 10 to units digits
The remainder when any positive integer is divided by 1010 is equal to its units digit. Therefore, f(n)f(n) is the units digit of 13n+17n13^n + 17^n, which depends only on the units digits of 3n3^n and 7n7^n.
Dividing by 10 isolates the ones place of an integer.
2
Determine the units digit pattern for 3n3^n and 7n7^n
The units digits of 3n3^n follow a 4-term repeating cycle: [3,9,7,1][3, 9, 7, 1]. The units digits of 7n7^n follow a 4-term repeating cycle: [7,9,3,1][7, 9, 3, 1].
Powers of integers exhibit periodic patterns in their units digits.
3
Evaluate f(n)f(n) for each term in the 4-step pattern
For n=1n=1: units digit of 3+7=103 + 7 = 10 is 00, so f(1)=0f(1) = 0.
For n=2n=2: units digit of 9+9=189 + 9 = 18 is 88, so f(2)=8f(2) = 8.
For n=3n=3: units digit of 7+3=107 + 3 = 10 is 00, so f(3)=0f(3) = 0.
For n=4n=4: units digit of 1+1=21 + 1 = 2 is 22, so f(4)=2f(4) = 2.
Test one full period of length 4 to find all possible outputs.
4
Find the sum of all distinct values
The distinct values of f(n)f(n) are 00, 88, and 22. Their sum is 0+8+2=100 + 8 + 2 = 10.
The question asks for the sum of distinct possible remainders.

Anahtar Kavram

Units Digit Cyclicity and Modular Arithmetic
Tahmini Süre:1m 45s
Bu soruyu puanla