Linked from

The 61 pages that link to Divisibility, each with the reason it gives.

• Prime numberNarrower topic: A prime is defined by exactly which positive integers divide it.

• Prime factorizationNarrower topic: A prime factorization makes an integer's divisors easy to characterize.

• Greatest common divisorNarrower topic: The greatest common divisor is defined by which integers divide every input.

• Integer factorizationNarrower topic: Factorization depends on identifying integers that divide the target exactly.

• Congruence (number theory)Narrower topic: Two integers are congruent exactly when their difference is divisible by the modulus.

• Coprime integersNarrower topic: Common divisors are the basis of the coprimality test.

• Euclid's lemmaNarrower topic: The lemma is a rule about how divisibility behaves across a product.

• Trial divisionNarrower topic: Each trial asks whether a candidate divides the target with no remainder.

• Divisor functionNarrower topic: Divisor functions are defined by collecting integers related to n through divisibility.

• Bézout's identityNarrower topic: The gcd is defined through common divisors, while the identity also yields divisibility tests.

• Rational root theoremNarrower topic: The theorem states that the root’s numerator and denominator divide specific coefficients.

• Least common multipleNarrower topic: The least common multiple is defined by shared divisibility and minimal positive size.

• Arithmetic functionNarrower topic: Many arithmetic functions depend on which integers divide their input.

• Twin primeNarrower topic: Testing divisibility by smaller primes establishes whether a candidate is prime.

• Legendre's formulaNarrower topic: The formula counts multiples of successive powers of p among factorial factors.

• Divisibility ruleNarrower topic: A rule is a shortcut for deciding this exact-multiple relation.

• Extended Euclidean algorithmNarrower topic: The algorithm's remainders preserve the common divisors of each successive pair.

• Zsigmondy's theoremNarrower topic: The theorem compares which primes divide the nth difference and its predecessors.

• Baranyai's theoremNarrower topic: The condition r divides n is necessary for each factor to cover all vertices.