What are Mathematical problems/conjectures that will never be proven/disproved?
The Cock Conjecture: OP is a faggot
Not even Jacob Barnett can figure out a proof to this one
>>7995382
no, you're wrong. face it.
infinitely many since john von neumann died before he could solve the equation to the universe and there will never be another person as smart as him
>>7995352
Riemann hypothesis
also whether there are any odd perfect numbers
>>7995406
I'm pretty sure the Riemann hypothesis can be solved, but i may need a breakthrough from another field to help solve it.
>>7995352
Eventually we will run out of prime numbers
>>7995413
>it*
>>7995406
I don't think either of those have been proven unsolvable.
>>7995352
Continuum Theory is the first one that comes to mind - Proving the cardinality of certain infinities. It's actually been proven by separate mathematicians that 1. It's impossible for the theory to be true and 2. It's impossible for it to be false.
Also, there are a lot of conjectures that will never be disproved since they've already been proved, but I don't think that's your question.
>>7995416
No, there's a pretty simple proof for this.
>>7995449
>I don't think either of those have been proven unsolvable.
Odd perfect numbers sure, but the Riemann hypothesis? Are you serious?
>>7995449
you got it backwards
it's possible for it to be true and it's possible for it to be false
it's independent of ZFC
>>7995352
An standard example:
There are infinitely many palindromic primes. A palindromic prime is one that reads the same forward and backwards in base 10. It won't be solved because it is somehow not interesting enough.
>>7995510
>somehow
grabbing a random problem and solving it just because is known as "bad mathematics". it's fucking useless.
>>7995517
Yes, the point I was trying to make is that we all know when a problem is uninteresting, but it is really hard to pinpoint exactly what makes it so.
>>7995523
i think it's just that a problem is uninteresting when there's nothing that makes it interesting
you need a compelling argument for a problem to be interesting, not the other way around
>>7995535
I'm not sure. I mean, Gauss thought that fermat's last theorem was uninteresting. I don't think it's clear cut at all.
P=NP with P not equal to 0 or N to 1.
>>7995453
Nah your a liar. There are no prime numbers bigger than the biggest one
I am pleased to read ITT the speculation: that RH is somehow undecidable. This had occured to me, too, especially since the proofs of Godel's incompleteness theorems are phrased in terms of natural numbers, and RH is this big important number theoretic-implying thing. But I must admit to not appreciating the details.
Still, wiki affords a helpful list on the matter, food for thought.
https://en.wikipedia.org/wiki/List_of_statements_undecidable_in_ZFC
So this implies that one /proves/ that such and such is undecidable with respect to so and so, and that these are established mathematical knowledge. Now, what if it happened that someone PROVED that RH was undecidable with respect to ZFC (or the appropriate analogue)? Would that not be a supreme and incredibly strange achievement, were it the case? And what would it mean? Would it lead to contradictions that I'm not aware of? It would certainly entail other statements (farey sequences version).
>>7995352
If we knew that we'd have solved P=NP by now.
>>7995352
>what are problems/conjectures that will never be proven/disproved
in mathematics we call them axioms
>>7995908
Axioms arent problems though, they are assumptions, you dont even try to prove them
>>7995910
where do you think baby axioms come from
>>7995967
Geniuses shit them out.
>>7995967
What? You just make them up, and other people use them if they look nice