Skip to main content
OlympiadHQ

Browse · MathNet

Print

Bulgarian Winter Tournament

Bulgaria number theory

Problem

We will call a natural number remarkable if there exist integers , , , for which . Prove that there exists a natural number such that for infinitely many prime numbers , the number is remarkable.
Solution
Lemma. Let be a prime number and , , . Then there exist , , such that , , , and .

Proof. Consider the set . We have that , i.e. in there are two distinct elements and , for which . Thus satisfies the conditions of the lemma.

Now let . Then the comparison has a solution , since the function is injective in , hence it is surjective. One way to verify this is to see that has only for a solution, since and hence the exponent of (mod ) is .

From the lemma, there exist , , with , , , for which . From here we get that . The latter is equivalent to .

On the other hand , , gives . Also notice that if , then the triple will give a natural number divisible by .

It remains to note that . Indeed, if , then we have , i.e. or , whose only integer solutions are (the first follows because is irrational, and the second follows from the fact that is the minimal polynomial of over the rational numbers).

Techniques

Fermat / Euler / Wilson theoremsPigeonhole principleIrreducibility: Rational Root Theorem, Gauss's Lemma, Eisenstein