| DivisibilityA yes-or-no statement, not a division that produces a number, as what divisibility is explains. | a∣b means b=a⋅k for some integer k | 3∣12, since 12=3⋅4 |
| Itself, one and zeroEvery nonzero integer divides itself and 0, and 1 divides everything; 0 divides only 0, as the basic properties note. | a∣a,1∣a,a∣0 | a=a⋅1,a=1⋅a,0=a⋅0 |
| TransitiveA divisor of a divisor divides the number too, one of the basic properties. | if a∣b and b∣c, then a∣c | 3∣12 and 12∣60, so 3∣60 |
| Sums and differencesA common divisor of two numbers also divides their sum and their difference, from the basic properties. | if a∣b and a∣c, then a∣(b+c) and a∣(b−c) | 4∣20 and 4∣12, so 4∣32 and 4∣8 |
| MultiplesA divisor of a number divides all of its multiples, the last of the basic properties. | if a∣b, then a∣(b⋅k) for any integer k | 3∣12, so 3∣36 and 3∣60 |
| Division with remainderThe quotient q and the remainder r for any integers a and n>0; divisibility and remainders reads n∣a as the case r=0. | a=n⋅q+r,0≤r<n | 30=7⋅4+2 |
| Remainder testThe computational form of the same statement: divisibility poses the question and modulo computes the answer, as divisibility and remainders puts it. | n∣a exactly when amodn=0 | 30mod7=2, so 7∤30 |
| Number of factorsRead straight from the exponents of the prime factorization, with 1 added to each exponent. | n=p1a1⋅p2a2⋯ has (a1+1)(a2+1)⋯ factors | 84=22⋅3⋅7: (2+1)(1+1)(1+1)=12 |
| GCD and LCMThe identity that links the two quantities in GCD and LCM. | a⋅b=gcd(a,b)⋅lcm(a,b) | 4⋅6=2⋅12=24 |
| LCM from the GCDThe same identity read the other way: the product is a common multiple, and dividing by the GCD brings it down to the least one (GCD and LCM). | lcm(a,b)=gcd(a,b)a⋅b | lcm(4,6)=224=12 |