Maths WorkshopMaths problems with full solutions

Divisibility and gcd

94 problems · Divisibility rules, greatest common divisor, Euclid's algorithm and Bezout's identity.

Ex.204Basic divisibility and linear combinations
#divisibility #linear combinations #divisors
Divisibility and gcd
High school
High school
Ex.205Consecutive integers are coprime
#coprime #consecutive integers #Euclidean algorithm
Divisibility and gcd
High school
High school
Ex.206Finding divisors systematically
#divisors #enumeration #bounds
Divisibility and gcd
High school
High school
Ex.232Divisibility rules
#divisibility rules #modular arithmetic #base 10
Divisibility and gcd
High school
High school
Ex.233GCD of a GCD
#gcd #associativity #three numbers
Divisibility and gcd
High school
High school
Ex.234The HCF of consecutive integers
#coprime #consecutive integers #gcd
Divisibility and gcd
High school
High school
Ex.325The Euclidean algorithm and Bézout
#gcd #bezout
Divisibility and gcd
L1
L1
Ex.3346 divides n³ − n
#divisibility #factorisation
Divisibility and gcd
High school
High school
Ex.366Common divisors and common multiples
#divisibility #lcm #structure
Divisibility and gcd
High school
High school
Ex.367Computing LCM from divisibility
#lcm #divisibility #product
Divisibility and gcd
High school
High school
Ex.368$n^2-1$ is divisible by 8 for odd $n$
#divisibility #parity #consecutive integers
Divisibility and gcd
High school
High school
Ex.369The relation between divisibility and lcm
#divisibility #lcm #product relation
Divisibility and gcd
High school
High school
Ex.370Simplifying a fraction with the divisibility
#divisibility #irreducible fraction #simplification
Divisibility and gcd
High school
High school
Ex.371divisibility of three numbers
#divisibility #three numbers #prime factorization
Divisibility and gcd
High school
High school
Ex.453Coprime integers
#coprime #gcd #Bézout
Divisibility and gcd
High school
High school
Ex.454GCD of three numbers
#gcd #three numbers #Euclidean
Divisibility and gcd
High school
High school
Ex.455Congruence classes modulo $n$
#congruences #residue classes #partition
Divisibility and gcd
L1
L1
Ex.456GCD and divisibility
#gcd #divisibility #equivalence
Divisibility and gcd
High school
High school
Ex.457LCM of three numbers
#lcm #three numbers #prime factorization
Divisibility and gcd
High school
High school
Ex.458The least common multiple
#lcm #gcd #product relation
Divisibility and gcd
High school
High school
Ex.459Every integer has a prime divisor
#primes #divisor #well-ordering
Divisibility and gcd
High school
High school
Ex.620Counting divisors and the hundred lockers
#divisor function #perfect squares #pairing
Divisibility and gcd
Olympiad
Olympiad
Ex.623gcd(n! + 1, (n + 1)! + 1) = 1
#gcd #divisibility #factorials
Divisibility and gcd
M1
M1
Ex.62413 divides 2⁷⁰ + 3⁷⁰
#Fermat's little theorem #modular exponentiation
Divisibility and gcd
M1
M1
Ex.645The sum of φ(d) over the divisors of n
#Euler totient #divisors #counting #fractions
Divisibility and gcd
M1
M1
Ex.70630 divides n⁵ − n
#divisibility #factorisation
Divisibility and gcd
Olympiad
Olympiad
Ex.740A divisibility identity for a sum
#divisibility #linearity #sum
Divisibility and gcd
L1
L1
Ex.741Bézout identity for 1001 and 315
#Euclidean algorithm #Bézout identity
Divisibility and gcd
High school
High school
Ex.742When are $2n$ and $3n+1$ coprime?
#divisibility #linear combination #coprimality
Divisibility and gcd
High school
High school
Ex.743Coprime powers remain coprime
#coprime #powers #Bézout
Divisibility and gcd
L1
L1
Ex.744If $a,b$ are coprime, so are $a+b$ and $ab$
#coprime #sum #product
Divisibility and gcd
L1
L1
Ex.745Divisibility of $a^n-b^n$
#divisibility #factorization #powers
Divisibility and gcd
L1
L1
Ex.746Divisors of a product
#divisibility #coprime #product divisibility
Divisibility and gcd
L1
L1
Ex.747Why the Euclidean algorithm works
#Euclidean algorithm #proof #division
Divisibility and gcd
L1
L1
Ex.748The Euclidean algorithm and Bézout identity
#Euclidean algorithm #Bézout identity #divisibility computation
Divisibility and gcd
High school
High school
Ex.749When is $(6n+12)/(2n+1)$ an integer?
#divisibility #fraction #case analysis
Divisibility and gcd
High school
High school
Ex.751When does $n-4$ divide $3n-17$?
#divisibility #linear combination #case analysis
Divisibility and gcd
High school
High school
Ex.752When is the number of divisors odd?
#divisors #perfect squares #counting
Divisibility and gcd
L1
L1
Ex.753A divisibility recurrence
#divisibility #recurrence #Euclidean algorithm
Divisibility and gcd
L1
L1
Ex.754The smallest prime divisor
#primes #smallest divisor #compositeness
Divisibility and gcd
L1
L1
Ex.908Bézout's identity
#Bézout #Euclidean algorithm #linear combination
Divisibility and gcd
High school
High school
Ex.909Coprime product
#coprime #product #divisibility
Divisibility and gcd
L1
L1
Ex.910Infinitely many primes
#Euclid #primes #proof by contradiction
Divisibility and gcd
High school
High school
Ex.911The fundamental theorem of arithmetic
#fundamental theorem #prime factorization #uniqueness
Divisibility and gcd
High school
High school
Ex.912Gauss's lemma
#Gauss lemma #divisibility #coprime
Divisibility and gcd
L1
L1
Ex.913GCD and product of coprime factors
#gcd #coprime #factorization
Divisibility and gcd
L1
L1
Ex.914Divisors of coprime numbers
#coprime #divisors #factorization
Divisibility and gcd
L1
L1
Ex.915Linear relations and coprimality
#coprime #linear relation #proof
Divisibility and gcd
L1
L1
Ex.916Proof of the Euclidean algorithm
#Euclidean algorithm #gcd invariance #proof
Divisibility and gcd
High school
High school
Ex.917GCD as a linear combination
#gcd #linear combination #Bézout
Divisibility and gcd
High school
High school
Ex.918GCD and linear combinations
#gcd #linear combination #divisors
Divisibility and gcd
L1
L1
Ex.919GCD of powers
#gcd #powers #prime factorization
Divisibility and gcd
L1
L1
Ex.920A coprimality proof
#coprime #proof #linear combination
Divisibility and gcd
L1
L1
Ex.921A recursive GCD
#gcd #Fibonacci #recursion
Divisibility and gcd
L1
L1
Ex.922Semiprimes and divisors
#semiprime #divisors #factorization
Divisibility and gcd
L1
L1
Ex.923Additive property of the p-adic valuation
#p-adic valuation #additivity #non-Archimedean
Divisibility and gcd
Olympiad
Olympiad
Ex.924Finding modular inverses
#modular inverse #Bézout #congruences
Divisibility and gcd
L1
L1
Ex.925Number of divisors
#divisors #prime factorization #counting
Divisibility and gcd
L1
L1
Ex.926Perfect numbers
#perfect numbers #sum of divisors #Euclid
Divisibility and gcd
Olympiad
Olympiad
Ex.927Perfect squares and divisors
#perfect squares #divisors #parity
Divisibility and gcd
L1
L1
Ex.928Prime power divisibility
#prime power #valuation #p-adic
Divisibility and gcd
L1
L1
Ex.929The radical of an integer
#radical #squarefree #prime factorization
Divisibility and gcd
Olympiad
Olympiad
Ex.930Sum of divisors
#sum of divisors #multiplicative #formula
Divisibility and gcd
L1
L1
Ex.931Units modulo $n$
#units #invertible #Euler totient
Divisibility and gcd
L1
L1
Ex.932p-adic valuation
#p-adic valuation #divisibility #properties
Divisibility and gcd
L1
L1
Ex.1277Long runs of non-squarefree numbers
#Chinese remainder theorem #squarefree numbers
Divisibility and gcd
Olympiad
Olympiad
Ex.1280The gcd of 2ᵃ − 1 and 2ᵇ − 1
#gcd #Euclidean algorithm #divisibility
Divisibility and gcd
Olympiad
Olympiad
Ex.128160 divides xyz for every Pythagorean triple
#Pythagorean triples #residues #squares modulo n
Divisibility and gcd
Olympiad
Olympiad
Ex.1329(n²)! is divisible by (n!)^(n+1)
#integrality #factorials #double counting #multinomial
Divisibility and gcd
Olympiad
Olympiad
Ex.1331Infinitely many n dividing 2ⁿ + 1
#induction #lifting the exponent #infinitely many #factorisation
Divisibility and gcd
Olympiad
Olympiad
Ex.1333v_p(n!) from the digits of n in base p
#Legendre's formula #digit sum #p-adic valuation #base p
Divisibility and gcd
Olympiad
Olympiad
Ex.1482Existence of a Bézout identity
#Bézout #existence #well-ordering
Divisibility and gcd
L1
L1
Ex.1484A common divisor divides 43
#divisibility #linear combination #prime number
Divisibility and gcd
High school
High school
Ex.1487Solving $\divisibility(a,b)+\operatorname{lcm}(a,b)=9+b$
#divisibility #lcm #Diophantine equation
Divisibility and gcd
High school
High school
Ex.1488A prime divisor property
#primes #divisibility #Euclid's lemma
Divisibility and gcd
L1
L1
Ex.1644Egyptian fractions
#Egyptian fractions #unit fractions #greedy algorithm
Divisibility and gcd
Olympiad
Olympiad
Ex.1645Chinese remainder theorem
#Chinese remainder #congruences #CRT
Divisibility and gcd
L1
L1
Ex.1646Coprime numbers and exponents
#coprime #exponents #gcd
Divisibility and gcd
Olympiad
Olympiad
Ex.1647Coprime sums and products
#coprime #sum #product
Divisibility and gcd
Olympiad
Olympiad
Ex.1648An application of the Euclidean algorithm
#Euclidean algorithm #expansion #continued fraction
Divisibility and gcd
Olympiad
Olympiad
Ex.1649A Diophantine equation with coefficients
#Diophantine #Bézout #general solution
Divisibility and gcd
L1
L1
Ex.1650Euler's totient function
#Euler totient #coprime #formula
Divisibility and gcd
L1
L1
Ex.1651GCD of sums
#gcd #sums #congruence
Divisibility and gcd
Olympiad
Olympiad
Ex.1652GCD via the Euclidean matrix
#gcd #Euclidean algorithm #matrix
Divisibility and gcd
L1
L1
Ex.1653Divisors of Mersenne numbers
#Mersenne #divisors #congruences
Divisibility and gcd
Olympiad
Olympiad
Ex.1654GCD in $\mathbb{Z}$ vs $\mathbb{R}[X]$
#analogy #gcd #polynomials #integers
Divisibility and gcd
Olympiad
Olympiad
Ex.1655GCD of polynomial coefficients
#gcd #coefficients #polynomials
Divisibility and gcd
Olympiad
Olympiad
Ex.1656Primitive Pythagorean triples
#Pythagorean triples #coprime #parity
Divisibility and gcd
Olympiad
Olympiad
Ex.1957⌊√n + √(n+1)⌋ = ⌊√(4n+2)⌋
#floor function #square roots #squares modulo 4
Divisibility and gcd
Olympiad
Olympiad
Ex.1961Prime factors of Fermat numbers
#order #Fermat numbers #Fermat's little theorem
Divisibility and gcd
Olympiad
Olympiad
Ex.1995Even perfect numbers (Euclid–Euler)
#perfect numbers #sigma function #multiplicativity #Mersenne primes
Divisibility and gcd
Olympiad
Olympiad
Ex.1999gcd(F_m, F_n) = F_gcd(m,n)
#Fibonacci numbers #gcd #Euclidean algorithm #divisibility sequences
Divisibility and gcd
Olympiad
Olympiad
Ex.2122Carmichael numbers (statement)
#Carmichael #primes #Fermat
Divisibility and gcd
M1
M1
Ex.2123The Miller–Rabin test
#primality testing #Miller-Rabin #modular arithmetic
Divisibility and gcd
M1
M1