返回题库

AIME 2026 I · 第 8 题

AIME 2026 I — Problem 8

专题
Contest Math
难度
L4
来源
AIME

题目详情

Problem

Let NN be the number of positive integer divisors of 170171717017^{17} that leave a remainder of 55 upon division by 1212. Find the remainder when NN is divided by 10001000.

解析

Solution 1

First, observe that 1701717=71711171317171717017^{17}=7^{17}\cdot 11^{17}\cdot 13^{17}\cdot 17^{17}. Thus, every factor of this must be in the form 7a11b13c17d7^a\cdot 11^b\cdot 13^c\cdot 17^d. For a factor to be 5(mod12)5\pmod{12}, it must be both 2(mod3)2\pmod{3} and 1(mod4)1\pmod{4}. Now, since

7a11b13c17d(1)b+d(mod3)7^a\cdot 11^b\cdot 13^c\cdot 17^d\equiv (-1)^{b+d}\pmod{3} and

7a11b13c17d(1)a+b(mod4),7^a\cdot 11^b\cdot 13^c\cdot 17^d\equiv (-1)^{a+b}\pmod{4}, we must have that b+db+d odd and a+ba+b is even.

Notice that since c{0,1,...,17}c\in \{0, 1, ..., 17\}, there are 1818 choices for cc. Also, for every b{0,1,...,17}b\in\{0, 1, ..., 17\} there are always 99 choices for aa and 99 choices for dd. Hence, the answer is 181899244(mod1000)18\cdot 18\cdot 9\cdot 9\equiv \boxed{\textbf{244}}\pmod{1000}.

~Mathkiddie

Solution 2

Note 17017=171001=711131717017=17\cdot1001=7\cdot11\cdot13\cdot17.

By taking each of the factors mod 1212 we get:

75(mod12)7\equiv-5\pmod{12}, 111(mod12)11\equiv-1\pmod{12}, 131(mod12)13\equiv1\pmod{12}, 175(mod12)17\equiv5\pmod{12}.

Let a factor n=7a11b13c17dn=7^a11^b13^c17^d.

By noting 521(mod12)5^2\equiv1\pmod{12} and (1)21(mod12)(-1)^2\equiv1\pmod{12} and the fact that we want n5(mod12)n\equiv5\pmod{12}, we need a+da+d to be odd and a+ba+b to be even. From here, we compute that for a fixed aa, there are 99 options for bb and 99 options for dd. As aa and cc may be 1818 options, the answer is 991818=262449\cdot9\cdot18\cdot18=26244. The requested remainder is 244244.

~SilverRush

Solution 3 (Easy to understand, only basic mod needed)

We have 17017=171001=711131717017 = 17 * 1001 = 7 * 11 * 13 * 17 Take all powers (mod12)\pmod{ 12}. We get some nice patterns. For example, taking all powers of 7 mod 12 we get:

(7, 1, 7, 1, 7, 1....) so we have a pattern!

Now for 11, we get that 11 is 1-1 mod 12, so:

(11, 1, 11, 1, 11, 1...) is a pattern

For 13, it is 1 mod 12 so:

(1, 1, 1, 1, 1, ...)

For 17 it is 5 mod 12 so:

(5, 1, 5, 1....)

We realize to get 5 mod 12 we either have 1 * 1 * 1 * 5 or 7 * 11 * 1 * 1.

For both cases we have 9 (9 powers of 7 from 707^0 to 7177^{17} are congruent to 1 mod 12) * 9 (9 powers of 11 from 11011^0 to 111711^{17} are congruent to 1 mod 12)* 9 (9 powers of 17 are congruent to 5 mod 12) * 18 (18 powers of 13 are 1 mod 12) ways to do it.

So we have 122*2 (mod 1000)

So finding this mod 1000 we get 244\boxed{244}

~Aarav22 (Did not make AIME).

Solution 4

We factor 17017=711131717017 = 7 \cdot 11 \cdot 13 \cdot 17.

We convert the factors into modulo 1212, 75(mod12)7 \equiv -5 \pmod{12}, 111(mod12)11 \equiv -1 \pmod{12}, 131(mod12)13 \equiv 1 \pmod{12}, and 175(mod12)17 \equiv 5 \pmod{12}.

Since 55 raised to an odd power is congruent to 5(mod12)5 \pmod{12}, we split into cases.

Case 1: odd exponent of 77 and even exponent of 1717.

There are 99 choices for the odd exponent of 77, 99 choices for the odd exponent of 1111, 1818 choices for the exponent of 1313 as it is 1(mod12)1 \pmod{12}, and 99 choices for the even exponent of 1717.

This yields 99189=13,1229 \cdot 9 \cdot 18 \cdot 9 = 13{,}122 values.

Case 2: even exponent of 77 and odd exponent of 1717.

There are 99 choices for the even exponent of 77, 99 choices for the even exponent of 1111, 1818 choices for the exponent of 1313 as it is 1(mod12)1 \pmod{12}, and 99 choices for the odd exponent of 1717. This also yields 99189=13,1229 \cdot 9 \cdot 18 \cdot 9 = 13{,}122 values.

Thus, the total number is 13,122+13,122=26,244244(mod1000)13{,}122 + 13{,}122 = 26{,}244 \equiv \boxed{244} \pmod{1000}.

~plin

Video Solution (Fast and Easy 🔥🚀)

2026 AIME I #8

By piacademyus.org