@tourdivoire are you actually telling me that you teacher wants you to solve that? That is an old math problem known as the Collatz Conjecture, and has been unsolved, for years, even though the greatest mathematicians of the century have tried it.
@ChessMathNerd are you familiar with the concept of sarcasm?
Why did #12 get downvotes? Can someone prove that wrong?
wddd8if9t0y7gfdt5r4wet5ye6r78906
@CreativeThinking I downvoted because you seemed to say that 'the sum of two odd primes is even imples every even number is the sum of two odd primes'. Which is evidently erroneous.
No. More like: "Every even number greater than 2 can be expressed in the form of addition of two prime numbers (including the usage of 2 as a prime number)"
Which is true.
Which is true.
Yeah but why did you have to specify that odd+odd=even?
Plus, you don't need the prime 2.
Plus, currently, nobody knows whether it's true or not.
Plus, you don't need the prime 2.
Plus, currently, nobody knows whether it's true or not.
Which isn’t proven true, because while every even number 2n can be produced as the sum of 2 odd numbers in n-1 ways, you have not proved that for at least one of the n-1 ways, both odd numbers are prime
@CalbernandHowbe are you sure about n-1 ways?
@CreativeThinking @CalbernandHowbe is correct. the idea of every even number greater than two being the sum of two primes is called the Goldbach conjecture. It has never been proven. If you can prove it to be true, beyond the shadow of a doubt, then you will very soon find yourself a very famous person in the math world.
It may seem obvious, but when you start reaching huge numbers, like 12345678909874321234567890987654321234567892 for example, it starts becoming less clear, since there are fewer and fewer primes.
It may seem obvious, but when you start reaching huge numbers, like 12345678909874321234567890987654321234567892 for example, it starts becoming less clear, since there are fewer and fewer primes.
This topic has been archived and can no longer be replied to.