|
AUTHOR(S): Meti̇n Turan
|
TITLE Divisibility in Discrete Math and How to Use Binomial Expansion and Modulo |
 PDF |
ABSTRACT Proof is an important part of mathematics. It makes useful and applicable any new claimed theory. One of the subtitles of the proofs is divisibility proofing. It has important applications in computer engineering, such as prime numbers, integer factorization, congruence, and cryptography. This article contributes to the usage of different techniques for divisibility proof, consequently presenting an educational view to proof. Firstly, a description of divisibility is given with expressions. A general divisibility problem is considered, and different proofs are applied to that. Although the basic proof is induction, six different techniques were applied to the proof in order to show how to keep up well with the process. Modulo and binomial expansion were implemented to show that sometimes it would be a good choice to look for an alternative solution even if it does not seem as a part of or related to the proof. |
KEYWORDS Divisibility, Proof, Binomial Expansion, Number Theory, Basic Algebra, Discrete Math |
|
Cite this paper Meti̇n Turan. (2025) Divisibility in Discrete Math and How to Use Binomial Expansion and Modulo. International Journal of Mathematical and Computational Methods, 10, 65-70 |
|
