Difference between revisions of "2005 AIME I Problems/Problem 3"

(Typesetting : don't put math tags around dollar signs; dollar sign=math tag. Also, you have to do {n \choose k} on the wiki instead of \binom{n}{k})
Line 1: Line 1:
 
== Problem ==
 
== Problem ==
How many positive integers have exactly three proper divisors, each of which is less than 50?
+
How many [[positive integer]]s have exactly three [[proper divisor]]s, each of which is less than 50?
  
 
== Solution ==
 
== Solution ==
Having three proper divisors means that there are 4 regular divisors. So the number can be written as <math>\displaystyle p_{1}p_{2}</math> where <math>\displaystyle p_{1}</math> and <math>\displaystyle p_{2}</math> are primes. The primes under fifty are 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, and 47. There are 15 of them. So there are <math> {15 \choose 2} =105</math> such numbers.
+
{{solution}}
 
 
 
== See also ==
 
== See also ==
 +
* [[2005 AIME I Problems/Problem 2 | Previous problem]]
 +
* [[2005 AIME I Problems/Problem 4 | Next problem]]
 
* [[2005 AIME I Problems]]
 
* [[2005 AIME I Problems]]
 +
 +
[[Category:Introductory Number Theory Problems]]

Revision as of 16:05, 29 October 2006

Problem

How many positive integers have exactly three proper divisors, each of which is less than 50?

Solution

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

See also