Mock AIME II 2012 Problems
Revision as of 23:57, 4 April 2012 by Testingtesting (talk | contribs)
Problem 1
Given that where and are positive relatively prime integers, find the remainder when is divided by .
Problem 2
Let be a recursion defined such that , and where , and is an integer. If for being a positive integer greater than and being a positive integer greater than 2, find the smallest possible value of .
Problem 3
The 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 of is (). Find the of .