English
Related papers

Related papers: Three consecutive almost squares

200 papers

Let $B$ be a sixth-power-free integer and $P$ be a non-torsion point on the Mordell curve $E_B:y^2=x^3+B$. In this paper, we study integral multiples $[n]P$ of $P$. Among other results, we show that $P$ has at most three integral multiples…

Number Theory · Mathematics 2023-07-10 Amir Ghadermarzi

For irreducible integer polynomials $f(n)=n^d+c$ we prove an asymptotic formula for the number of $k$-th power free values taken by $f(n)$, for $n$ running up to $x$, subject to the condition $k\ge (5d+3)/9$. This improves earlier results…

Number Theory · Mathematics 2011-03-11 D. R. Heath-Brown

A square is the concatenation of a nonempty word with itself. A word has period p if its letters at distance p match. The exponent of a nonempty word is the quotient of its length over its smallest period. In this article we give a proof of…

Discrete Mathematics · Computer Science 2012-07-25 Golnaz Badkobeh , Maxime Crochemore

It has been conjectured for some time that, for any integer n\ge 2, any real number \epsilon >0 and any transcendental real number \xi, there would exist infinitely many algebraic integers \alpha of degree at most n with the property that…

Number Theory · Mathematics 2007-05-23 Damien Roy

For a non-square positive integer x, let k_x denote the distance between x^3 and the perfect square closest to x^3. A conjecture of Marshall Hall states that the ratios r_x = (x^(1/2))/k_x, are bounded above. (Elkies has shown that any such…

Number Theory · Mathematics 2014-10-02 Ryan D'Mello

In this paper, we study partitions of positive integers with restrictions involving squares. We mainly establish the following two results (which were conjectured by Sun in 2013): (i) Each positive integer $n$ can be written as $n=x+y+z$…

Number Theory · Mathematics 2021-05-27 Chao Huang , Zhi-Wei Sun

Let f be a cubic polynomial. Then there are infinitely many primes p such that f(p) is square-free.

Number Theory · Mathematics 2007-06-12 Harald Andres Helfgott

An efficient, when compared to exhaustive enumeration, algorithm for computing the number of square-free words of length $n$ over the alphabet $\{a, b, c\}$ is presented.

Formal Languages and Automata Theory · Computer Science 2021-05-11 Vladislav Makarov

Let $f$ be a Rademacher or a Steinhaus random multiplicative function. Let $\varepsilon>0$ small. We prove that, as $x\rightarrow +\infty$, we almost surely have $$\bigg|\sum_{\substack{n\leq x\\…

Number Theory · Mathematics 2021-05-21 Daniele Mastrostefano

We consider various arithmetic questions for the Piatetski-Shapiro sequences $\fl{n^c}$ ($n=1,2,3,...$) with $c>1$, $c\not\in\N$. We exhibit a positive function $\theta(c)$ with the property that the largest prime factor of $\fl{n^c}$…

We prove part of a conjecture of Borwein and Choi concerning an estimate on the square of the number of solutions to n=x^2+Ny^2 for a squarefree integer N.

Number Theory · Mathematics 2021-02-03 Ram Murty , Robert Osburn

For coprime positive integers $a, b, c$, where $a+b=c$, $\gcd(a,b,c)=1$ and $1\leq a < b$, the famous $abc$ conjecture (Masser and Oesterl\`e, 1985) states that for $\varepsilon > 0$, only finitely many $abc$ triples satisfy $c >…

General Mathematics · Mathematics 2021-09-22 Zenon B. Batang

In this article, we study necessary conditions for certain square-free integers to be congruent numbers. Our method uses divisibility properties of class numbers of related imaginary quadratic fields. We first consider positive square-free…

Number Theory · Mathematics 2026-04-28 Shamik Das , Debajyoti De , Sudipa Mondal

Let $\{f_n\}$ be the Fibonacci sequence. For any positive integer $n$, let $r(n)$ be the number of solutions of $n=p+f_{k_1^{2}} +f_{k_{2}^{2}}$, where $p$ is a prime and $k_1, k_2$ are nonnegative integers with $k_1\le k_2$. In this paper,…

Number Theory · Mathematics 2025-06-05 Ji-Zhen Xu , Yong-Gao Chen

We present and analyze an algorithm to enumerate all integers $n\le x$ that can be written as the sum of consecutive $k$th powers of primes, for $k>1$. We show that the number of such integers $n$ is asymptotically bounded by a constant…

Number Theory · Mathematics 2024-01-04 Cathal O'Sullivan , Jonathan P. Sorenson , Aryn Stahl

The classical No-Three-In-Line problem seeks the maximum number of points that may be selected from an $n\times n$ grid while avoiding a collinear triple. The maximum is well known to be linear in $n$. Following a question of Erde, we seek…

Combinatorics · Mathematics 2024-11-07 Dániel T. Nagy , Zoltán Lóránt Nagy , Russ Woodroofe

We consider several old problems involving the number of prime divisors function $\omega(n)$, as well as the related functions $\Omega(n)$ and $\tau(n)$. Firstly, we show that there are infinitely many positive integers $n$ such that…

Number Theory · Mathematics 2026-04-28 Terence Tao , Joni Teräväinen

We show that every cubic bridgeless graph with n vertices has at least 3n/4-10 perfect matchings. This is the first bound that differs by more than a constant from the maximal dimension of the perfect matching polytope.

Combinatorics · Mathematics 2015-09-28 Louis Esperet , Daniel Kral , Petr Skoda , Riste Skrekovski

We prove that there are infinitely many integers $n$ such that $n$ and $n+1$ have the same number of distinct prime divisors.

Number Theory · Mathematics 2011-05-10 Jan-Christoph Schlage-Puchta

Let $\big(\mathcal{S}_n^{\alpha,\kappa,\mathfrak{r}}(z)\big)_{n=1}^\infty$ be a sequence of the largest possible integer intervals, such that…

General Mathematics · Mathematics 2020-04-09 Andrzej Bożek
‹ Prev 1 3 4 5 6 7 10 Next ›