Difference between revisions of "1994 AIME Problems/Problem 5"

 
m
Line 1: Line 1:
 
== Problem ==
 
== Problem ==
 +
Given a positive integer <math>n\,</math>, let <math>p(n)\,</math> be the product of the non-zero digits of <math>n\,</math>.  (If <math>n\,</math> has only one digits, then <math>p(n)\,</math> is equal to that digit.)  Let
 +
<center><math>S=p(1)+p(2)+p(3)+\cdots+p(999)</math></center>.
 +
What is the largest prime factor of <math>S\,</math>?
  
 
== Solution ==
 
== Solution ==
 +
{{solution}}
  
 
== See also ==
 
== See also ==
* [[1994 AIME Problems]]
+
{{AIME box|year=1994|num-b=4|num-a=6}}

Revision as of 22:26, 28 March 2007

Problem

Given a positive integer $n\,$, let $p(n)\,$ be the product of the non-zero digits of $n\,$. (If $n\,$ has only one digits, then $p(n)\,$ is equal to that digit.) Let

$S=p(1)+p(2)+p(3)+\cdots+p(999)$

.

What is the largest prime factor of $S\,$?

Solution

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

See also

1994 AIME (ProblemsAnswer KeyResources)
Preceded by
Problem 4
Followed by
Problem 6
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
All AIME Problems and Solutions