OU blog

Personal Blogs

Richard Walker

From "Cut The Knot" — A Nice Use of the Pigeonhole Principle

Visible to anyone in the world
Edited by Richard Walker, Monday 14 September 2026 at 18:27

The Pigeonhole Principle says, of course, that if there are more pigeons than pigeonholes then we must be able to find a pigeonhole with more than one occupant.

The Cut The Problem ask for a proof (using the Pigeonhole Principle) that there is a power of three whose last three digits are 001 , which sounds quite surprising.

But let's imagine we have 999 pigeonholes numbered one comma two comma ellipsis . Calculate 1,000 distinct power of three , divide each by 1,000 and find the remainder, then put that power in the pigeonhole with the same number as the remainder.

There is one more 'pigeons' than pigeonholes, so there must be a pigeonhole with two occupants, that it, two powers that leave the same remainder on division by 1,000 .

Suppose these are three super p and three super q , p being the smaller. Because they leave the same remainder when divided by 1,000 , three super p minus three super q equals three super p times left parenthesis three super q minus p minus one right parenthesis must be a multiple of 1,000 .

1,000 can't divide a power of three , so it must divide three super q minus p minus one . This means when worked out three super q minus p minus one ends in three zeros ellipsis times 000 , which in turn means three super q minus p ends in ellipsis times 001 .

We can run a computer search quite easily and we find that in fact

three super 100 equals 515377520732011331036461129765621272702107522001

fits the bill.

This result can be generalised of course and we can prove that for example there must a power of 47 that ends in a trillion zeros followed by one , although given that even the zeros would take up nearly 1,000 GB the browser is too small to display it.

Permalink
Share post