Question

- so if i can proving that one mathematical statement not is false from this resulted that is true sure ???

Answer 1

What?

Answer 2

indifferent math statement

Answer 3

like a+b=x

Answer 4

for example

Answer 5

If we are talking about a reduction to the absurd proof, yes. Meaning: You negate the thesis and check what happens, if it results absurd, then the thesis was true.

Answer 6

right thank you so than i can prove the Goldbach's conjecture sure that is true

Answer 7

I was talking about this:

http://en.wikipedia.org/wiki/Proof_by_contradiction

Answer 8

i think this is fantastic

Answer 9

Note that in order to be true, you have to negate the thesis, and you have to arrive to an absurd, otherwise that's not enough to prove it.

Answer 10

ok thank you but till today have said me that not is sure this because this is in condition,substitution added

Answer 11

so hope that is understandably

Answer 12

sorry

Answer 13

proof by conttradiction is the same like reductio ad absurdum ?

Answer 14

right ???

Answer 15

I cannot really understand xD... but well, the Goldbach's conjecture isn't proved yet, you could begin by using a proof by contradiction but you'd have to find some absurd.

Uhm...
It says:
"Every even integer greater than 2 can be expressed as the sum of two primes."

Now you could suppose this thing is not true, but you have to arrive to an absurd, otherwise you didn't prove it.

note that the fact that 4: 2+2 is not an absurd (even though you supposed the thesis to be false)

Answer 16

alfie and from my question by Riemann hypothesis what is your opinion please ?

Answer 17

About that I need some more studying... :).

Answer 18

on wikipedia you will get more sure or if you check my questions there i think satelite73 have added me one website where can be reading more from this hypothesis

Answer 19

Anyway I was just checking this out, that's pretty interesting:

http://en.wikipedia.org/wiki/Hilbert%27s_problems

Talking about unresolved problems :)

Answer 20

yes the Goldbach's conjecture proof i begin with m=p+k when mis one number from the set of even numbers and p and k are numbers from the set of prime numbers

Answer 21

so wann

Answer 22

o be m is one number from