Wiki User
∙ 9y ago2
Wiki User
∙ 9y ago2 would be a counterexample to the conjecture that prime numbers are odd. 2 is a Prime number but it is the only even prime number.
x = 2 : 2 and 3 are both primes.
a number wich disproves a proposition For example, theprime number 2 is a counterexample to the statement "All prime numbers are odd."
a number wich disproves a proposition For example, theprime number 2 is a counterexample to the statement "All prime numbers are odd."
There is no counterexample because the set of whole numbers is closed under addition (and subtraction).
4 divides 4 (once), but 4 is not divisible by 8. ■
A+
x = 2 : 2 and 3 are both primes.
a number wich disproves a proposition For example, theprime number 2 is a counterexample to the statement "All prime numbers are odd."
a number wich disproves a proposition For example, theprime number 2 is a counterexample to the statement "All prime numbers are odd."
The number 2 is even as well as prime.
You are an Idiot dude. there is no such value
There is no counterexample because the set of whole numbers is closed under addition (and subtraction).
4 is divisible by 2 but not by 6
Perhaps. Computers have shown that it is true for some pretty large numbers, but you need to remember that there are an infinite number more out there. It hasn't been proved true yet, nor has there been a counterexample. Of course, theoretically the conjecture could be true, yet unprovable (see Godel's Incompleteness Theorem)
2 is a prime number.
A+ 0
4 divides 4 (once), but 4 is not divisible by 8. ■