Do you think the Collat's conjecture is true Veeky Forums?

Do you think the Collat's conjecture is true Veeky Forums?

Other urls found in this thread:

archive.4plebs.org/x/thread/17562328/#17562330
en.wikipedia.org/wiki/Almost_all
twitter.com/NSFWRedditImage

what do you mean by true? It works, but it hasn't been proven or solved yet

Do you believe it is true?

Its probably true

Does it has been shown to be related to more complex fields?

I believe it is true
Just as most people believe that N=NP problem has no solution but yet no proof.

>Collat's conjecture
What about 2n + n%3 (mod 3)? Will it always end up back in the {1,2} subgraph of N? 5 + 2n - n%5? 5 + 3n - n%5? Will they both always collapse to {{1,4},{2,3}}? How is this not trivial to prove with rings/modular arithmetic?

brb proving this shit
i could use 500 bucks

Yet another example of shit created to keep smart people from doing anything useful in life.

We have computers now, let them handle this time sink.

>N=NP
please stop this meam

Can a circle be divided by chords into equal area parts without any of those parts being congruent?

You can't just throw computational time at a problem and expect a proof to fall out. This isn't physics.

Yes. Three chords is enough.

Oh? I'd like to see you try to prove that.

Prove in what capacity? Formally or intuitively?

Either way. Draw an example if you want. But beware that if you think it can be done with 3 chords your intuition is misleading you.

>waaaaaaaah computer science isn't hard muh chemical engineering

more easy to explain meme problems like this?

>your intuition is
Alright so for background: The last time I saw this question posted on this board, it was posted by a fool who was either one of these: archive.4plebs.org/x/thread/17562328/#17562330 or else someone fool enough to fall for their stupidity. So I'd say there's about a 1e-20 chance you're not one of those fools. If you're not one of those fools, you can demonstrate that very quickly by showing me that you understand the question you've asked. Simply post the implicit equation for a circle and again for a line and I'll have reason to believe this isn't an elaborate 'troll'.

Until then, start by defining a zero length chord as a point on its circle.

Paul Erdős said about the Collatz conjecture: "Mathematics may not be ready for such problems."[9] He also offered $500 for its solution.[10]


500 dolla boyz, get to it

>a zero length chord
OK, so you can't do it. That's what I thought.

i'm finna hit a lick and get that

if you're trolling it isn't funny
I posted to stop saying
>N=NP
because N doesn't refer to any problem class in question
again, not sure if you're serious. just trying to explain

>Paul Erdős
>His parents were both Jewish mathematics teachers from a vibrant intellectual community.
>Erdős offered $500 for a solution.

That's a lot of money for mathematicians to be fair

There's actually a proof that the conjecture is true for *almost all integers. How they define almost all for integers, i don't know, but I'm sure it's analogous to the continuous "almost everywhere."

>almost all integers
en.wikipedia.org/wiki/Almost_all

>$500
well he WAS a jew

Density 1 probably.

How could discrete density be analogous to continuous density? Both are extremely different