[sage-devel] Re: [sage-devel][P=NP] On The Nature of Computational Complexity

2009-04-20 Thread mark mcclure
On Apr 20, 6:25 pm, Tom Boothby wrote: > I've never really understood why this is such an interesting problem > to people. It's quite easy to solve with Sage. > >     sage: implicit_multiplication(True) >     sage: N,P = var('N,P') >     sage: solve(P == N P) >     [N == 1] What about P==0? That

[sage-devel] Re: [sage-devel][P=NP] On The Nature of Computational Complexity

2009-04-20 Thread Tom Boothby
Martin, I've never really understood why this is such an interesting problem to people. It's quite easy to solve with Sage. sage: implicit_multiplication(True) sage: N,P = var('N,P') sage: solve(P == N P) [N == 1] On Sun, Apr 19, 2009 at 8:02 AM, Martin Michael Musatov wrote: