# Extending Waring's conjecture to 471,600,000

```@article{Kubina1990ExtendingWC,
title={Extending Waring's conjecture to 471,600,000},
author={J. Kubina and M. Wunderlich},
journal={Mathematics of Computation},
year={1990},
volume={55},
pages={815-820}
}```
• Published 1990
• Mathematics
• Mathematics of Computation
Two computer techniques are described that the authors used to confirm Waring's Conjecture to 471,600,000, thus extending R. M. Stemmler's result of 200,000 computed in 1964. M. C. Wunderlich increased the result to 175,600,000 in August 1988, and in the following October, J. M. Kubina, using a method suggested by Jean-Marc Deshouillers, raised it to 471,600,000. In 1770 Edward Waring asserted in his Meditationes Algebraicae that every positive integer can be written as the sum of four squares… Expand
WARING ' S PROBLEM : A
• 2007
1. The classical Waring problem. \Every integer is a cube or the sum of two, three, ... nine cubes; every integer is also the square of a square, or the sum of up to nineteen such; and so forth."Expand
Waring's problem: A survey
• Mathematics
• 2002
It is presumed that by this, in modern notation, Waring meant that for every k ≥ 3 there are numbers s such that every natural number is the sum of at most s k-th powers of natural numbers and thatExpand
On the computation of \$g(k)\$ in Waring’s problem
• Mathematics
• 1990
Over two hundred years ago, Waring raised the question of representing natural integers as sums of integral kth powers. At the beginning of this century, Hilbert proved that, for any fixed k , theExpand
On a generalization of Waring's conjecture
Pupyrev’s paper “Effectivization of a Lower Bound for ∥∥(4/3)k∥∥” provides partial results to the assertion that ∥∥(4/3)k∥∥ > (4/9)k for k ≥ 6, which is equivalent to a generalization of Waring’sExpand
A new lower bound for ||(3/2) k ||
We prove that, for all integers k exceeding some effectively computable number K, the distance from (3/2) to the nearest integer is greater than 0.5803. 1. Historical overview of the problem Let b ·Expand
Large Integer Multiplication on Hypercubes
• B. Fagin
• Computer Science
• J. Parallel Distributed Comput.
• 1992
A convolution algorithm on a massively parallel processor, based on the Fermat Number Transform, is presented and some examples of the trade-offs between modulus, interprocessor communication steps, and input size are presented. Expand
On the Uniformity of \$(3/2)^n\$ Modulo 1
• Mathematics
• 2017
It has been conjectured that the sequence \$(3/2)^n\$ modulo \$1\$ is uniformly distributed. The distribution of this sequence is signifcant in relation to unsolved problems in number theory includingExpand
A (probably) exact solution to the Birthday Problem
Given a year with n≥1 days, the Birthday Problem asks for the minimal number such that in a class of students, the probability of finding two students with the same birthday is at least 50 percent.Expand
Fractional parts of powers of rational numbers
The author uses Pade approximation techniques and an elementary lemma on primes dividing binomial coefficients to sharpen a theorem of F. Beukers on fractional parts of powers of rationals. InExpand
Quelques problèmes additifs : bases, pseudo-puissances et ensembles k-libres
Habituellement etudie dans N ou Z, on s'interesse aux bases additives dans les groupes abeliens infinis. On obtient des resultats sur les fonctions E, X et S, qui caracterisent le comportement d'uneExpand