82.8k views
3 votes
What is the proof that any composite 3-digit number must have a prime factor ≤ 31?

A) 37
B) 47
C) 59
D) 67

1 Answer

6 votes

Final answer:

The proof lies in the fact that if a 3-digit composite number had no prime factors less than or equal to 31, it would be a prime number. However, since the square root of the largest 3-digit number (999) is less than 32, a composite must have a prime factor of 31 or less.

Step-by-step explanation:

The question asks for a proof that any composite 3-digit number must have a prime factor less than or equal to 31. To understand this, we can utilize the fact that if a composite number, which is greater than 1 and not a prime itself, does not have any prime factors less than or equal to its square root, then it must be a prime number.

Since the largest 3-digit number is 999, the square root of 999 is less than 32. Therefore, if a 3-digit number were to be composite, it must have a prime factor that is less than or equal to the square root of 999, which means it must have a prime factor less than or equal to 31.

User Ladislav Mrnka
by
7.8k points

No related questions found

Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.

9.4m questions

12.2m answers

Categories