pith. sign in

arxiv: 1602.03555 · v1 · pith:B4THYDVOnew · submitted 2016-01-21 · 🧮 math.HO · math.NT

On the Success of Mishandling Euclid's Lemma

classification 🧮 math.HO math.NT
keywords lemmaeuclidprimealmostasymptoticchosencommonconsider
0
0 comments X
read the original 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 \Rightarrow r|a \text{ or } r|b$ is almost surely false in a probabilistic sense, and we quantify this with a corresponding asymptotic formula.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.