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

Difference between revisions of "2015 AIME I Problems/Problem 14"

(→‎Problem)
(Made nicer with LaTeX, corrected the answer.)
Line 5: Line 5:
 
==Solution==
 
==Solution==
  
−
By considering the graph of this function, it is shown that the graph is composed of trapezoids ranging from a^2 to (a+1)^2 with the top made of diagonal line y=ax. The width of each trapezoid is 3, 5, 7, etc. Whenever a is odd, the value of A(n) increases by an integer value, plus 1/2. Whenever a is even, the value of A(n) increases by an integer value. Since each trapezoid is always odd in width, every value of n is not an integer when a mod 4 is 2, and is an integer when a mod 4 is 0. Every other value is an integer when a is odd. Therefore, it is simply a matter to determine the number of n's where a mod 4 is 0, and add the number of n's where a is odd, through using Gauss's formula. Adding the two values gives 434.
+
By considering the graph of this function, it is shown that the graph is composed of trapezoids ranging from <math>a^2</math> to <math>(a+1)^2</math> with the top made of diagonal line <math>y=ax</math>. The width of each trapezoid is <math>3, 5, 7</math>, etc. Whenever <math>a</math> is odd, the value of <math>A(n)</math> increases by an integer value, plus <math>\frac{1}{2}</math>. Whenever <math>a</math> is even, the value of <math>A(n)</math> increases by an integer value. Since each trapezoid always has an odd width, every value of <math>n</math> is not an integer when <math>a \pmod{4} \equiv 2</math>, and is an integer when <math>a \pmod{4} \equiv 0</math>. Every other value is an integer when <math>a</math> is odd. Therefore, it is simply a matter to determine the number of values of <math>n</math> where <math>a \pmod{4} \equiv 0</math>, and add the number of values of <math>n</math> where <math>a</math> is odd, through using Gauss's formula. Adding the two values gives <math>231+252=483</math>.
  
 
==See Also==
 
==See Also==
 
{{AIME box|year=2015|n=I|num-b=13|num-a=15}}
 
{{AIME box|year=2015|n=I|num-b=13|num-a=15}}
 
{{MAA Notice}}
 
{{MAA Notice}}

Revision as of 12:58, 21 March 2015

Problem

For each integer $n \ge 2$, let $A(n)$ be the area of the region in the coordinate plane deefined by the inequalities $1\le x \le n$ and $0\le y \le x \left\lfloor \sqrt x \right\rfloor$, where $\left\lfloor \sqrt x \right\rfloor$ is the greatest integer not exceeding $\sqrt x$. Find the number of values of $n$ with $2\le n \le 1000$ for which $A(n)$ is an integer.

Solution

By considering the graph of this function, it is shown that the graph is composed of trapezoids ranging from $a^2$ to $(a+1)^2$ with the top made of diagonal line $y=ax$. The width of each trapezoid is $3, 5, 7$, etc. Whenever $a$ is odd, the value of $A(n)$ increases by an integer value, plus $\frac{1}{2}$. Whenever $a$ is even, the value of $A(n)$ increases by an integer value. Since each trapezoid always has an odd width, every value of $n$ is not an integer when $a \pmod{4} \equiv 2$, and is an integer when $a \pmod{4} \equiv 0$. Every other value is an integer when $a$ is odd. Therefore, it is simply a matter to determine the number of values of $n$ where $a \pmod{4} \equiv 0$, and add the number of values of $n$ where $a$ is odd, through using Gauss's formula. Adding the two values gives $231+252=483$.

See Also

2015 AIME I (Problems • Answer Key • Resources)
Preceded by
Problem 13 		Followed by
Problem 15
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15
All AIME Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2015_AIME_I_Problems/Problem_14&oldid=69346"