Difference between revisions of "1995 AIME Problems/Problem 6"
m |
m |
||
Line 1: | Line 1: | ||
− | |||
== Problem == | == Problem == | ||
+ | Let <math>\displaystyle n=2^{31}3^{19}.</math> How many positive integer divisors of <math>\displaystyle n^2</math> are less than <math>\displaystyle n_{}</math> but do not divide <math>\displaystyle n_{}</math>? | ||
− | == Solution == | + | == Solution ==== See also == |
− | |||
− | == See also == | ||
* [[1995 AIME Problems/Problem 5 | Previous problem]] | * [[1995 AIME Problems/Problem 5 | Previous problem]] | ||
* [[1995 AIME Problems/Problem 7 | Next problem]] | * [[1995 AIME Problems/Problem 7 | Next problem]] | ||
* [[1995 AIME Problems]] | * [[1995 AIME Problems]] |
Revision as of 00:11, 22 January 2007
Problem
Let How many positive integer divisors of are less than but do not divide ?