answersLogoWhite

0


Best Answer

x = 2 : 2 and 3 are both primes.

User Avatar

Wiki User

7y ago
This answer is:
User Avatar
More answers
User Avatar

Wiki User

7y ago

2

This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: Student conjecture that if x is a prime number then x plus 1 is not prime. Which of the following answer is a counterexample?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

What number would be a counterexample to the following conjecture Prime numbers are odd?

2 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.


Which counterexample shows the conjecture is falseConjecture: The square of a rational number is greater than or equal to the number.?

A+


Any number that is divisible by 3 is also divisible by 9 .Find a counterexample to show that the conjecture is false?

You are an Idiot dude. there is no such value


Any number that is divisible by 2 is also divisible by 6 Find a counterexample to show that the conjecture is false?

4 is divisible by 2 but not by 6


Which number is a counterexample for the following conjectureConjecture: All integers are either positive or negative.?

A+ 0


Any number that is divisible by 4 is also divisible by 8 find a counterexample to show the conjecture is false?

4 divides 4 (once), but 4 is not divisible by 8. ■


What a counterexample?

a number wich disproves a proposition For example, theprime number 2 is a counterexample to the statement "All prime numbers are odd."


What is a counterexample?

a number wich disproves a proposition For example, theprime number 2 is a counterexample to the statement "All prime numbers are odd."


Is Goldbach's Conjecture true?

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)


What number would be a counter example to the following conjecture. Prime numbers are odd?

The number 2 is even as well as prime.


Is 72 a conjecture?

A conjecture is a proposition that is unproven but appears correct and has not been disproven.


What is a conjecture about the number of factors for square numbers up to 1000?

One possible conjecture is that each square number up to 1000 has 4 factors. The conjecture is manifestly false, but it is still a conjecture.