Parallel univariate polynomial factorization on shared-memory multiprocessors
ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
Practical factorization of univariate polynomials over finite fields
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Parallel univariate p-adic lifting on shared-memory multiprocessors
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
ACM SIGSAM Bulletin
Towards a REDUCE solution to SIGSAM problem 7
ACM SIGSAM Bulletin
A SCRATCHPAD solution to problem #7
ACM SIGSAM Bulletin
ACM SIGSAM Bulletin
Problem 7 and systems of algebraic equations
ACM SIGSAM Bulletin
| Hi-index | 0.00 |
The function F(x) = (1/2-x) (1-x2)1/2+x(1+(1-(1/2+x)2)1/2) has a maximum at about x = .343771, where it attains the value of approximately .674981. This value is the root of an irreducible polynomial of tenth degree over the integers; the problem is to find this polynomial. The obvious way of proceeding is as follows:(1) Differentiate F(x), set it equal to zero, and clear radicals. The result is a tenth degree polynomial P(x) over the integers which has a root at about x = .343771.