MHB Applications Diophantine Equations

  • Thread starter Thread starter matqkks
  • Start date Start date
  • Tags Tags
    Applications
AI Thread Summary
Linear Diophantine equations have real-life applications, particularly in public key cryptography, exemplified by RSA encryption, which relies on number theory principles. The Chinese Remainder Theorem serves as a historical example, illustrating practical uses in ancient military contexts, such as determining troop numbers through modular arithmetic. While some argue that number theory has limited practical applications, others highlight its significance in fields like computer science and molecular physics. The discussion emphasizes the importance of these equations in paving the way for advanced mathematical studies. Overall, linear Diophantine equations are relevant in both theoretical and practical scenarios.
matqkks
Messages
280
Reaction score
5
Are there any real life applications of linear Diophantine equations? I am looking for examples which will motivate students.
 
Mathematics news on Phys.org
matqkks said:
Are there any real life applications of linear Diophantine equations? I am looking for examples which will motivate students.
I guess the main real life application is to public key cryptography. It might be hard to come up with realistic examples at a sufficiently elementary level, but perhaps it would be possible to go some way in that direction.
 
Other than that, I don't think number theory has any practical uses in real life. (Except maybe calculating restaurant bills, HST, etc.)(Bandit)
The main mathematical use of number theory is to "pave a road" into more advanced studies such as differential equations and abstract algebra, which themselves have countless applications in many scientific disciplines.
 
eddybob123 said:
Other than that, I don't think number theory has any practical uses in real life. (Except maybe calculating restaurant bills, HST, etc.)(Bandit)
The main mathematical use of number theory is to "pave a road" into more advanced studies such as differential equations and abstract algebra, which themselves have countless applications in many scientific disciplines.
Hey eddybob.

I'd disagree with you on this. I think Number Theory has a lot of applications. The RSA encryption, for example, is a product of number theory and to understand that one doesn't even need to read very advanced stuff. There are a lot of applications of number theory in Computer Science.

EDIT: I didn't see Opalg's post when I answered this so my response can be ignored. Oops!
 
matqkks said:
Are there any real life applications of linear Diophantine equations? I am looking for examples which will motivate students.

I do hope that Your students will be 'motivated' by the following 'brillant' application od diophantine equations that is datec from the Middle Ages. A well known fundamental theorem of the number theory is called 'Chinese Remainder Theorem' and it extablishes that if $n_{1}$ and $n_{2}$ are coprime, then the diophantine equation...

$\displaystyle x \equiv a_{1}\ \text{mod}\ n_{1}$ $\displaystyle x \equiv a_{2}\ \text{mod}\ n_{2}\ (1)$... has one and only one solution $\text{mod}\ n_{1}\ n_{2}$. It is easy to demonstrate in a more general case that if $n_{1},\ n_{2},\ ...\ n_{k}$ are coprime, then the diophantine equation... $\displaystyle x \equiv a_{1}\ \text{mod}\ n_{1}$

$\displaystyle x \equiv a_{2}\ \text{mod}\ n_{2}$

$\displaystyle ...$

$\displaystyle x \equiv a_{k}\ \text{mod}\ n_{k}\ (2)$

... has one and one solution $\text{mod}\ N= n_{1}\ n_{2}\ ...\ n_{k}$. All that is well known but may be it is not as well known why this theorem is called 'chinese'. The reason seems to be in the fact that in the old China the mathematical knowledge was 'patrimony' of the highest social classes and the rest of population was able to count till twenty and no more. Taking into account that, when a chinese general wanted to know the number of soldiers of one batalion he instructed the commander to marshal the soldiers first in rows of 7, then in rows of 11 and then in rows of 13 and any time to count the soldiers in the last row. The unknown number of soldiers can be ontained solving the diphantine equation (2) where $n_{1}=7,\ n_{2}= 11,\ n_{3}=13$ so that $N=n_{1}\ n_{2}\ n_{3}=1001$. The general procedure to solve (2) is the following... a) we define for i=1,2,...,k $\displaystyle N_{i}= \frac{N}{n_{i}}$ and $\displaystyle \lambda_{i} \equiv N_{i}^{-1}\ \text{mod}\ n_{i}$ b) we compute directly...

$\displaystyle x = a_{1}\ \lambda_{1}\ N_{1} + a_{2}\ \lambda_{2}\ N_{2} + ...+ a_{k}\ \lambda_{k}\ N_{k}\ \text{mod}\ N\ (3)$

In the case of chinese generals is $\displaystyle N_{1}= 143,\ \lambda_{1} \equiv 5\ \text{mod} 7,\ N_{2}= 91,\ \lambda_{2} \equiv 4\ \text{mod}\ 11,\ N_{3}= 77,\ \lambda_{3} \equiv 12\ \text{mod}\ 13$ so that is... $\displaystyle x \equiv 715\ a_{1} + 364\ a_{2} + 924\ a_{3}\ \text{mod}\ 1001\ (4)$

Kind regards

$\chi$ $\sigma$
 
eddybob123 said:
I don't think number theory has any practical uses in real life.

Of course there are. For example, in molecular physics and organic chemistry.
 
Seemingly by some mathematical coincidence, a hexagon of sides 2,2,7,7, 11, and 11 can be inscribed in a circle of radius 7. The other day I saw a math problem on line, which they said came from a Polish Olympiad, where you compute the length x of the 3rd side which is the same as the radius, so that the sides of length 2,x, and 11 are inscribed on the arc of a semi-circle. The law of cosines applied twice gives the answer for x of exactly 7, but the arithmetic is so complex that the...
Is it possible to arrange six pencils such that each one touches the other five? If so, how? This is an adaption of a Martin Gardner puzzle only I changed it from cigarettes to pencils and left out the clues because PF folks don’t need clues. From the book “My Best Mathematical and Logic Puzzles”. Dover, 1994.

Similar threads

Replies
2
Views
2K
Replies
3
Views
7K
Replies
3
Views
1K
Replies
2
Views
1K
Replies
6
Views
2K
Replies
1
Views
807
Back
Top