Unravelling the Mystery of a Party Trick

  • Thread starter Thread starter Hyperreality
  • Start date Start date
  • Tags Tags
    Mystery
Hyperreality
Messages
201
Reaction score
0
I was reading In Code by Saray Flannery,one of the problem in the book bothered me, it is not the problem itself, it is the solution.

A Party Trick
If someone tells me 2, 2 and 3 are the remainders when she divides her age by 3, 5 and 7 respectively then I can work out her age.

Solution:
Let x = 2, y = 2, z = 3 and a = the age of the girl. Then she used this formula:

a = (70x + 21y + 15z)mod n
= (120 + 42 + 45)mod (3 x 5 x 7)
= 227mod105
= 17 years old

I have no idea of how this works. Where does this formula come from? There must be a logical way to explain this right? And are there any other ways of solving this kind of problem?
 
Mathematics news on Phys.org
This is an example of a famous result in elementary number theory called the Chinese Remainder Theorem. The site does a better job of explaining what's involved than I can.
 
I've been playing around with this theorem, but for the life of me i can't get it to work. I've been reading the wikipedia articles on chinese remainder theorem and euclidean algorthim
http://www.wikipedia.org/wiki/Chinese_remainder_theorem
http://www.wikipedia.org/wiki/Extended_Euclidean_algorithm
but it's not working. I was trying to solve the sample problem. Here it is:
Code:
x=2(mod 3)
x=3(mod 4)
x=2(mod 5)
"syntax": x=a[sub]i[/sub](mod n[sub]i[/sub])
First i have tried finding the values that satify
Code:
n = n[sub]1[/sub],...,n[sub]k[/sub]
r*n[sub]i[/sub] + s*n/n[sub]i[/sub]=1
I've been using the extended euclidean algorithm for that. Here (color coded for readability):
Code:
20/3 = 6 r 1 => 2 = 20 - 6(3)
3/2 = 1 r 1 => 1 = 3 - 1(2)  => 1= 3 -1 (20 - 6(3)) => 1 = -20 + 7(3)
That was just for n1 but the answer to the example says the equations should be
Code:
(-13)*3 + 2*20 =1
instead of
1 = -20 + 7(3)
The others (ni) also come out wrong. What did i do to upset the math Gods so (or to get it wrong)?

-HBar

#EDIT: Added the links
 
Last edited:
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top