Effectivization of a lower bound for \(\| (4/3)^k\| \).

*(English. Russian original)*Zbl 1230.11088
Math. Notes 85, No. 6, 877-885 (2009); translation from Mat. Zametki 85, No. 6, 927-935 (2009).

Waring’s problem is concerned with the representations of positive integers as sums of \(k\)th powers, i.e., with the solutions of the Diophantine equation
\[
x_1^k + x_2^k + \dots + x_s^k = N, \tag{1}
\]
where \(N\) is a fixed positive integer and \(x_1, \dots, x_s\) are non-negative integer unknowns. This problem has two very different versions. First, one may ask what is the least \(s\) such that all \(N \geq 1\) can be represented in the form (1). The least \(s\) with this property is usually denoted \(g(k)\). Second, one may ask what is the least \(s\) such that all sufficiently large integers \(N\) can be represented in the above form; the least such \(s\) is usually denoted \(G(k)\). The estimation of \(G(k)\) is one of the central problems in additive number theory and has been a driving force behind the development of the circle method for the past ninety years. The value of \(g(k)\), on the other hand, turns out to be determined by the arithmetic properties of certain relatively small \(N\), and its study leads to some interesting questions on Diophantine approximation.

The paper under review establishes two inequalities related to the study of \(g(k)\). The value of \(g(k)\) depends on the inequality \(\| (3/2)^k \| \geq (3/4)^k\), where \(\| x \|\) denotes the distance from \(x\) to the nearest integer. Thus, several authors have given estimates of the form \[ \left\| (3/2)^k \right\| \geq C^k \qquad\text{for all integers } k \geq k_0, \] with explicit values of \(C\) and \(k_0\). In particular, the best result to date has been obtained by V. Zudilin [J. Théor. Nombres Bordx. 19, No. 1, 311–323 (2007; Zbl 1127.11049)], who gave such a bound with \(C = 0.5803\). While the value of \(k_0\) in Zudilin’s work is effectively computable, it is not easy to compute it. In this paper, the author uses Zudilin’s method to obtain a fully explicit, albeit slightly weaker, estimate: \[ \left\| (3/2)^k \right\| \geq (0.5795)^k \qquad\text{for all integers } k \geq 871,387,440,264. \] He further shows that \[ \left\| (4/3)^k \right\| \geq (0.491)^k \qquad\text{for all integers } k \geq k_1, \] where \(k_1\) is an explicitly given number of the order of \(5.868 \times 10^{18}\). This is also a fully explicit version of a result of Zudilin [op. cit.].

The paper under review establishes two inequalities related to the study of \(g(k)\). The value of \(g(k)\) depends on the inequality \(\| (3/2)^k \| \geq (3/4)^k\), where \(\| x \|\) denotes the distance from \(x\) to the nearest integer. Thus, several authors have given estimates of the form \[ \left\| (3/2)^k \right\| \geq C^k \qquad\text{for all integers } k \geq k_0, \] with explicit values of \(C\) and \(k_0\). In particular, the best result to date has been obtained by V. Zudilin [J. Théor. Nombres Bordx. 19, No. 1, 311–323 (2007; Zbl 1127.11049)], who gave such a bound with \(C = 0.5803\). While the value of \(k_0\) in Zudilin’s work is effectively computable, it is not easy to compute it. In this paper, the author uses Zudilin’s method to obtain a fully explicit, albeit slightly weaker, estimate: \[ \left\| (3/2)^k \right\| \geq (0.5795)^k \qquad\text{for all integers } k \geq 871,387,440,264. \] He further shows that \[ \left\| (4/3)^k \right\| \geq (0.491)^k \qquad\text{for all integers } k \geq k_1, \] where \(k_1\) is an explicitly given number of the order of \(5.868 \times 10^{18}\). This is also a fully explicit version of a result of Zudilin [op. cit.].

Reviewer: Angel V. Kumchev (Towson)

PDF
BibTeX
XML
Cite

\textit{Yu. A. Pupyrev}, Math. Notes 85, No. 6, 877--885 (2009; Zbl 1230.11088); translation from Mat. Zametki 85, No. 6, 927--935 (2009)

Full Text:
DOI

##### References:

[1] | K. Mahler, ”On the fractional parts of powers of real numbers (II),” Mathematika 4, 122–124 (1957). · Zbl 0208.31002 · doi:10.1112/S0025579300001170 |

[2] | A. Baker and J. Coates, ”Fractional parts of powers of rationals,” Math. Proc. Cambridge Philos. Soc. 77, 269–279 (1975). · Zbl 0298.10018 · doi:10.1017/S0305004100051082 |

[3] | F. Beukers, ”Fractional parts of powers of rationals,” Math. Proc. Cambridge Philos. Soc. 90(1), 13–20 (1981). · Zbl 0466.10030 · doi:10.1017/S0305004100058485 |

[4] | A. K. Dubitskas, ”A lower bound for the quantity ||(3/2)k||,” Uspekhi Mat. Nauk 45(4), 153–154 (1990) [RussianMath. Surveys 45 (4), 163–164 (1990)]. |

[5] | F. Delmer and J.-M. Deshouillers, ”The computation of g(k) in Waring’s problem,” Math. Comp. 54(190), 885–893 (1990). · Zbl 0701.11043 |

[6] | J. Kubina and M. Wunderlich, ”Extending Waring’s conjecture up to 471 600 000,” Math. Comp. 55(192), 815–820 (1990). · Zbl 0725.11051 |

[7] | M. A. Bennett, ”Fractional parts of powers of rational numbers,” Math. Proc. Cambridge Philos. Soc. 114(2), 191–201 (1993). · Zbl 0791.11030 · doi:10.1017/S0305004100071528 |

[8] | M. A. Bennett, ”An ideal Waring problem with restricted summands,” Acta Arith. 66(2), 125–132 (1994). · Zbl 0793.11026 · doi:10.4064/aa-66-2-125-132 |

[9] | L. Habsieger, ”Explicit lower bounds for ||(3/2)k||,” Acta Arith. 106(3), 299–309 (2003). · Zbl 1126.11325 · doi:10.4064/aa106-3-7 |

[10] | W. Zudilin, ”A new lower bound for ||(3/2)k||,” J. Théor. Nombres Bordeaux 19(1), 311–323 (2007). · Zbl 1127.11049 · doi:10.5802/jtnb.588 |

[11] | L. Schoenfeld, ”Sharper bounds for the Chebyshev function \(\theta\)(x) and \(\psi\)(x). II,” Math. Comp. 30(134), 337–360 (1976). · Zbl 0326.10037 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.