Maths Olympiad Prep

Track / Stage 3 / 27 of 260 #507 of 2444

Problem 507

AMC 10/12, early questions
Number theory Difficulty 3.1 Prove it CEMC Fryer · Canada · 2022

If an integer nn is written
as a product of prime numbers, this product (known as its prime
factorization) can be used to determine the number of positive
factors of nn. For example, the
prime factorization of $28=2 ×2×\times 2 \times
7 = 2^2 ×\times 7^1.Thepositivefactorsof28are:. The positive factors of 28 are: $28=22×7114=21×717=20×714=22×702=21×701=20×70\begin{align*} 28 & = 2^2 \times 7^1\\ 14 &= 2^1 \times 7^1 \\ 7 & = 2^0 \times 7^1\\ 4 & = 2^2 \times 7^0 \\ 2 & = 2^1 \times 7^0 \\ 1 &= 2^0 \times 7^0 \end{align*} Each positive factor includes 22, 11
or 00 twos, 11 or 00 sevens, and no other prime numbers.
Since there are 3 choices for the number of twos, and 2 choices for the
number of sevens, there are $3 ×\times 2 =
6positivefactorsof positive factors of 28$.

How many positive factors does 675675 have?
A positive integer nn has the positive factors 99, 1111, 1515, and 2525 and exactly fourteen other positive
factors. Determine the value of nn.
Determine the number of positive integers
less than 500500 that have the
positive factors 22 and 99 and exactly ten other positive
factors.

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Next problem →

Official solution

The prime factorization of 675=33×52675=3^3\times5^2, and so 675 has 4×3=124\times3=12 positive factors.
The positive integer nn has a
total of 4+14=184+14=18 positive
factors.

Since nn has the positive factors
9=329=3^2, 11, 15=3×515=3\times5, and 25=5225=5^2, then the prime factorization of
nn must include at least 2 factors
of 3, at least 2 factors of 5, and at least 1 factor of 11.

In other words, nn must be divisible
by 32×52×113^2\times5^2\times11.

Suppose n=32×52×11n=3^2\times5^2\times11.
Then nn has 3×3×2=183\times3\times2=18 positive factors, as
required.

If nn contained additional factors,
then it would have more than 18 positive factors.

Thus, n=32×52×11=2475n=3^2\times5^2\times11=2475.
Suppose that mm is a positive
integer less than 500 that has exactly 2+10=122+10=12 positive factors.

Since mm has the positive factors 2
and 9=329=3^2, then the prime
factorization of mm must include at
least 1 factor of 2, and at least 2 factors of 3.

In other words, mm must be divisible
by 2×322\times3^2.

To begin, suppose that mm has
exactly 2 distinct prime factors.

That is, suppose that m=2a×3bm=2^a\times3^b where aa and bb are integers with a1a\geq1 and b2b\geq2.

In this case, mm has (a+1)(b+1)=12(a+1)(b+1)=12 positive factors.

Since a1a\geq1 and b2b\geq2, then a+12a+1\geq2 and b+13b+1\geq3.

Using these restrictions, there are exactly three possibilities for
which (a+1)(b+1)=12(a+1)(b+1)=12. These are
a+1=2 and b+1=6, which gives a=1 and b=5a+1=2 \text{ and } b+1=6, \text { which gives } a=1 \text{ and } b=5 a+1=3 and b+1=4, which gives a=2 and b=3a+1=3 \text{ and } b+1=4, \text { which gives } a=2 \text{ and } b=3
a+1=4 and b+1=3, which gives a=3 and b=2a+1=4 \text{ and } b+1=3, \text { which gives } a=3 \text{ and } b=2 If a=1a=1 and b=5b=5, then m=2×35=486m=2\times3^5=486.

If a=2a=2 and b=3b=3, then m=22×33=108m=2^2\times3^3=108.

If a=3a=3 and b=2b=2, then m=23×32=72m=2^3\times3^2=72.

Since each of these values is less than 500, then there are 3 positive
integers that satisfy the given conditions, in this case.

Next, suppose that mm has exactly
3 distinct prime factors.

That is, suppose that $m=2a×3b×\$m=2^a\times3^b\times
p^cwhere where p$ is a prime
number not equal to 2 or 3, and aa,
bb and cc are integers with a1a\geq1, b2b\geq2 and c1c\geq1.

If a=1a=1, b=2b=2 and c=1c=1 (the minimum values possible for
a,b,ca,b,c), then m=2×32×pm=2\times3^2\times p.

In this case, mm has 2×3×2=122\times3\times2=12 positive factors, as
required.

Increasing aa, bb or cc increases the number of positive
factors, and thus a=1a=1, b=2b=2 and c=1c=1 is the only possibility for which
mm has 12 positive factors and 3
distinct prime factors.

If a=1a=1, b=2b=2 and c=1c=1, then m=2×32×p=18pm=2\times3^2\times p=18p.

For which prime numbers p>3p>3 is
18p18p less than 500?

Since 18p<50018p<500, then p<50018p<\frac{500}{18} and so p27p\leq27.

The prime numbers in this range are 5,7,11,13,17,19, and 23, which give
7 positive integers that satisfy the given conditions, in this case.

Finally, suppose that mm has
exactly 4 distinct prime factors.

That is, suppose that $m=2a×3b×pc×\$m=2^a\times3^b\times p^c\times q^dwhere where p$ and
qq are different prime numbers not
equal to 2 or 3, and aa, bb, cc, dd
are integers with a1a\geq1, b2b\geq2, c1c\geq1, and d1d\geq1.

If a=1a=1, b=2b=2, c=1c=1, and d=1d=1 (the minimum values possible for
a,b,c,da,b,c,d), then mm has 2×3×2×2=242\times3\times2\times2=24 positive
factors, which is a contradiction.

Increasing aa, bb, cc, or dd or increasing the number of distinct
prime factors, increases the number of positive factors, and thus there
are no possibilities for which mm
has 12 positive factors and 4 or more distinct prime factors.

Thus, the number of positive integers less than 500 that have the
factors 2 and 9 and exactly ten other positive factors is 3+7=103+7=10.

Source: CEMC, University of Waterloo, licensed CC-BY-NC-4.0. Statement reproduced verbatim; metadata (topic, difficulty, ordering) added by this project.