PUBLICATIONS DE L'INSTITUT MATHÉMATIQUE (BEOGRAD) (N.S.)Vol. 50(64) Preimenovati datoteke, proveriti paginaciju!!!, pp. 159--162 (1991)
|
|
PUBLICATIONS DE L'INSTITUT MATHÉMATIQUE (BEOGRAD) (N.S.) Vol. 50(64) Preimenovati datoteke, proveriti paginaciju!!!, pp. 159--162 (1991) |
|
|
A way of reducing the factorization problem in $\ZC[x]$ to the factorization problem in $\ZC$S. Pre{\sh}i{\cj}Matematicki fakultet, Beograd, YugoslaviaAbstract: Let $p(x)\in \ZC[x]$ be a given polynomial. Then there exists and can be effectively determined a natural number $M$ such that the factorization problem of $p(x)$ in $\ZC[x]$ is logically equivalent to the problem of finding some particular factorization of the number $p(M)$. Classification (MSC2000): 60F05 Full text of the article:
Electronic fulltext finalized on: 2 Nov 2001. This page was last modified: 16 Nov 2001.
© 2001 Mathematical Institute of the Serbian Academy of Science and Arts
|