On stronger conjectures that imply the Erdős-Moser conjecture (Q531841): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(9 intermediate revisions by 7 users not shown) | |||
Property / author | |||
Property / author: Bernd C. Kellner / rank | |||
Property / review text | |||
The Erdős-Moser conjecture states that the Diophantine equation \(S_k(m)=m^k\), where \(S_k(m)=1^k+2^k+\cdots+(m-1)^k\) has no solution for \(m>3\). The best result to date is that it has no solution with \(m>10^{10^9}\), due to \textit{Y. Gallot}, the reviewer and \textit{W. Zudilin} [Math. Comput. 80, No. 274, 1221--1237 (2011; Zbl 1231.11038)]. Here the author states the conjecture that \(S_k(m+1)/S_k(m)\) is never an integer for \(m>3\). This is equivalent with the statement that the Diophantine equation \(aS_k(m)=m^k\) has no solution with \(m>3\) and \(a\geq 1\) an integer. Meanwhile the reviewer [\textit{P. Moree}, ``Moser's mathemagical work on the equation \(1^k+2^k+\cdots+(m-1)^k=m^k\)'', \url{arXiv:1011.2940}, Rocky Mt. J. Math. 43, No. 5, 1707--1737 (2013; Zbl 1362.11045)] has shown that there are infinitely many \(a\) for which this equation has no solution. Let \(g_k(m)\) be the greatest common divisor of \(S_k(m)\) and \(S_k(m+1)\) divided by \(m\). Let \(N_k\) denote the numerator of the \(k\)th Bernoulli number. The author proves that if \[ \max_{m\geq 1}g_k(m)< |N_k|(\log |N_k|)^6 \] for \(k\geq 10\), then the Erdős-Moser conjecture holds true and that more generally the exponent 6 can be replaced by an arbitrary exponent \(e\), at cost of also requiring \(k\geq C_e\), where \(C_e\) is effectively computable. Furthermore, he conjectures that the latter upper bound for \(\max_{m\geq 1}g_k(m)\) holds true for some exponent \(e\) and established this in case \(N_k\) is square-free by showing that \(\max_{m\geq 1}g_k(m)=|N_k|\) then. | |||
Property / review text: The Erdős-Moser conjecture states that the Diophantine equation \(S_k(m)=m^k\), where \(S_k(m)=1^k+2^k+\cdots+(m-1)^k\) has no solution for \(m>3\). The best result to date is that it has no solution with \(m>10^{10^9}\), due to \textit{Y. Gallot}, the reviewer and \textit{W. Zudilin} [Math. Comput. 80, No. 274, 1221--1237 (2011; Zbl 1231.11038)]. Here the author states the conjecture that \(S_k(m+1)/S_k(m)\) is never an integer for \(m>3\). This is equivalent with the statement that the Diophantine equation \(aS_k(m)=m^k\) has no solution with \(m>3\) and \(a\geq 1\) an integer. Meanwhile the reviewer [\textit{P. Moree}, ``Moser's mathemagical work on the equation \(1^k+2^k+\cdots+(m-1)^k=m^k\)'', \url{arXiv:1011.2940}, Rocky Mt. J. Math. 43, No. 5, 1707--1737 (2013; Zbl 1362.11045)] has shown that there are infinitely many \(a\) for which this equation has no solution. Let \(g_k(m)\) be the greatest common divisor of \(S_k(m)\) and \(S_k(m+1)\) divided by \(m\). Let \(N_k\) denote the numerator of the \(k\)th Bernoulli number. The author proves that if \[ \max_{m\geq 1}g_k(m)< |N_k|(\log |N_k|)^6 \] for \(k\geq 10\), then the Erdős-Moser conjecture holds true and that more generally the exponent 6 can be replaced by an arbitrary exponent \(e\), at cost of also requiring \(k\geq C_e\), where \(C_e\) is effectively computable. Furthermore, he conjectures that the latter upper bound for \(\max_{m\geq 1}g_k(m)\) holds true for some exponent \(e\) and established this in case \(N_k\) is square-free by showing that \(\max_{m\geq 1}g_k(m)=|N_k|\) then. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Pieter Moree / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 11D61 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 11B83 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 11B68 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 5880856 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Erdős-Moser equation | |||
Property / zbMATH Keywords: Erdős-Moser equation / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
consecutive values of polynomials | |||
Property / zbMATH Keywords: consecutive values of polynomials / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: OEIS / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Bernd C. Kellner / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1966260755 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q60692232 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1003.1646 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An "exact" formula for the m-th Bernoulli number / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Erdős–Moser equation $1^{k}+2^{k}+\dots+(m-1)^{k}=m^{k}$ revisited using continued fractions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4320535 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3999066 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On irregular prime power divisors of the Bernoulli numbers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5818539 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2859380 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 00:22, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On stronger conjectures that imply the Erdős-Moser conjecture |
scientific article |
Statements
On stronger conjectures that imply the Erdős-Moser conjecture (English)
0 references
20 April 2011
0 references
The Erdős-Moser conjecture states that the Diophantine equation \(S_k(m)=m^k\), where \(S_k(m)=1^k+2^k+\cdots+(m-1)^k\) has no solution for \(m>3\). The best result to date is that it has no solution with \(m>10^{10^9}\), due to \textit{Y. Gallot}, the reviewer and \textit{W. Zudilin} [Math. Comput. 80, No. 274, 1221--1237 (2011; Zbl 1231.11038)]. Here the author states the conjecture that \(S_k(m+1)/S_k(m)\) is never an integer for \(m>3\). This is equivalent with the statement that the Diophantine equation \(aS_k(m)=m^k\) has no solution with \(m>3\) and \(a\geq 1\) an integer. Meanwhile the reviewer [\textit{P. Moree}, ``Moser's mathemagical work on the equation \(1^k+2^k+\cdots+(m-1)^k=m^k\)'', \url{arXiv:1011.2940}, Rocky Mt. J. Math. 43, No. 5, 1707--1737 (2013; Zbl 1362.11045)] has shown that there are infinitely many \(a\) for which this equation has no solution. Let \(g_k(m)\) be the greatest common divisor of \(S_k(m)\) and \(S_k(m+1)\) divided by \(m\). Let \(N_k\) denote the numerator of the \(k\)th Bernoulli number. The author proves that if \[ \max_{m\geq 1}g_k(m)< |N_k|(\log |N_k|)^6 \] for \(k\geq 10\), then the Erdős-Moser conjecture holds true and that more generally the exponent 6 can be replaced by an arbitrary exponent \(e\), at cost of also requiring \(k\geq C_e\), where \(C_e\) is effectively computable. Furthermore, he conjectures that the latter upper bound for \(\max_{m\geq 1}g_k(m)\) holds true for some exponent \(e\) and established this in case \(N_k\) is square-free by showing that \(\max_{m\geq 1}g_k(m)=|N_k|\) then.
0 references
Erdős-Moser equation
0 references
consecutive values of polynomials
0 references
0 references