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 1 2006-2007 Problems/Problem 2"

m
m
Line 5: Line 5:
  
 
----
 
----
−
[[Mock AIME 1 2006-2007/Problem 1 | Previous Problem]]
+
 
−
[[Mock AIME 1 2006-2007/Problem 3 | Next Problem]]
+
*[[Mock AIME 1 2006-2007/Problem 1 | Previous Problem]]
−
[[Mock AIME 1 2006-2007]]
+
 
 +
*[[Mock AIME 1 2006-2007/Problem 3 | Next Problem]]
 +
 
 +
*[[Mock AIME 1 2006-2007]]

Revision as of 17:26, 17 August 2006

Let $\star (x)$ be the sum of the digits of a positive integer $x$. $\mathcal{S}$ is the set of positive integers such that for all elements $n$ in $\mathcal{S}$, we have that $\star (n)=12$ and $0\le n< 10^{7}$. If $m$ is the number of elements in $\mathcal{S}$, compute $\star(m)$.

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=Mock_AIME_1_2006-2007_Problems/Problem_2&oldid=9641"