English
Related papers

Related papers: $(1^3+1)(2^3+1)\cdots(n^3+1)$ is not a cube

200 papers

Let $q$ be a positive integer. Recently, Niu and Liu proved that if $n\ge \max\{q,1198-q\}$, then the product $(1^3+q^3)(2^3+q^3)\cdots (n^3+q^3)$ is not a powerful number. In this note, we prove that (i) for any odd prime power $\ell$ and…

Number Theory · Mathematics 2017-06-13 Quan-Hui Yang , Qing-Qing Zhao

The Erd\H{o}s-Mollin-Walsh conjecture, asserting the nonexistence of three consecutive powerful integers, remains a celebrated open problem in number theory. A natural line of inquiry, following recent work by Chan (2025), is to investigate…

Number Theory · Mathematics 2025-09-25 Jialai She

We study the number $\nu(n)$ of representations of a positive integer $n$ by the form $x^3+y^3+z^3-3xyz$ in the conditions $0\leq x\leq y\leq z; z\geq x+1.$ We proved the following results: (i) for every positive $n,$ except for…

Number Theory · Mathematics 2016-04-26 Vladimir Shevelev

Let $p=3n+1$ be a prime with $n\in\mathbb{N}=\{0,1,\cdots\}$, and let $g\in\mathbb{Z}$ be a primitive root modulo $p$. Let $0<a_1<\cdots<a_n<p$ be all the cubic residues modulo $p$ in the interval $(0,p)$. Then clearly the sequence $$a_1\…

Number Theory · Mathematics 2021-05-21 Hai-Liang Wu , Yue-Feng She

We construct a set of positive integers A in {1,..., n} with |A|>> n^{2/3} that does not contain Hilbert cubes of dimension 3. As a consequence we prove that ex(n; K^(3)(2,2,2))>> n^{8/3} where K^(3)(2,2,2) is the simplest complete…

Combinatorics · Mathematics 2013-11-27 Javier Cilleruelo

We prove that there is a prime between $n^3$ and $(n+1)^3$ for all $n \geq \exp(\exp(33.217))$. Our new tool which we derive is a version of Landau's explicit formula for the Riemann zeta-function with explicit bounds on the error term. We…

Number Theory · Mathematics 2014-01-20 Adrian Dudek

A recent article of Berndt and Yee found congruences modulo 3^k for certain ratios of Eisenstein series. For all but one of these, we show there are no simple congruences a(pn+c) = 0 modulo p when p>= 13 is prime. This follows from a more…

Number Theory · Mathematics 2009-10-02 Michael Dewar

A well-known open problem is to show that the cubic form $x^3+y^3+2z^3$ represents all integers. An obvious variant of this problem is whether every integer can be {\em primitively} represented by $x^3+y^3+2z^3$. In other words, given an…

Number Theory · Mathematics 2010-12-06 Samir Siksek

In this note, we show that $S(n,r):=\sum_{k=0}^{n} \binom{n}{k}\frac{k}{k+r}$ is not an integer for any positive integer $n$ and $r\in \{1,2,3,4,5,6\}$ and for $n\le r-1$. This gives a partial answer to a conjecture of [3].

Number Theory · Mathematics 2018-01-30 Daniel López-Aguayo , Florian Luca

We establish that almost every positive integer $n$ is the sum of four cubes, two of which are at most $n^{\theta}$, as long as $\theta\geq192/869$. An asymptotic formula for the number of such representations is established when…

Number Theory · Mathematics 2010-06-29 Siu-lun Alan Lee

A conjecture of Borwein asserts that for any positive integers $n$ and $k$, the coefficient $a_{3k}$ of $q^{3k}$ in the expansion of $\prod_{j=0}^n (1-q^{3j+1})(1-q^{3j+2})$ is nonnegative. In this paper we prove that for any $0 \leq k\leq…

Combinatorics · Mathematics 2020-01-01 Jiyou Li

Let $\epsilon$ be a fixed positive quantity, $m$ be a large integer, $x_j$ denote integer variables. We prove that for any positive integers $N_1,N_2,N_3$ with $N_1N_2N_3>m^{1+\epsilon},$ the set $$ \{x_1x_2x_3 \pmod m: \quad x_j\in [1,N_j]…

Number Theory · Mathematics 2008-08-11 M. Z. Garaev

We describe a method for bounding the set of exceptional integers not represented by a given additive form in terms of the exceptional set corresponding to a subform. Illustrating our ideas with examples stemming from Waring's problem for…

Number Theory · Mathematics 2015-06-08 Koichi Kawada , Trevor D. Wooley

The representation of any integer as the sum of two cubes to a fixed modulus is always possible if and only if the modulus is not divisible by seven or nine. For a positive non-prime integer N there is given an inductive way to find its…

Number Theory · Mathematics 2011-09-05 Ala Avoyan , David Tsirekidze

In 1937, Lothar Collatz conjectured that the sequence generated by the rule $f(n)=3n+1$ for $n\in\mathbb{N}$ odd, $f(n)=n/2$ for $n\in\mathbb{N}$ even, starting in any positive integer $n$ produces $1$. This is equivalent to (1) there are…

General Mathematics · Mathematics 2017-06-28 Ivan Slapnicar

We use cubic reciprocity to prove that the equation $7x^3+2y^3=3z^2+1$ has no integer solutions. Prior to this work, it was the shortest cubic equation for which the existence of integer solutions remained open. We conclude with a list of…

General Mathematics · Mathematics 2026-05-18 Bogdan Grechuk , Ashleigh Ratcliffe

We show that in any subset of the vertices of $n$-dimensional cube that contains at least $2^{n-1}+1$ vertices ($n\geq 4$), there are four vertices that induce a claw, or there are eight vertices that induce the cycle of length eight.

Discrete Mathematics · Computer Science 2011-10-28 Rafayel Kamalian , Arpine Khachatryan

In this paper we find a third order unimodular matrix, none of whose entries is $1$ or $-1$, such that when each entry of the matrix is replaced by its cube, the resulting matrix is also unimodular. Further, we find third order square…

Number Theory · Mathematics 2021-10-26 Ajai Choudhry

We investigate the asymptotic formula for the number of representations of a large positive integer as a sum of $k$-th powers of integers represented as the sums of three positive cubes, counted with multiplicities. We also obtain a lower…

Number Theory · Mathematics 2020-12-17 Javier Pliego

The 3x+ 1 problem concerns iteration of the map on the integers given by T(n) = (3n+1)/2 if n is odd; T(n) = n/2 if n is even. The 3x+1 Conjecture asserts that for every positive integer n > 1 the forward orbit of n under iteration by T…

Number Theory · Mathematics 2011-01-12 Jeffrey C. Lagarias