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 "Mock AIME II 2012 Problems"

(Created page with "==Problem 1== Given that <cmath>\left(\dfrac{6^2-1}{6^2+11}\right)\left(\dfrac{7^2-2}{7^2+12}\right)\left(\dfrac{8^2-3}{8^2+13}\right)\cdots\left(\dfrac{2012^2-2007}{2012^2+2017}...")
 
Line 3: Line 3:
  
 
[[Mock AIME II 2012 Problems/Problem 1 |Solution]]
 
[[Mock AIME II 2012 Problems/Problem 1 |Solution]]
 +
 +
==Problem 2==
 +
Let <math>\{a_n\}</math> be a recursion defined such that <math>a_1=1, a_2=20</math>, and <math>a_n=\sqrt{\left| a_{n-1}^2-a_{n-2}^2 \right|}</math> where <math>n\ge 3</math>, and <math>n</math> is an integer. If <math>a_m=k</math> for <math>k</math> being a positive integer greater than <math>1</math> and <math>m</math> being a positive integer greater than 2, find the smallest possible value of <math>m+k</math>.
 +
 +
[[Mock AIME II 2012 Problems/Problem 2| Solution]]
 +
 +
==Problem 3==
 +
The <math>\textit{digital root}</math> of a number is defined as the result obtained by repeatedly adding the digits of the number until a single digit remains. For example, the <math>\textit{digital root}</math> of <math>237</math> is <math>3</math> (<math>2+3+7=12, 1+2=3</math>). Find the <math>\textit{digital root}</math> of <math>2012^{2012^{2012}}</math>.
 +
 +
[[Mock AIME II 2012 Problems/Problem 3| Solution]]

Revision as of 23:56, 4 April 2012

Problem 1

Given that \[\left(\dfrac{6^2-1}{6^2+11}\right)\left(\dfrac{7^2-2}{7^2+12}\right)\left(\dfrac{8^2-3}{8^2+13}\right)\cdots\left(\dfrac{2012^2-2007}{2012^2+2017}\right)=\dfrac{m}{n},\] where $m$ and $n$ are positive relatively prime integers, find the remainder when $m+n$ is divided by $1000$.

Solution

Problem 2

Let $\{a_n\}$ be a recursion defined such that $a_1=1, a_2=20$, and $a_n=\sqrt{\left| a_{n-1}^2-a_{n-2}^2 \right|}$ where $n\ge 3$, and $n$ is an integer. If $a_m=k$ for $k$ being a positive integer greater than $1$ and $m$ being a positive integer greater than 2, find the smallest possible value of $m+k$.

Solution

Problem 3

The $\textit{digital root}$ of a number is defined as the result obtained by repeatedly adding the digits of the number until a single digit remains. For example, the $\textit{digital root}$ of $237$ is $3$ ($2+3+7=12, 1+2=3$). Find the $\textit{digital root}$ of $2012^{2012^{2012}}$.

Solution

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=Mock_AIME_II_2012_Problems&oldid=46127"