AMOC SoE NT Prep

AMOC SoE NT Prep
William Liu
November 2023
1 N3
We show that n = 13 is the only such solution.

p p ki2
q is a square of a rational =⇒ q = kj 2 for some coprime integers i, j
∴ pq is a square =⇒ pq = k 2 i2 j 2 is also a square.
Thus, for 4n−2
n+5 to be a square, this expression:
(4n − 2)(n + 5) = (2n − 1)(2n + 10)
Must also be a square number.

Substitute 2n − 1 = k, 2n + 10 = k + 11.
With p a prime, for p | k, k + 11, p|11.
∴ gcd(k, k + 11) is either 1,11.
Case 1: gcd(k, k + 11) = 1:
As k, k + 11 share no factors, we must have both k, k + 11 be squares (as they
do not contribute to each others’ prime exponents).
By (x + 1)2 = x2 + 2x + 1, x > 5andx < −6has no solutions fork. By simple
casework, only k = 25, −36 satisfies this, and this corresponds to only n = 13
as a solution, as no n has 2n − 1 = −36.
Case 2: gcd(k, k + 11) = 11:
Let k = 11j, k + 11 = 11(j + 1). For 112 j(j + 1) to be a square, j(j + 1) must
be a square. Similarly, only j = −1, 0 are solutions to this, so k = −11, 0. Only
n = −5 works in this case, but this would make the denominator 0.
Therefore, n = 13 is the only integer n that works.
1
2 N4
We show only n = 8, 9, 12 are solutions.

k
Where n = pk11 pk22 ...pj j , d(n) = (k1 + 1)(k2 + 1)...(kn + 1).
And the second largest divisor of n = pn1 where p1 is the smallest prime divisor
of n.
One can construct any number by starting with its smallest prime factor, then
constructively multiplying by new prime factors that are greater or equal to the
smallest.
Lemma: when pn1 ≥ d(n), then for any prime pk greater or equal to the smallest
prime in n’s factorisation, n×p p1 > d(n × pk ).
k
It is important to note that multiplying by pk does not change p1 in calculating

the second largest divisor.
Proof: It is trivial to see that d(n ∗ pk ) is at most 2 × d(n). If pk ≥ 3, it is trivial
that n×pp1 > d(n × pk ). If pk = 2, then as by our assumption, n already has 2 as
k
its smallest prime factor, d(n × pk ) < 2 × d(n) as the exponent for 2 is already
1 or more.
We also cannot have any prime satisfy the condition, as d(p) = 2 > 1 = pp .
Thus, any n must automatically be the product of at least 2 primes.
Now we go by constructive cases by smallest prime to find all n that satisfy the
condition. This is based on the fact that, when the product is composed of 2
primes, d(n) ≤ 4.
Case 1: p1 ≥ 5:
Then pn1 ≥ 5 as the smallest 2nd prime is 5, and consequently by our lemma,
all possible n constructed from this cannot satisfy the condition.
Case 2: p1 = 3:
If the next prime is greater than or equal to 5, for the same reason as before,
this can never work. If the next prime is 3, then we have a solution, n = 9. No
other solutions constructed from either of these can work due to the lemma.
Case 3: p1 = 2:
The next prime, or any subsequent primes multiplied, cannot be greater than
or equal to 5, for the same reason as before.
If the next prime is 3, we have d(n) = 4 > pn1 = 3. From checking the next
prime being 2 or 3, we have only n = 12 is a solution.
If the next prime is 4, d(n) = 3 > pn1 = 2. As multiplying 3 again yields 12, we
instead try 2, yielding n = 8 is a solution. No subsequent solutions in any of
these cases can satisfy the condition due to our lemma.
Thus, we have n = 8, 9, 12 are our only solutions, which can all be trivially
verified.
2
3 N5
Answer: Yes. There is an infinity of pairs, where k ≥ 3 and k is odd, (k, k + 2),
which are relatively prime and satisfy k + (k + 2) | k k+2 + (k + 2)k .
RTP: 2(k + 1) | k k+2 + (k + 2)k for all odd k.
Proof - First we have that k + (k + 2) = 2k + 2 = 2(k + 1)
Our basis is:
2(k + 1) | (k + 1)(k − 1)
- as k − 1 is even, because k is odd.
From this we have:
2(k + 1) | k 2 − 1
=⇒ 2(k + 1) | k k × (k 2 − 1)
=⇒ 2(k + 1) | k k+2 − k k
By a | b =⇒ a | a + kb for integer k, and by the identity (x + y)n = (x + y)(...)
for odd n:
=⇒ k + (k + 2) | k k+2 − k k + (k k + (k + 2)k )
=⇒ k + (k + 2) | k k+2 + (k + 2)k
This concludes the proof.

AMOC SoE NT Prep

Uploaded by

Copyright:

Available Formats

AMOC SoE NT Prep

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

AMOC SoE NT Prep

Uploaded by

Copyright:

Available Formats

AMOC SoE NT Prep

We show that n = 13 is the only such solution.

(4n − 2)(n + 5) = (2n − 1)(2n + 10)

Must also be a square number.

We show only n = 8, 9, 12 are solutions.

It is important to note that multiplying by pk does not change p1 in calculating

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.