maths.free › Number Theory › Diophantine equations
Diophantine equations
Integer solutions: linear equations via Bézout, Pythagorean triples, Fermat.
ax + by = c has integer solutions exactly when gcd(a, b) divides c, and the extended Euclidean algorithm finds them. Pythagorean triples are (m² − n², 2mn, m² + n²). Fermat's last theorem says xⁿ + yⁿ = zⁿ has none for n ≥ 3, proved in 1995. Picture it: lattice points on a line; the solutions are evenly spaced. Think it: Hilbert's tenth problem showed no algorithm can decide all Diophantine equations.
דוגמה עובדת · gcd(12, 18)
צעד אחר צעד
- \gcd(12, 18)
Use Euclid's algorithm: replace the larger number by its remainder on division by the smaller, until the remainder is 0.
- 18 = 1 \times 12 + 6
Divide 18 by 12: quotient 1, remainder 6.
- 12 = 2 \times 6 + 0
Divide 12 by 6: quotient 2, remainder 0.
- \gcd(12, 18) = 6
The last non-zero remainder is 6.
גלה את התשובה
עכשיו אתה בחר בעיה, או הקלד או צייר בעצמך. כל צעד, תמונה, התשובה חבויה עד שתשאל.
סמלים המשמשים כאן
הקש כל סמל להגדרה המלאה, תמונה, ומה כל אות בזה אומר.
איך: Diophantine equations
- Use Euclid's algorithm: replace the larger number by its remainder on division by the smaller, until the remainder is 0.
- Divide 18 by 12: quotient 1, remainder 6.
- Divide 12 by 6: quotient 2, remainder 0.
- The last non-zero remainder is 6.
שאלות שאנשים שואלים
Why are primes so important?
Every integer factors into primes in exactly one way, so primes are the atoms of multiplication. Cryptography relies on that factoring being easy to state and hard to do.
How do I tell whether a big number is prime?
Trial division up to the square root works for small numbers. For large ones, probabilistic tests (Miller-Rabin) give an answer that is wrong with negligible probability, and deterministic tests (AKS) exist but are slower.
יותר בפנים. Number Theory
Prime factorisationPrime numbersGCD and LCMModular arithmeticDivisorsSequencesNumber basesFermat's little theorem and Euler's theoremRSA: cryptography from number theory