Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Mock AIME 1 2010 Problems/Problem 1

Revision as of 19:42, 12 March 2010 by Kevin Zhang (talk | contribs) (Created page with 'Since <math>n^2 = 7k+4</math>, <math>n^2</math> is congruent to <math>4</math> mod <math>7</math>. Taking the square root of both sides, we obtain <math>n</math> is congruent to…')
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Since $n^2 = 7k+4$, $n^2$ is congruent to $4$ mod $7$. Taking the square root of both sides, we obtain $n$ is congruent to $\pm 2$ mod $7$. Solving, $n$ is congruent to either $2$ or $5$ mod $7$. The maximum of $a_k$ is $14074$, of which the square root is between $118$ and $119$. So, $n$ must be less than $118$. The series of solutions for $n$ is $2, 9, 16...114$ and $5, 12, 19...117$. However, $2$ does not work because $2^2 = 4$, a value not possible for $a_k$. Thus, there are $16 + 17$ different solutions for a total of $\boxed{33}$ solutions.

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=Mock_AIME_1_2010_Problems/Problem_1&oldid=33856"