Abstract
We examine Euclid's lemma that if is a prime number such that , then divides at least one of or . 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 is almost surely false in a probabilistic sense, and we quantify this with a corresponding asymptotic formula.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.