Skip to main content
OlympiadHQ

Browse · MathNet

Print

Saudi Arabia Mathematical Competitions

Saudi Arabia number theory

Problem

Consider the set . Find the greatest common divisor of all members in .
Solution
Let be the greatest common divisor of the numbers in . Since for , one gets that divides . Now, for and , one gets , therefore will divide the number . Since does not divide , it follows that divides .

Let us check that , i.e. the prime numbers , and divide , for all integers and . Notice it is enough to show that divides for all integers , since one can write But . Now, divides , divides , while divides , by Fermat's Little Theorem.
Final answer
42

Techniques

Greatest common divisors (gcd)Factorization techniquesFermat / Euler / Wilson theoremsPolynomial operations