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)

Number-Theory · Gcd-And-Lcm

Gcd(12, 18)

12,\ 18

चरणानुक्रमे

  1. \gcd(12, 18)

    Use Euclid's algorithm: replace the larger number by its remainder on division by the smaller, until the remainder is 0.

  2. 18 = 1 \times 12 + 6

    Divide 18 by 12: quotient 1, remainder 6.

  3. 12 = 2 \times 6 + 0

    Divide 12 by 6: quotient 2, remainder 0.

  4. \gcd(12, 18) = 6

    The last non-zero remainder is 6.

उत्तर उघडा
\gcd(12, 18) = 6

आता तुम्ही प्रश्न निवडा, किंवा स्वतःचा प्रश्न टाइप करा किंवा रेखाटून दाखवा. प्रत्येक टप्प्यात, चित्रे आहेत, तुम्ही विचारण्याआधी उत्तर लपवलेले आहे.

स्वतःचे कार्य चालू ठेवा

मोफत खाते प्रत्येक शिकवणी वर टिपण्णी जोडते, तुम्ही पूर्ण केलेल्या गोष्टीचा नोंदवही, तुमच्या सोडविलेल्या समस्या एका ठिकाणी, आणि या पानाच्या विषयी तुम्ही विचारू शकता अशा शिक्षकाला. गणित स्वतःच सर्वांसाठी खुले आहे, दाखलन झालेले असो किंवा नसो.

नोंदणी करा दाखलन

येथे वापरलेले चिन्ह

Tap any symbol for the full definition, a picture, and what every letter in it means.

कसे कराल: Diophantine equations

  1. Use Euclid's algorithm: replace the larger number by its remainder on division by the smaller, until the remainder is 0.
  2. Divide 18 by 12: quotient 1, remainder 6.
  3. Divide 12 by 6: quotient 2, remainder 0.
  4. 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