Prove or disprove P!=NP.
Answers were Sorted based on User's Feedback
Answer / star
This is one of unsolved problems in theory of computation!
Thus,we can't say (yet or at all...)is P!=NP.
Is This Answer Correct ? | 7 Yes | 1 No |
Answer / arpita
p=2, n=5
p!=np
2!=5*2
2!=2
hence prooved.
p=1,n=1
p!=np
1!=1*1
but 1=1
hence disprooved.
Is This Answer Correct ? | 5 Yes | 4 No |
Answer / arpita
p=2, n=5
p!=np
2!=5*2
2!=10
hence prooved.
p=1,n=1
p!=np
1!=1*1
but 1=1
hence disprooved.
Is This Answer Correct ? | 2 Yes | 3 No |
Answer / rohit
suppose
if
p=5,
np=5
or
np=6
!=(it is the sign of not equal to)
so
if np and p are same the answer is false
and when the np and p are different the the answer is true
Is This Answer Correct ? | 0 Yes | 2 No |
Answer / vadivelt
My Assumption would be.,
N = Some no
P = Some no
NP -> does not mean multiplication of N and P. Just it
means two different numbers.
So my answer is.,
4! = 4*3*2*1
ie.,
4! = 24 so,
P! = NP
Hence proved..
Here P = 4, N = 2.
Is This Answer Correct ? | 3 Yes | 17 No |
How do you define a string?
what is the difference between 123 and 0123 in c?
What is a program flowchart and how does it help in writing a program?
what is the self-referential structure?
Can a variable be both constant and volatile?
Can we add pointers together?
what is the difference between while and do while?
`write a program to display the recomended action depends on a color of trafic light using nested if statments
Why c is a procedural language?
write a c program that prints all multiples of 3between 1 and 50.
Taking an example,differentiate b/w loader and linker ?
Device an algorithm for weiler-atherton polygon clipping, where the clipping window can be any specified polygon