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 |
I didn't count the ducks that I saw in line, but I do remember that one duck was in front of two ducks, another duck behind two ducks. How many ducks did I see?
Why is void main used?
How do you convert strings to numbers in C?
Eight queens puzzle
EXPLAIN #INCLUDE<STDIO.H> EXPLAIN #INCLUDE<CONIO.H>
do you think its fraud or original company?
Differentiate between functions getch() and getche().
write a program to compare 2 numbers without using logical operators?
A collection of functions,calls,subroutines or other data a) library b) header files c) set of files d) textfiles
Describe wild pointers in c?
main use of recursive function a) processing speed high b) reduce program length/reduce repeated statements c) if you do not, use iterative methods like, for, while or do-while d) all the above
What is main void in c?