Thread

∀n ∈ ℕ, prove (21n + 4) / (14n + 3) is irreducible. Proof: gcd(21n + 4, 14n + 3) = gcd(2(21n + 4), 3(14n + 3)) = gcd(42n + 8, 42n + 9) = gcd(42n + 8, 1) = 1 ∴ (21n + 4) / (14n + 3) is irreducible. QED
Fountain
Motivate the Math • MTM07: Proofs / How Do You Know You What You Think You Know? • Listen on Fountain
Proofshttps://www.youtube.com/watch?v=HIkIqt_ytdcFermat's Little Theorem https://mathworld.wolfram.com/FermatsLittleTheorem.html Euler's Function h...
 View quoted note →

Replies (1)

Nearly caught up. A pity I didn't see the Podcast sooner! Don't forget my latest boost I just did for ep7.
Ape Mithrandir's avatar Ape Mithrandir
∀n ∈ ℕ, prove (21n + 4) / (14n + 3) is irreducible. Proof: gcd(21n + 4, 14n + 3) = gcd(2(21n + 4), 3(14n + 3)) = gcd(42n + 8, 42n + 9) = gcd(42n + 8, 1) = 1 ∴ (21n + 4) / (14n + 3) is irreducible. QED
Fountain
Motivate the Math • MTM07: Proofs / How Do You Know You What You Think You Know? • Listen on Fountain
Proofshttps://www.youtube.com/watch?v=HIkIqt_ytdcFermat's Little Theorem https://mathworld.wolfram.com/FermatsLittleTheorem.html Euler's Function h...
 View quoted note →
View quoted note →