Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Numerical results for Waring’s problem in $\textrm {GF}[q, x]$
HTML articles powered by AMS MathViewer

by William A. Webb PDF
Math. Comp. 27 (1973), 193-196 Request permission

Abstract:

Let p be a prime and let K and ${A_i}$ denote polynomials whose coefficients are elements of the finite field with p elements. Problems concerning the expression of an arbitrary polynomial K as sums of a small number of squares or cubes of polynomials ${A_i}$ are discussed. In the problems treated the degrees of the ${A_i}$ are restricted to be as small as possible. In particular, it is shown that at least five cubes are necessary and that three squares seem to suffice in all but one special case.
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 12C05
  • Retrieve articles in all journals with MSC: 12C05
Additional Information
  • © Copyright 1973 American Mathematical Society
  • Journal: Math. Comp. 27 (1973), 193-196
  • MSC: Primary 12C05
  • DOI: https://doi.org/10.1090/S0025-5718-1973-0325581-X
  • MathSciNet review: 0325581