Source: IMO ShortList 2003, number theory problem 5
An integer is said to be good if is not the square of an integer. Determine all integers with the following property: can be represented, in infinitely many ways, as a sum of three distinct good integers whose product is the square of an odd integer.
A group of friends sits in a ring. Each friend picks a different whole number and holds a stone marked with it. Then they pass their stone one seat to the right so everyone ends up with two stones: one they made and one they received. Now they notice something odd: if your original number is , your right-neighbor’s is , and the next person over is , then for every trio in the circle they see
They want as many friends as possible before this breaks (since all stones must stay distinct).
Let denote the left arrow key on a standard keyboard. If one opens a text editor and types the keys "ab cd e f", the result is "faecdb". We say that a string is reachable from a string if it is possible to insert some amount of 's in , such that typing the resulting characters produces . So, our example shows that "faecdb" is reachable from "abcdef".
Prove that for any two strings and , is reachable from if and only if is reachable from .
Source: Serbian selection contest for the IMO 2025
For an table filled with natural numbers, we say it is a divisor table if:
- the numbers in the -th row are exactly all the divisors of some natural number ,
- the numbers in the -th column are exactly all the divisors of some natural number ,
- for every .
A prime number is given. Determine the smallest natural number , divisible by , such that there exists an divisor table, or prove that such does not exist.
Due to the search handle issue in youtube. My channel is renamed to Olympiad Geometry Club. And the new link is as following:
https://www.youtube.com/@OlympiadGeometryClub
Recently I introduced the concept of harmonic bundle. I will move on to the conjugate median soon. In the future, I will discuss more than a thousand theorems on plane geometry and hopefully it can help to the students preparing for the Olympiad competition.
Proof: After inversion around , and is the intersection of line with line . Thus the map becomes projective after inversion. Since inversion preserves cross ratios, the map itself is projective, as desired.
Now we induct on , the number of points among that are equal to . The base case is true and this follows from the fact that the radical axes of concur.
Suppose the statement holds for and we prove it for . WLOG . The maps are both projective, hence it suffices to verify the statement for three positions of . We may take (and have the result from induction hypothesis), (in which case the lines concur at ) and the point on such that is cyclic.