中文
相关论文

相关论文: Perfect powers that are sums of consecutive cubes

200 篇论文

We study the equation $F_n + F_m = y^p$, where $F_n$ and $F_m$ are respectively the $n$-th and $m$-th Fibonacci numbers and $p \ge 2$. We find all solutions under the assumption $n \equiv m \pmod{2}$.

数论 · 数学 2017-07-03 Florian Luca , Vandita Patel

A power is a word of the form $\underbrace{uu...u}_{k \; \text{times}}$, where $u$ is a word and $k$ is a positive integer and a square is a word of the form $uu$. Fraenkel and Simpson conjectured in 1998 that the number of distinct squares…

组合数学 · 数学 2022-09-16 Shuo Li

This work is devoted to proving that, given an integer $x \ge 2$, there are infinitely many perfect powers, coprime with $x$, having exactly $k \ge 3$ non-zero digits in their base $x$ representation, except for the case $x=2, k=4$, for…

数论 · 数学 2022-01-19 Alessio Moscariello

Euler wants to find rational numbers (integers) x and y such that x+y is a square and x^2+y^2 is a fourth power. He parametrizes these with two other variables that satisfy certain equations.

历史与综述 · 数学 2007-05-23 Leonhard Euler

The starting point of our paper is Kashihara's open problem number $30$, concerning the sequence $A001292$ of the OEIS, asking how many terms are powers of integers. We confirm his last conjecture up to the $100128$-th term and provide a…

综合数学 · 数学 2024-01-29 Marco Ripà

Denote by p_k the k-th power sum symmetric polynomial n variables. The interpretation of the q-analogue of the binomial coefficient as Hilbert function leads us to discover that n consecutive power sums in n variables form a regular…

交换代数 · 数学 2018-08-30 Aldo Conca , Christian Krattenthaler , Junzo Watanabe

We study the decomposition of multivariate polynomials as sums of powers of linear forms. As one of our main results we give an algorithm for the following problem: given a homogeneous polynomial of degree 3, decide whether it can be…

计算复杂性 · 计算机科学 2021-07-15 Pascal Koiran , Mateusz Skomra

Let $\mu_1, \ldots, \mu_s$ be real numbers, with $\mu_1$ irrational. We investigate sums of shifted cubes $F(x_1,\ldots,x_s) = (x_1 - \mu_1)^3 + \ldots + (x_s - \mu_s)^3$. We show that if $\eta$ is real, $\tau >0$ is sufficiently large, and…

数论 · 数学 2015-06-12 Sam Chow

A perfect cuboid is a rectangular parallelepiped with integer edges, integer face diagonals, and integer space diagonal. Such cuboids have not yet been found, but nor has their existence been disproved. Perfect cuboids are described by a…

数论 · 数学 2012-07-31 John Ramsden , Ruslan Sharipov

(Below, \Box means "perfect square") Let $P$ and $Q$ be non-zero integers. The Lucas sequence $\{U_n(P,Q)\}$ is defined by $U_0=0$, $U_1=1$, $U_n=P U_{n-1}-Q U_{n-2}$, $(n \geq 2)$. Historically, there has been much interest in when the…

数论 · 数学 2007-05-23 A. Bremner N. Tzanakis

In this paper, we sharpen earlier work of the first author, Luca and Mulholland, showing that the Diophantine equation $$ A^3+B^3 = q^\alpha C^p, \, \, ABC \neq 0, \, \, \gcd (A,B) =1, $$ has, for "most" primes $q$ and suitably large prime…

数论 · 数学 2017-02-28 Michael A. Bennett , Carmen Bruni , Nuno Freitas

The study of solutions to polynomial equations over finite fields has a long history in mathematics and is an interesting area of contemporary research. In recent years the subject has found important applications in the modelling of…

数论 · 数学 2016-06-16 Andreas Aabrandt , Vagn Lundsgaard Hansen

Sum of powers 1^p+...+n^p, with n and p being natural numbers and n>=1, can be expressed as a polynomial function of n of degree p+1. Such representations are often called Faulhaber formulae. A simple recursive algorithm for computing…

离散数学 · 计算机科学 2009-03-26 M. Torabi Dashti

Efficient algorithms are known for many operations on truncated power series (multiplication, powering, exponential, ...). Composition is a more complex task. We isolate a large class of power series for which composition can be performed…

符号计算 · 计算机科学 2013-06-19 Alin Bostan , Bruno Salvy , Éric Schost

One can hardly believe that there is still something to be said about cubic equations. To dodge this doubt, we will instead try and say something about Sylvester. He doubtless found a way of solving cubic equations. As mentioned by Rota, it…

历史与综述 · 数学 2022-02-28 William Y. C. Chen

Lovasz and Plummer conjectured in the 1970's that cubic bridgeless graphs have exponentially many perfect matchings. This conjecture has been verified for bipartite graphs by Voorhoeve in 1979, and for planar graphs by Chudnovsky and…

组合数学 · 数学 2012-06-08 L. Esperet , F. Kardos , D. Kral'

A rational perfect cuboid is a rectangular parallelepiped whose edges and face diagonals are given by rational numbers and whose space diagonal is equal to unity. It is described by a system of four quadratic equations with respect to six…

数论 · 数学 2012-09-05 Ruslan Sharipov

In this paper we construct $q$-Genocchi numbers and polynomials. By using these numbers and polynomials, we investigate the $q$-analogue of alternating sums of powers of consecutive integers due to Euler.

数论 · 数学 2007-05-23 Taekyun Kim

Works of Hooley and Heath-Brown imply a near-optimal bound on the number $N$ of integral solutions to $x_1^3+\dots+x_6^3 = 0$ in expanding regions, conditional on automorphy and GRH for certain Hasse--Weil $L$-functions; for regions of…

数论 · 数学 2023-04-20 Victor Y. Wang

Let G be a bridgeless cubic graph. A well-known conjecture of Berge and Fulkerson can be stated as follows: there exist five perfect matchings of G such that each edge of G is contained in at least one of them. Here, we prove that in each…

组合数学 · 数学 2013-06-06 Giuseppe Mazzuoccolo