Skip to content

Algebraic Number Theory: all problems

Focus mode: every practice problem from the chapter, one after another.

0 / 28 solved

Problem 25.6.1

AMC 10

There is a positive integer nn such that (n+1)!+(n+2)!=n!⋅440(n + 1)! + (n + 2)! = n! \cdot 440. What is the sum of the digits of nn?

Problem 25.6.2

AMC 10

This problem also appears in the book as 22.1.3.

For all integers n≥9n \ge 9, the value of

(n+2)!−(n+1)!n!\frac{(n + 2)! - (n + 1)!}{n!}

is always which of the following?

Click a choice or type its letter (A–E).

Problem 25.6.3

AMC 10

This problem also appears in the book as 24.1.10.

Let S(n)S(n) equal the sum of the digits of positive integer nn. For example, S(1507)=13S(1507) = 13. For a particular positive integer nn, S(n)=1274S(n) = 1274. Which of the following could be the value of S(n+1)S(n + 1)?

Click a choice or type its letter (A–E).

Problem 25.6.4

AMC 10

What is the greatest three-digit positive integer nn for which the sum of the first nn positive integers is not a divisor of the product of the first nn positive integers?

Problem 25.6.5

AMC 10

This problem also appears in the book as 19.2.6.

When a student multiplied the number 6666 by the repeating decimal

1.a‾ b‾ a‾ b‾…=1.a‾ b‾‾,1.\underline{a}\,\underline{b}\,\underline{a}\,\underline{b}\ldots = 1.\overline{\underline{a}\,\underline{b}},

where aa and bb are digits, he did not notice the notation and just multiplied 6666 times 1.a‾ b‾1.\underline{a}\,\underline{b}. Later he found that his answer is 0.50.5 less than the correct answer. What is the 2-digit number a‾ b‾\underline{a}\,\underline{b}?

Problem 25.6.6

AMC 10

What is the remainder when 2202+2022^{202} + 202 is divided by 2101+251+12^{101} + 2^{51} + 1?

Problem 25.6.7

AIME

Compute

(104+324)(224+324)(344+324)(464+324)(584+324)(44+324)(164+324)(284+324)(404+324)(524+324).\frac{(10^{4} + 324)(22^{4} + 324)(34^{4} + 324)(46^{4} + 324)(58^{4} + 324)}{(4^{4} + 324)(16^{4} + 324)(28^{4} + 324)(40^{4} + 324)(52^{4} + 324)}.

Problem 25.6.8

AMC 12

A sequence of numbers is defined by D0=0D_0 = 0, D1=0D_1 = 0, D2=1D_2 = 1 and Dn=Dn−1+Dn−3D_n = D_{n-1} + D_{n-3} for n≥3n \ge 3. What are the parities (evenness or oddness) of the triple of numbers (D2021,D2022,D2023)(D_{2021}, D_{2022}, D_{2023}), where EE denotes even and OO denotes odd?

Click a choice or type its letter (A–E).

Problem 25.6.9

AMC 10/12

Which of the following is equivalent to

(2+3)(22+32)(24+34)(28+38)(216+316)(232+332)(264+364)?(2 + 3)\left(2^{2} + 3^{2}\right)\left(2^{4} + 3^{4}\right)\left(2^{8} + 3^{8}\right)\left(2^{16} + 3^{16}\right)\left(2^{32} + 3^{32}\right)\left(2^{64} + 3^{64}\right)?
Click a choice or type its letter (A–E).

Problem 25.6.10

AMC 10

The ages of Jonie's four cousins are distinct single-digit positive integers. Two of the cousins' ages multiplied together give 2424, while the other two multiply to 3030. What is the sum of the ages of Jonie's four cousins?

Problem 25.6.11

AMC 10/12

Let ff be a function defined on the set of positive rational numbers with the property that f(a⋅b)=f(a)+f(b)f(a \cdot b) = f(a) + f(b) for all positive rational numbers aa and bb. Suppose that ff also has the property that f(p)=pf(p) = p for every prime number pp. For which of the following numbers xx is f(x)<0f(x) < 0?

Click a choice or type its letter (A–E).

Problem 25.6.12

AMC 12

Let ff be the unique function defined on the positive integers such that

∑d∣nd⋅f(nd)=1\sum_{d \mid n} d \cdot f\left(\frac{n}{d}\right) = 1

for all positive integers nn, where the sum is taken over all positive divisors of nn. What is f(2023)f(2023)?

Problem 25.6.13

AMC 10

Grandma has just finished baking a large rectangular pan of brownies. She is planning to make rectangular pieces of equal size and shape, with straight cuts parallel to the sides of the pan. Each cut must be made entirely across the pan. Grandma wants to make the same number of interior pieces as pieces along the perimeter of the pan. What is the greatest possible number of brownies she can produce?

Problem 25.6.14

AMC 12

In the state of Coinland, coins have values 66, 1010, and 1515 cents. Suppose xx is the value in cents of the most expensive item in Coinland that cannot be purchased using these coins with exact change. What is the sum of the digits of xx?

Problem 25.6.15

AMC 12

When a standard 6-sided die is rolled nn times, the product of the nn numbers rolled can be any of 936936 possible values. What is nn?

Problem 25.6.16

AMC 10

Square ABCDABCD has sides of length 44. Points PP and QQ lie on AD‾\overline{AD} and CD‾\overline{CD}, respectively, with AP=85AP = \frac{8}{5} and DQ=103DQ = \frac{10}{3}. A path begins along the segment from PP to QQ and continues by reflecting against the sides of ABCDABCD (with congruent incoming and outgoing angles). If the path hits a vertex of the square, it terminates there; otherwise it continues forever. At which vertex does the path terminate?

Click a choice or type its letter (A–E).

Problem 25.6.17(additional)

AMC 10

Consider the set of all fractions xy\frac{x}{y}, where xx and yy are relatively prime positive integers. How many of these fractions have the property that if both numerator and denominator are increased by 11, the value of the fraction is increased by 10%10\%?

Problem 25.6.18(additional)

AIME

Three clever monkeys divide a pile of bananas. The first monkey takes some bananas from the pile, keeps three-fourths of them, and divides the rest equally between the other two. The second monkey takes some bananas from the pile, keeps one-fourth of them, and divides the rest equally between the other two. The third monkey takes the remaining bananas from the pile, keeps one-twelfth of them, and divides the rest equally between the other two. Given that each monkey receives a whole number of bananas whenever the bananas are divided, and the numbers of bananas the first, second, and third monkeys have at the end of the process are in the ratio 3:2:13 : 2 : 1, what is the least possible total for the number of bananas?

Problem 25.6.19(additional)

AMC 10

There exists a unique strictly increasing sequence of nonnegative integers a1<a2<⋯<aka_1 < a_2 < \cdots < a_k such that

2289+1217+1=2a1+2a2+⋯+2ak.\frac{2^{289} + 1}{2^{17} + 1} = 2^{a_1} + 2^{a_2} + \cdots + 2^{a_k}.

What is kk?

Problem 25.6.20(additional)

AMC 10

For how many integers nn is n20−n\dfrac{n}{20 - n} the square of an integer?

Problem 25.6.21(additional)

AMC 10

The number 20132013 is expressed in the form

2013=a1! a2!⋯am!b1! b2!⋯bn!,2013 = \frac{a_1!\,a_2!\cdots a_m!}{b_1!\,b_2!\cdots b_n!},

where a1≥a2≥⋯≥ama_1 \ge a_2 \ge \cdots \ge a_m and b1≥b2≥⋯≥bnb_1 \ge b_2 \ge \cdots \ge b_n are positive integers and a1+b1a_1 + b_1 is as small as possible. What is ∣a1−b1∣|a_1 - b_1|?

Problem 25.6.22(additional)

AMC 10/12

For k>0k > 0, let Ik=10…064I_k = 10\ldots064, where there are kk zeros between the 11 and the 66. Let N(k)N(k) be the number of factors of 22 in the prime factorization of IkI_k. What is the maximum value of N(k)N(k)?

Click a choice or type its letter (A–E).

Problem 25.6.23(additional)

AMC 10

Two fair dice, each with at least 66 faces, are rolled. On each face of each die is printed a distinct integer from 11 to the number of faces on that die, inclusive. The probability of rolling a sum of 77 is 34\frac34 of the probability of rolling a sum of 1010, and the probability of rolling a sum of 1212 is 112\frac{1}{12}. What is the least possible number of faces on the two dice combined?

Problem 25.6.24(additional)

AMC 10

How many ordered pairs (m,n)(m, n) of positive integers, with m≥nm \ge n, have the property that their squares differ by 9696?

10² − 2² = 8 × 12 = 96

a10
b2
−2²a = 10a = 10
102−22=8×12=9610^2 - 2^2 = 8 \times 12 = 96
a2−b2=(a−b)(a+b)a^2 - b^2 = (a - b)(a + b)

10² − 2² = 8 × 12 = 96

Problem 25.6.25(additional)

AMC 10

For how many positive integers nn less than or equal to 2424 is n!n! evenly divisible by 1+2+⋯+n1 + 2 + \cdots + n?

Problem 25.6.26(additional)

AIME

Let S\mathcal{S} be the set of all perfect squares whose rightmost three digits in base 1010 are 256256. Let T\mathcal{T} be the set of all numbers of the form x−2561000\frac{x - 256}{1000}, where xx is in S\mathcal{S}. In other words, T\mathcal{T} is the set of numbers that result when the last three digits of each number in S\mathcal{S} are truncated. Find the remainder when the tenth smallest element of T\mathcal{T} is divided by 10001000.

Problem 25.6.27(additional)

AMC 10/12

For each integer n≥2n \ge 2, let SnS_n be the sum of all products jkjk, where jj and kk are integers and 1≤j<k≤n1 \le j < k \le n. What is the sum of the 1010 least values of nn such that SnS_n is divisible by 33?

Problem 25.6.28(additional)

AIME

Find the largest integer nn satisfying the following conditions:

(i) n2n^{2} can be expressed as the difference of two consecutive cubes;

(ii) 2n+792n + 79 is a perfect square.