- Authors
-
João F. Ferreira
- Downloads
-
- Note: PDF
- Slides of my talk at FoP Away Day 2007, in Ruddington: PDF
- Abstract
-
This note presents a reasonable sufficient condition for a function to distribute over the greatest common divisor. The derived lemma is used to prove that the Mersenne function is such a function.
- Keywords
-
greatest common divisor, number theory, calculational method, distributivity properties
- Bibtex entry
-
@unpublished{JFF0, author = {Ferreira, Jo\~{a}o F. }, citeulike-article-id = {2448643}, keywords = {jff-bib, number-theory}, title = {Distributivity and the greatest common divisor}, year = {2006} }
- Related
-
- This note ended up as a section in the paper On Euclid's Algorithm and Elementary Number Theory
- Multiples in the Fibonacci series illustrates the use of the property that the Fibonacci function distributes over the greatest common divisor
- History
-
- May 2007 — changed the note's structure
- November 2006 — first version of the note is made public
JFF0: Distributivity and the greatest common divisor
[ CiteULike link ]