Art of Problem Solving

Mock AIME 1 2006-2007 Problems/Problem 12: Difference between revisions

Altheman (talk | contribs)
No edit summary
mNo edit summary
Line 1: Line 1:
12. Let <math>k</math> be a positive integer with a first digit four such that after removing the first digit, you get another positive integer, <math>m</math>, that satisfies <math>14m+1=k</math>. Find the number of possible values of <math>m</math> between <math>0</math> and <math>10^{2007}</math>.
==Problem==
Let <math>k</math> be a positive integer with a first digit four such that after removing the first digit, you get another positive integer, <math>m</math>, that satisfies <math>14m+1=k</math>. Find the number of possible values of <math>m</math> between <math>0</math> and <math>10^{2007}</math>.
==Solution==
{{solution}}


[[Mock AIME 1 2006-2007]]
----
 
*[[Mock AIME 1 2006-2007/Problem 11 | Previous Problem]]
 
*[[Mock AIME 1 2006-2007/Problem 13 | Next Problem]]
 
*[[Mock AIME 1 2006-2007]]

Revision as of 18:42, 22 August 2006

Problem

Let $k$ be a positive integer with a first digit four such that after removing the first digit, you get another positive integer, $m$, that satisfies $14m+1=k$. Find the number of possible values of $m$ between $0$ and $10^{2007}$.

Solution

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