If a prime divides a product \dots

DOI10.4169/COLLEGE.MATH.J.48.2.123MaRDI QIDQ4581657zbMATH OpenOpenAlexFDO

Authors Steven J. Miller, Cesar E. Silva

Publication date 20 August 2018

Published in The College Mathematics Journal (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1012.5866

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Number theory (educational aspects) (97F60)

Abstract: One of the greatest difficulties encountered by all in their first proof intensive class is subtly assuming an unproven fact in a proof. The purpose of this note is to describe a specific instance where this can occur, namely in results related to unique factorization and the concept of the greatest common divisor.

Recommendations

• Simple Proofs of the Fundamental Theorem of Arithmetic
• Did Euclid Need the Euclidean Algorithm to Prove Unique Factorization?
• scientific article; zbMATH DE number 1000239
• scientific article; zbMATH DE number 1534403
• The unique prime factorization

Cites work

• An invitation to modern number theory. With a foreword by Peter Sarnak.
• An Overlooked Example of Nonunique Factorization
• Invitation to real analysis

Cited in

(4)

• The product over all primes is \(4\pi^{2}\)
• On the success of mishandling Euclid's lemma
• Quick, does 23/67 equal 33/97? A mathematician's secret from Euclid to today
• Geometric Proofs of the Irrationality of Square-Roots for Select Integers

This page was built for publication: If a prime divides a product \dots

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4581657)