skip to main content
article
Free access

Problem #7

Published: 01 February 1974 Publication History

Abstract

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.

References

[1]
ALTRAN User's Manual (Vol. I), W. S. Brown, available from Bell Telephone Laboratories, Inc., Murray Hill, New Jersey 07974.
[2]
R. L. Graham, The Largest Small Hexagon (to appear).

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGSAM Bulletin
ACM SIGSAM Bulletin  Volume 8, Issue 1
February 1974
15 pages
ISSN:0163-5824
DOI:10.1145/1086823
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 February 1974
Published in SIGSAM Volume 8, Issue 1

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)31
  • Downloads (Last 6 weeks)7
Reflects downloads up to 01 Mar 2025

Other Metrics

Citations

Cited By

View all
  • (2021)Using symbolic calculations to determine largest small polygons Journal of Global Optimization10.1007/s10898-020-00908-w81:1(261-268)Online publication date: 1-Sep-2021
  • (2005)In-place arithmetic for polynomials over ZnDesign and Implementation of Symbolic Computation Systems10.1007/3-540-57272-4_21(22-34)Online publication date: 31-May-2005
  • (2005)Symbolic computation and parallel softwareParallel Computation10.1007/3-540-55437-8_89(316-337)Online publication date: 1-Jun-2005
  • (1998)Design and Implementation of MP, a Protocol for Efficient Exchange of Mathematical ExpressionsJournal of Symbolic Computation10.1006/jsco.1997.017325:2(213-237)Online publication date: 1-Feb-1998
  • (1992)Parallel univariate p-adic lifting on shared-memory multiprocessorsPapers from the international symposium on Symbolic and algebraic computation10.1145/143242.143304(168-176)Online publication date: 1-Aug-1992
  • (1991)Practical factorization of univariate polynomials over finite fieldsProceedings of the 1991 international symposium on Symbolic and algebraic computation10.1145/120694.120698(22-31)Online publication date: 1-Jun-1991
  • (1990)Parallel univariate polynomial factorization on shared-memory multiprocessorsProceedings of the international symposium on Symbolic and algebraic computation10.1145/96877.96915(145-151)Online publication date: 1-Jul-1990
  • (1980)Problem 7 and systems of algebraic equationsACM SIGSAM Bulletin10.1145/1089220.108922414:2(26-29)Online publication date: 1-May-1980
  • (1978)Towards a REDUCE solution to SIGSAM problem 7ACM SIGSAM Bulletin10.1145/1088276.108827812:4(14-18)Online publication date: 1-Nov-1978
  • (1977)On the efficiency of algorithms for polynomial factoringMathematics of Computation10.1090/S0025-5718-1977-0422193-831:137(235-250)Online publication date: 1977
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media