[
[ The Fundamental Theorem of Arithmetic. Prime Factorization]

In the country of Anchuria, where President Miraflores is in power, the time for new presidential elections is approaching. The country has exactly 20 million voters, of which only one percent support Miraflores (the regular army of Anchuria). Miraflores, of course, wants to be elected, but on the other hand, he wants the elections to be "democratic." Miraflores defines a "democratic vote" as follows: all voters are divided into equal groups; each of these groups is then divided into some number of equal groups, with larger groups possibly being divided into different numbers of smaller groups, and so on. In the smallest groups, a representative "elector" is chosen to vote in the larger group; the electors in this larger group choose an elector to vote in an even larger group, and so on. Finally, the representatives of the largest groups choose the president. Miraflores divides the voters into groups at his discretion and instructs his supporters on how to vote. Can he organize "democratic" elections in such a way that he will be elected? (In each group, electors choose their representative by a simple majority. In the event of a tie, the opposition wins.)

#
We will divide the voters into groups of 5 people. In 66666 such groups, we can place 3 military personnel. As a result, we get 66666 military electors out of 4 million.

We will divide these 4 million electors into groups of 4 people, placing 3 military personnel in 22222 of them. As a result, we get 22222 military electors out of a million.

By repeating these two operations, we see that reducing the number of electors by 20 times, we reduce the number of military electors by 9 times. Sequentially, we get 2469 military electors out of 50000, 274 - out of 2500, 30 - out of 125. Further, dividing twice into groups of 5, we get three military electors out of five, which will allow the president to win.

## Answer

He can.

Send a comment