math questions

Sort:
Avatar of RealTactics960
Have a question about math? Need help solving a problem? Post it here
Avatar of RealTactics960
Ok. Post it!
Avatar of RealTactics960
11111.11 repeating
Avatar of RealTactics960
There isnt enough data to know that.
Avatar of RealTactics960
#6 379203/82000000
Avatar of RealTactics960
It literally could be anything. There is not enough data
Avatar of RealTactics960
What makes you guys think 1?
Avatar of RealTactics960
It could be 4. 69. 72. Anything.
Avatar of RoadOcean
How much wood would a wood chuck chuck if wood chucks could chuck wood
Avatar of RealTactics960

Bump

Avatar of BasixWhiteBoy

I’ll ask you later when I have homework.

Avatar of c124875

Do you know how to solve the P vs NP problem

Avatar of RealTactics960
c124875 wrote:

Do you know how to solve the P vs NP problem

The what?

Avatar of DragonOfPoseidon
Want me to help too? I’m pretty advanced in math
Avatar of RealTactics960

What math do you do rn?

Avatar of c124875
RealTactics960 wrote:
c124875 wrote:

Do you know how to solve the P vs NP problem

The what?

The P vs NP problem is central to theoretical computer science. It explores whether every problem whose solution can be quickly verified (NP) can also be solved quickly (P). To put it simply, P represents a class of problems that can be solved easily by computers, while NP encompasses problems whose solutions, if given, can be quickly verified. The crux of the issue lies in determining if these two classes are the same. The difficulty of the P vs NP problem is exceptionally high due to its abstract nature and broad implications across computer science and requires a deep understanding of algorithmic efficiency and computational theory, as well as an innovative approach to bridge the gap between these problem classes.

Avatar of RealTactics960
c124875 wrote:
RealTactics960 wrote:
c124875 wrote:

Do you know how to solve the P vs NP problem

The what?

The P vs NP problem is central to theoretical computer science. It explores whether every problem whose solution can be quickly verified (NP) can also be solved quickly (P). To put it simply, P represents a class of problems that can be solved easily by computers, while NP encompasses problems whose solutions, if given, can be quickly verified. The crux of the issue lies in determining if these two classes are the same. The difficulty of the P vs NP problem is exceptionally high due to its abstract nature and broad implications across computer science and requires a deep understanding of algorithmic efficiency and computational theory, as well as an innovative approach to bridge the gap between these problem classes.

I feel dumb wtf does that meannn

Avatar of c124875

Avatar of c124875
c124875 wrote:

Do you know how to solve the P vs NP problem

I was just joking in this one

Avatar of c124875

It's an unsolved math problem