The Relatively Prime Nature of Consecutive Integers
Abstract views: 110 / PDF downloads: 95
Keywords:
Consecutive integers, Relatively Prime, Greatest Common DivisorAbstract
The purpose of this article is to demonstrate that consecutive integers are relatively prime and that the converse is true for a special case. This paper introduces two methods/proofs of showing this. Firstly, a proof that depends on the Division Algorithm, Euclidean Algorithm, and Bezout's Lemma has been discussed. The uniqueness of this proof is its dependence of on other theorems. It can be thought to be an application of the aforementioned algorithms and lemma. In this article, the postulate that consecutive integers are relatively prime has been referred to as The Relative Prime Nature of Consecutive Integers. Secondly, a proof by mathematical induction has been also used to show that two consecutive integers are relatively prime. Since mathematical induction is only applicable when working with positive integers, this proof applies only to positive integers.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.