OU blog

Personal Blogs

Richard Walker

Can *You* Figure Out The Price of Grandad's Turkeys?

Visible to anyone in the world

Going through a desk that belonged to my Grandad, I found an old bill but unfortunately the first and last digits of the total had faded and were no longer legible. All that can still be read is

72 turkeys £_67.9_

where the underscores represent the unreadable digits.

What was the price of each turkey?

I found this nice puzzle on Cut-The-Knot, that treasure store of problems. It was original a question in a Stanford examination. You can find my solution further down the page.












Solution

We can ignore the decimal point for the moment and just try to deduce the missing digits, let's call them X and Y, from the fact that X679Y must be divisible by 72, the number of turkeys. 72 is even, so Y must be an even digit; 0, 2, 4, 6, or 8.

Moreover 72 is a multiple of 9, and a number is only divisible by 9 if the sum of its digits is divisible by 9. The digit sum of the known digits is 24 and for each possible value of Y we can then work out what the corresponding value of X must be for the digit sum to meet this condition.

The possible combinations are

Y X  Resulting number
0 5 56790
2 3 36792
4 1 16794
6 8 86796
8 6 66798

 

We also know that 72 is divisible by 8 and so the number we want must be divisible by 8 also. So now we test the candidate numbers in turn and only 36792 passes the test.

Finally 36792/72 = 511, so the price per turkey back then must have been £5.11

Permalink Add your comment
Share post
Richard Walker

Logic Is All It Takes to Crack This Math Olympiad Problem — Over to You, Can You Solve It?

Visible to anyone in the world

I found this problem on Cut The Knot, who got it from [1].

You are given seven distinct positive integers that sum to 100. Prove that some three of them must add up to at 50 or more.

I'll put my solution in the comments later this evening.

[1] Andreescu, T. and Răzvan, G. Mathematical Olympiad Challeges(Burkhäuser, 2004, p 60).

Permalink 1 comment (latest comment by Richard Walker, Sunday 20 September 2026 at 01:05)
Share post
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

This blog might contain posts that are only visible to logged-in users, or where only logged-in users can comment. If you have an account on the system, please log in for full access.

Total visits to this blog: 7048155