Consider the following conjecture: "Every integer greater than 1 is either a prime or can be expressed as a product of two or more primes (fundamental theorem of arithmetic)." What would a counterexample to this conjecture look like?
AA prime number that cannot be expressed as a product of primes.
B
C
D
An integer greater than 1 that cannot be expressed as a product of primes.
An integer that can be expressed as a product of non-prime numbers.
A prime number that can be expressed as a product of primes.
Sign in to check your answer and unlock the solution.