Question

prove NP = P

Answer 1

@DrTyrone can you please explain your question.

Answer 2

prove the set of problems in NP is in fact the set of problems in P

Answer 3

I have no idea what you are talking about sorry.

Answer 4

n00b

Answer 5

\(\large\color{ black}{\large {\bbox[5pt, white ,border:2px solid white ]{ \rm W}}}\)\(\large\color{ black}{\large {\bbox[5pt, white ,border:2px solid white ]{ \rm E}}}\)\(\large\color{ black}{\large {\bbox[5pt, white ,border:2px solid white ]{ \rm L}}}\)\(\large\color{ black}{\large {\bbox[5pt, white ,border:2px solid white ]{ \rm C}}}\)\(\large\color{ black}{\large {\bbox[5pt, white ,border:2px solid white ]{ \rm O}}}\)\(\large\color{ black}{\large {\bbox[5pt, white ,border:2px solid white ]{ \rm M}}}\)\(\large\color{ black}{\large {\bbox[5pt, white ,border:2px solid white ]{ \rm E}}}\)
\(\large\color{ black}{\large {\bbox[5pt, white ,border:2px solid white ]{ \rm T}}}\)\(\large\color{ black}{\large {\bbox[5pt, white ,border:2px solid white ]{ \rm O}}}\)
\(\large\color{ white}{\large {\bbox[5pt,#00c5ff ,border:2px solid white ]{ \rm O}}}\)\(\large\color{ white}{\large {\bbox[5pt,#00c5ff ,border:2px solid white ]{ \rm P}}}\)\(\large\color{ white}{\large {\bbox[5pt,#00c5ff ,border:2px solid white ]{ \rm E}}}\)\(\large\color{ white}{\large {\bbox[5pt,#00c5ff ,border:2px solid white ]{ \rm N}}}\)\(\large\color{ white}{\large {\bbox[5pt,#92dba2 ,border:2px solid white ]{ \rm S}}}\)\(\large\color{ white}{\large {\bbox[5pt,#92dba2 ,border:2px solid white ]{ \rm T}}}\)\(\large\color{ white}{\large {\bbox[5pt,#92dba2 ,border:2px solid white ]{ \rm U}}}\)\(\large\color{ white}{\large {\bbox[5pt,#92dba2 ,border:2px solid white ]{ \rm D}}}\)\(\large\color{ white}{\large {\bbox[5pt,#92dba2 ,border:2px solid white ]{ \rm Y}}}\)

Seems like there should be more information to your question
Can you please post all the information in your question so we can give you the best help we can!

Answer 6

Yes

Answer 7

P and NP are two groups of mathematical problems. P problems are considered "easy" for computers to solve. NP problems are easy for a computer to check, though not necessarily easy to solve. For example, if you have an NP problem, and someone says "The answer to your problem is 1 2 3 4 5," a computer can quickly figure out if the answer is right or wrong, but it may take a very long time for the computer to come up with "1 2 3 4 5" on its own. In a lot of ways, NP problems are kind of like riddles: it's hard to come up with the answer to a riddle, but once you hear the answer, it sounds obvious (i.e. it's easy to see that it's right and therefore it's also a P problem). The fundamental question is, are riddles really as hard as we think they are, or are we just missing something?

All P problems are NP problems, because it is easy to check that a solution is correct by solving the problem and comparing the two solutions. However, people want to know about the opposite: Are there any NP problems other than P problems, or are all NP problems just P problems? If the NP problems are really not the same as P problems (P ≠ NP), it would mean that no general, fast and easy ways to solve those NP problems can exist, no matter how hard we look. However if all NP problems are P problems (P = NP), it would mean that new, very fast problem solving methods do exist, but we haven't found them yet.

Prove the set of P is the set of NP.

Answer 8

@zzr0ck3r i think this is too hard for you, but thanks

Answer 9

grow up. behave like a human.

Answer 10

why didn't you

Answer 11

Well, pay us the $1,000,000 for answering this and we will think about it... or stop being a troll and stop asking classical problems that have a million dollar bounty on them.