olymmath

KMO 2014

Korean Mathematical Olympiad 2014.

Other problems

Problem 5

Let p>5p>5 be a prime. Suppose that there exist integer kk such that k2+5k^2 + 5 is divisible by pp . Prove that there exist two positive integers m,nm,n satisfying p2=m2+5n2p^2 = m^2 + 5n^2 .

Problem 6

In an island there are nn castles, and each castle is in country AA or BB . There is one commander per castle, and each commander belongs to the same country as the castle he's initially in. There are some (two-way) roads between castles (there may be roads between castles of different countries), and call two castles adjacent if there is a road between them. Prove that the following two statements are equivalent: (1) If some commanders from country BB move to attack an adjacent castle in country AA , some commanders from country AA could appropriately move in defense to adjacent castles in country AA so that in every castle of country AA , the number of country AA 's commanders defending that castle is not less than the number of country BB 's commanders attacking that castle. (Each commander can defend or attack only one castle at a time.) (2) For any arbitrary set XX of castles in country AA , the number of country AA 's castles that are in XX or adjacent to at least one of the castle in XX is not less than the number of country BB 's castles that are adjacent to at least one of the castles in XX .