Draft:Factor-Digit Divisibility Criterion
Review waiting, please be patient.
This may take 8 weeks or more, since drafts are reviewed in no specific order. There are 1,820 pending submissions waiting for review.
Where to get help
How to improve a draft
You can also browse Wikipedia:Featured articles and Wikipedia:Good articles to find examples of Wikipedia's best writing on topics similar to your proposed article. Improving your odds of a speedy review To improve your odds of a faster review, tag your draft with relevant WikiProject tags using the button below. This will let reviewers know a new draft has been submitted in their area of interest. For instance, if you wrote about a female astronomer, you would want to add the Biography, Astronomy, and Women scientists tags. Editor resources
Reviewer tools
|
Factor-Digit Divisibility Criterion (FDDC), also referred to as the Raines Factor-Digit Divisibility Theorem, is a principle in number theory concerning the divisibility of numbers in positional numeral systems with composite bases. It states that for any composite base and any nontrivial factor of that base, the divisibility of a number by that factor depends solely on the number’s least significant digit in that base.
While the underlying idea is a direct consequence of standard modular arithmetic[1], it has not commonly been presented as a standalone concept. The criterion was articulated by Peter Raines, who observed that the familiar "last-digit" divisibility rules for 2 and 5 in base 10 are special cases of a more general pattern applicable to any composite base.[2]
Statement
[edit]Let be a composite integer (the base) and be a nontrivial factor of (that is, ). Consider a number expressed in base : , where is the least significant digit.
The Factor-Digit Divisibility Criterion states:
- is divisible by if and only if is divisible by .
Proof
[edit]Since , it follows that , and therefore for all . Substituting into the expansion of : .
This implies that is divisible by if and only if is divisible by .
Examples
[edit]- Base 10:
Factors: 2, 5 - Divisible by 2 if the last digit is 0, 2, 4, 6, or 8. - Divisible by 5 if the last digit is 0 or 5.
- Base 15 (15 = 3 × 5):
Label digits 0–9, A=10, B=11, C=12, D=13, E=14. - Divisible by 3 if last digit is 0, 3, 6, 9, or C (12). - Divisible by 5 if last digit is 0, 5, or A (10).
- Base 12 (12 = 2² × 3):
Digits 0–9, A=10, B=11. - Divisible by 2 if last digit is 0, 2, 4, 6, 8, or A. - Divisible by 3 if last digit is 0, 3, 6, or 9.
Significance
[edit]The Factor-Digit Divisibility Criterion reveals that well-known divisibility tests in base 10 are not unique to the decimal system. Instead, they reflect a general property of composite bases. While the principle is straightforward from a modular arithmetic standpoint, recognizing and naming it as a standalone concept may aid in teaching and understanding divisibility rules in a broader context.
See also
[edit]Further reading
[edit]- LeVeque, William J. (1996). Fundamentals of Number Theory. Dover. ISBN 978-0486689067.
- Hardy, G. H.; Wright, E. M. (2008). An Introduction to the Theory of Numbers (6th ed.). Oxford University Press. ISBN 978-0199219865.
- Apostol, Tom M. (1976). Introduction to Analytic Number Theory. Springer. ISBN 978-0387901633.
- Ireland, Kenneth; Rosen, Michael (1990). A Classical Introduction to Modern Number Theory. Springer. ISBN 978-0387973296.