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.

Pracovný príklad · gcd(12, 18)

Number-Theory · Gcd-And-Lcm

Gcd(12, 18)

12,\ 18

Krok za krokom

  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.

Odhaliť odpoveď
\gcd(12, 18) = 6

Teraz ty Vyberte si problém, alebo napíšte alebo nakreslite vlastný.Každý krok, obrázok, odpoveď skrytá, kým sa neopýtate.

Udržujte svoje vlastné pracovné

Bezplatný účet pridáva poznámky ku každej lekcii, záznam o tom, čo ste dokončili, vaše vyriešené problémy na jednom mieste, a učiteľa, ktorého sa môžete opýtať na túto stránku.Math samotná je otvorená pre každého, prihlásený alebo nie.

Zaregistrovať sa Prihlásenie

Symboly použité tu

Ťuknutím na ľubovoľný symbol zobrazíte úplnú definíciu, obrázok a význam každého písmena.

Ako nakupovať: 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.

Otázky, ktoré ľudia kladú

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.

Viac v kategórii Number Theory

Prime factorisationPrime numbersGCD and LCMModular arithmeticDivisorsSequencesNumber basesFermat's little theorem and Euler's theoremRSA: cryptography from number theory