On the Success of Mishandling Euclid's Lemma
Abstract
We examine Euclid's lemma that if p is a prime number such that p | ab, then p divides at least one of a or b. Specifically, we consider the common misapplication of this lemma to numbers that are not prime, as is often made by undergraduate students. We show that a randomly chosen implication of the form r |ab ⇒ r|a or r|b is almost surely false in a probabilistic sense, and we quantify this with a corresponding asymptotic formula.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.