How are divisibility tests derived?

  • Context: Undergrad 
  • Thread starter Thread starter soandos
  • Start date Start date
  • Tags Tags
    Proof
Click For Summary
SUMMARY

Divisibility tests are derived from principles of modular arithmetic, specifically in relation to the base of the number system. For instance, in base 10, the sum of the digits is congruent to the number modulo 9, allowing for the conclusion that if the sum is a multiple of 9, the original number is divisible by 9. Similarly, for base 10, the alternating sum of digits provides a test for divisibility by 11, as demonstrated by the equation 100a + 10b + c = a - b + c (mod 11). These tests are systematic and can be generalized across various bases.

PREREQUISITES
  • Understanding of modular arithmetic
  • Familiarity with number bases (e.g., base 10, base m)
  • Knowledge of basic algebraic manipulation
  • Concept of congruences in mathematics
NEXT STEPS
  • Research modular arithmetic applications in number theory
  • Explore divisibility rules for other bases, such as base 2 and base 5
  • Learn about congruences and their proofs in mathematical contexts
  • Investigate the derivation of divisibility tests for composite numbers
USEFUL FOR

Mathematicians, educators, students studying number theory, and anyone interested in the foundations of divisibility tests and modular arithmetic.

soandos
Messages
166
Reaction score
0
what is the proof for divisibility tests in general, and in particular how are they derived.
for example, i know that in base m, if the sum of the digits are a multiple of m-1, then m-1 is a factor. how tests like alternating digits having equal sums found?
does a test exist for every number?
 
Physics news on Phys.org
soandos said:
what is the proof for divisibility tests in general, and in particular how are they derived.
for example, i know that in base m, if the sum of the digits are a multiple of m-1, then m-1 is a factor. how tests like alternating digits having equal sums found?
does a test exist for every number?

Divisibility tests in a given base are just special cases of modular arithmetic. Examples (base 10) for adding digits and alternating digits: 10a + b = a + b (mod 9), 100a + 10b + c = a - b + c (mod 11).
 

Similar threads

  • · Replies 12 ·
Replies
12
Views
1K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 40 ·
2
Replies
40
Views
5K
  • · Replies 2 ·
Replies
2
Views
3K