If P = NP, can a proof be generated / verified efficiently for a proposition?

[pbuk]

Let n be an integer. Can we compute n^2 in polynomial time for any n?

If you do not know the answer to this question then, with respect, I suggest that you do not yet have sufficient understanding of the subject to consider P vs NP. You can find a free course on the subject here: https://ocw.mit.edu/courses/mathematics/18-404j-theory-of-computation-fall-2020/index.htm

 

[fresh_42]

Let n be an integer. Can we compute n^2 in polynomial time for any n?

Yes.

https://en.wikipedia.org/wiki/Multi...g a natural,additions, which can be expensive.

 

[Mark44]

Let n be an integer. Can we compute n^2 in polynomial time for any n?

This says everything that needs to be said; IMHO there is no point in continuing.

If you do not know the answer to this question then, with respect, I suggest that you do not yet have sufficient understanding of the subject to consider P vs NP.

I agree. Thread closed.