中文
相关论文

相关论文: Almost all palindromes are composite

200 篇论文

It is proven that, in any given base, there are infinitely many palindromic numbers having at most six prime divisors, each relatively large. The work involves equidistribution estimates for the palindromes in residue classes to large…

数论 · 数学 2024-07-24 Aleksandr Tuxanidy , Daniel Panario

For a given base $g\ge2$, a positive integer is called a palindrome if its base $g$ expansion reads the same backwards as forwards. In this paper, we give an asymptotic formula for the number of relatively prime pairs of palindromes of a…

数论 · 数学 2024-03-18 Hirotaka Kobayashi , Yuta Suzuki , Ryota Umezawa

In this paper it was shown that all prime numbers lie on 96 half-lines. At the same time, it was shown that if a given number does not lie on any of the above half-lines, then it is a composite number. A corresponding linear mathematical…

综合数学 · 数学 2024-10-11 Marek Berezowski

For $g \ge 2$, we show that the number of positive integers at most $X$ which can be written as sum of two base $g$ palindromes is at most $\frac{X}{\log^c X}$. This answers a question of Baxter, Cilleruelo and Luca.

数论 · 数学 2024-12-11 Dmitrii Zakharov

We introduce a notion of palindromicity of a natural number which is independent of the base. We study the existence and density of palindromic and multiple palindromic numbers, and we raise several related questions.

综合数学 · 数学 2007-05-23 Antonio J. Di Scala , Martin Sombra

We prove a generalization of the author's work to show that any subset of the primes which is `well-distributed' in arithmetic progressions contains many primes which are close together. Moreover, our bounds hold with some uniformity in the…

数论 · 数学 2014-12-17 James Maynard

It is shown that the set of palindromes is an additive basis for the natural numbers in any base. Specifically, we prove that every natural number can be expressed as the sum of $O(d)$ palindromes in base $d$.

数论 · 数学 2022-04-19 Yu Gao

We study pairs of consecutive odd numbers through a straightforward indexing. We focus in particular on twin primes and their distribution. With a counting argument, we calculate the limit of an alternating sum that is equal to 1 which…

综合数学 · 数学 2021-06-08 Marc Wolf , FranÇOis Wolf , FranÇOis-Xavier Villemin

A positive integer $n$ is said to be a palindrome in base $b$ (or $b$-adic palindrome) if the representation of $n = (a_k a_{k-1} \cdots a_0)_b$ in base $b$ with $a_k \neq 0$ has the symmetric property $a_{k-i} = a_i$ for every…

经典分析与常微分方程 · 数学 2018-03-06 Phakhinkon Phunphayap , Prapanpong Pongsriiam

A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…

组合数学 · 数学 2007-05-23 Sergey Kitaev , Tyrrell B. McAllister , T. Kyle Petersen

In recent work, G. E. Andrews and G. Simay prove a surprising relation involving parity palindromic compositions, and ask whether a combinatorial proof can be found. We extend their results to a more general class of compositions that are…

组合数学 · 数学 2021-09-29 Matthew Just

We settle an open problem regarding palindromes; that is, positive integers which are the same when written forwards and backwards. In particular, we prove that for any fixed base $b\geq 2$, there exist infinitely many square-free…

数论 · 数学 2026-01-21 Daniel R. Johnston , Bryce Kerr

It is shown that the set of decimal palindromes is an additive basis for the natural numbers. Specifically, we prove that every natural number can be expressed as the sum of forty-nine (possibly zero) decimal palindromes.

数论 · 数学 2015-08-20 William D. Banks

We identify pairs of positive integers $(t, d)$ with the property that the integer sequence with general term $\lfloor{n^t/d\rfloor}$ contains at most finitely many primes.

数论 · 数学 2025-01-10 Dan Ismailescu , Yunkyu James Lee

For integer $g\ge 5$, we prove that any positive integer can be written as a sum of three palindromes in base $g$.

数论 · 数学 2017-06-20 Javier Cilleruelo , Florian Luca , Lewis Baxter

For any finite field $\mathbb{F}$ and any positive integer $n$ we count the number of monic polynomials of degree $n$ over $\mathbb{F}$ with nonzero constant coefficient and a self-reciprocal factor of any specified degree. An application…

数论 · 数学 2022-10-31 Geoffrey Price , Katherine Thompson

The set of prime numbers has been analyzed, based on their algebraic and arithmetical structure. Here by obtaining a sort of linear formula for the set of prime numbers, they are redefined and identified; under a systematic procedure it has…

综合数学 · 数学 2014-12-30 Ramin Zahedi

Let $X$ be a scheme of finite type over $\mathbf{Z}$. For $p \in \mathcal{P}$ the set of prime numbers, let $N_{X}(p)$ be the number of $\mathbf{F}_{p}$-points of $X/\mathbf{F}_{p}$. For fixed $n\geq 1$ and $a_{1}, \ldots, a_{n} \in…

数论 · 数学 2019-04-01 Lucile Devin

We consider infinite parametric families of high degree number fields composed of quadratic fields with pure cubic, pure quartic, pure sextic fields and with the so called simplest cubic, simplest quartic fields. We explicitly describe an…

数论 · 数学 2018-09-27 István Gaál , László Remete

We calculate the probability that random polynomial matrices over a finite field with certain structures are right prime or left prime, respectively. In particular, we give an asymptotic formula for the probability that finitely many…

动力系统 · 数学 2017-04-07 Julia Lieb
‹ 上一页 1 2 3 10 下一页 ›