You cannot prove that because it's false
False
elementary proof
Theorem
A statement in maths is true only if it is proved by a series of mathematical manipulations and logic for any GENERAL number for which the statement should satisfy. Otherwise, it is only a conjecture. This is the beauty of mathematics and it is proof which differentiate mathematics from all other fields.
Give a counter-example.
Yes.
by bringing evidence to the table
A counter example
One is enough.
A conjecture should be testable. You test it and if it fails the test, it is a false conjecture.
well.......Its like testing a conjecture and finding a statement true or false because u have to test it!!! to see if its true or false and its different,true is like something u can prove and false is untrue and u cant prove it. :D i know i don't make sense but that's how i explained it on my homeworklol
The word "conjecture" can be taken a number of ways. If the "conjecture" involves an inference based on false or defective information, you need only show convincing or conclusive evidence that the information is false or faulty. If the "conjecture" is the result of surmise or guessing, then it is nothing more than a guess itself, and, therefore, has no basis in fact or logic. If the "conjecture" is an unproven mathematical hypothesis, you will need to disprove its validity from its basis. Start with the basic crux of the problem and work step by step until you disprove (or prove) the hypothesis to be untrue (or true). Make sure you have good arguments and sound mathematics.
A counter example is a statement that shows conjecture is false.
prove it
Because that is what a conjecture is! It is a proposition that has to be checked out to see f it isalways true, false or indeterminate,sometimes true, false or indeterminate,never true, false or indeterminate.Once its nature has been decided then it is no longer a conjecture.
There are only two possible outcomes in finding out whether a statement is true or false.In testing a conjecture, even one contradiction is sufficient to disprove it. However, it can never be proven. All you can do is add support to the likelihood that the conjecture is true. But there remains a possibility that some other test will prove it false.Furthermore, in view of Godel's incompleteness theorem, some conjectures cannot be proven to be true even if you can prove that their negation is false.