Review the key concepts, formulae, and examples before starting your quiz.
🔑Concepts
Two numbers are said to be co-prime if they have only as their common factor. This means their Highest Common Factor (HCF) is .
Co-prime numbers do not need to be prime numbers themselves. For example, and are both composite numbers, but they are co-prime because their only common factor is .
Any two consecutive natural numbers are always co-prime. For example, , , and are all pairs of co-prime numbers.
Two different prime numbers are always co-prime to each other, such as and .
If a number is divisible by two co-prime numbers, then it is also divisible by their product. For example, if a treasure code is divisible by and (which are co-prime), it is also divisible by .
The Least Common Multiple (LCM) of two co-prime numbers is always equal to their product: .
📐Formulae
💡Examples
Problem 1:
Verify if the numbers and are co-prime so they can be used as unique identifiers for safekeeping treasures.
Solution:
Factors of : . Factors of : . The only common factor between and is .
Explanation:
Since the , the numbers and are co-prime.
Problem 2:
A security lock requires a code that is divisible by both and . Using the property of co-prime numbers, find the smallest such non-zero code.
Solution:
First, we check if and are co-prime. Factors of . Factors of . Their . The smallest number divisible by both is their . For co-prime numbers, .
Explanation:
Because and are co-prime, any number divisible by both must be a multiple of their product, .
Problem 3:
Is the pair co-prime?
Solution:
Factors of . Factors of . Common factors are and .
Explanation:
Since there is a common factor other than (which is ), the is . Therefore, and are NOT co-prime.