It is not the case that Uniqueness of prime factorization (the Fundamental Theorem of Arithmetic) guarantees a single valid certificate exists, but does not guarantee that certificate is polynomially sized relative to the binary encoding of n.
?Set your confidence on the premises below to see your aggregate.
No one has weighed in yet. Be the first to share reasons for or against this statement.