Oystein Ore mentions the following puzzle from Brahma-Sphuta-Siddhanta (Brahma’s Correct System) by Brahmagupta :
An old woman goes to market and a horse steps on her basket and crashes the eggs. The rider offers to pay for the damages and asks her how many eggs she had brought. She does not remember the exact number, but when she had taken them out two at a time, there was one egg left. The same happened when she picked them out three, four, five, and six at a time, but when she took them seven at a time they came out even. What is the smallest number of eggs she could have had?
Here’s a similar problem from “Advanced Number Theory” by Harvey Cohn (( always, i wonder how one might ‘discreetly request’ these remainders… )) :
Exercise 5 : In a game for guessing a person’s age x, one discreetly requests three remainders : r1 when x is divided by 3, r2 when x is divided by 4, and r3 when x is divided by 5. Then x=40 r1 + 45 r2 + 36 r3 modulo 60.
Clearly, these problems are all examples of the Chinese Remainder Theorem.
Chinese because one of the first such problems was posed by Sunzi [Sun Tsu] (4th century AD)
in the book Sunzi Suanjing. (( according to ChinaPage the answer is contained in the song on the left hand side. ))
There are certain things whose number is unknown.
Repeatedly divided by 3, the remainder is 2;
by 5 the remainder is 3;
and by 7 the remainder is 2.
What will be the number?
The Chinese Remainder Theorem asserts that when
and all integer solutions are congruent to each other modulo
We will need this classical result to prove that
where (as last time)
As we will have to do calculations with p-adic numbers, it is best to have them in a canonical form using digits. A system of digits
Recall that an adele is an element
Also
Note that
But then, for all
But for all other primes
Finally, observe that the diagonal embedding of
That is, any adele class
Btw. there were 301 eggs.
Comments