For each prime , there is a kingdom of -Landia consisting of islands numbered . Two distinct islands numbered and are connected by a bridge if and only if divides . Prove that for infinitely many there are two islands in -Landia not connected by a chain of bridges.
, 2021
Solution
View it as a directed graph with a directed edge iff in . Easy to see that out degree is at most one for every vertex. If are roots of , then we can check that are distinct if (otherwise and in ). So there less than edges, so -Landia is disconnected (as an undirected graph). It remains to show that there are infinitely many such that there are some such that . Towards contradiction, suppose are the only primes such that has solutions. Consider and let be a prime factor of , clearly and for , contradict to the assumption.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.