中文
相关论文

相关论文: On A Conjecture Regarding Permutations Which Destr…

200 篇论文

Assuming the Generalized Riemann Hypothesis, we obtain a lower bound within a constant factor of the conjectured asymptotic result for the second moment for primes in an individual arithmetic progression in short intervals. Previous results…

数论 · 数学 2015-06-26 Daniel Goldston , C. Y. Yildirim

Let $(u(n))_{n\in\mathbb{N}}$ be an arithmetic progression of natural integers in base $b\in\mathbb{N}\setminus \{0,1\}$. We consider the following sequences: $s(n)=\overline{u(0)u(1)\cdots u(n) }^b$ formed by concatenating the first $n+1$…

组合数学 · 数学 2025-08-05 Florian Luca , Bertrand Teguia Tabuguia

We prove several results which imply the following consequences. For any $\varepsilon>0$ and any sufficiently large prime $p$, if $\cI_1,\ldots, \cI_{13}$ are intervals of cardinalities $|\cI_j|>p^{1/4+\varepsilon}$ and $abc\not\equiv…

数论 · 数学 2017-01-26 M. Z. Garaev

We formulate some refinements of Goldbach's conjectures based on heuristic arguments and numerical data. For instance, any even number greater than 4 is conjectured to be a sum of two primes with one prime being 3 mod 4. In general, for…

数论 · 数学 2022-05-05 Kimball Martin

Two conjectures are presented. The first, Conjecture 1, is that the pushforward of a geometric distribution on the integers under $n$ Collatz iterates, modulo $2^p$, is usefully close to uniform distribution on the integers modulo $2^p$, if…

概率论 · 数学 2024-04-22 Mary Rees

Martin's Conjecture is a proposed classification of the definable functions on the Turing degrees. It is usually divided into two parts, the first of which classifies functions which are not above the identity and the second of which…

逻辑 · 数学 2024-04-08 Patrick Lutz , Benjamin Siskind

Let ${\mathcal{P}_{n}}$ denote the set of positive integers which are prime to $n$. Let $B_{n}$ be the $n$-th Bernoulli number. For any prime $p\ge 5$ and $r\ge 2$, we prove that \begin{equation} \sum\limits_{\begin{smallmatrix}…

数论 · 数学 2014-10-14 Liuquan Wang

Sequence of numbers generated by the recurrence relation based on the Collatz conjecture is investigated. An arithmetic operation on the Collatz conjecture is called descending operation, and ascending operation is carried out reversely to…

综合数学 · 数学 2023-11-22 Kyo Jin Ihn

Define a permutation $\sigma$ to be coprime if $\gcd(m,\sigma(m)) = 1$ for $m\in[n]$. In this note, proving a recent conjecture of Pomerance, we prove that the number of coprime permutations on $[n]$ is $n!\cdot (c+o(1))^n$ where \[c =…

数论 · 数学 2022-03-30 Ashwin Sah , Mehtaab Sawhney

A simultaneous arithmetic progression (s.a.p.) of length k consists of k points (x_i, y_\sigma(i)), where x_i and y_i are arithmetic progressions and \sigma is a permutation. Garcia-Selfa and Tornero asked whether there is a bound on the…

数论 · 数学 2014-04-22 Ryan Schwartz , József Solymosi , Frank de Zeeuw

Polignac [1] conjectured that for every even natural number $2k (k\geq1)$, there exist infinitely many consecutive primes $p_n$ and $p_{n+1}$ such that $p_{n+1}-p_n=2k$. A weakened form of this conjecture states that for every $k\geq1$,…

综合数学 · 数学 2009-09-14 Shaohua Zhang

This is a survey article on the Hardy-Littlewood conjecture about primes in quadratic progressions. We recount the history and quote some results approximating this hitherto unresolved conjecture.

数论 · 数学 2008-08-13 Stephan Baier , Liangyi Zhao

For a given integer $m$ and any residue $a \pmod{m}$ that can be written as a sum of 3 squares modulo $m$, we show the existence of infinitely many integers $n \equiv a \pmod{m}$ such that the number of representations of $n$ as a sum of…

数论 · 数学 2024-12-04 Michael Filaseta , Jonah Klein , Cihan Sabuncu

Let $\bar{p}(n)$ denote the number of overpartitions of $n$. It was conjectured by Hirschhorn and Sellers that $\bar{p}(40n+35)\equiv 0\ ({\rm mod\} 40)$ for $n\geq 0$. Employing 2-dissection formulas of quotients of theta functions due to…

组合数学 · 数学 2013-07-17 William Y. C. Chen , Ernest X. W. Xia

A permutation P on {1,..,N} is a_fast_forward_permutation_ if for each m the computational complexity of evaluating P^m(x)$ is small independently of m and x. Naor and Reingold constructed fast forward pseudorandom cycluses and involutions.…

密码学与安全 · 计算机科学 2010-11-02 Boaz Tsaban

Ruzsa's conjecture asserts that any sequence $(a_n)_{n \geq 0}$ of integers that preserves congruences, $\textit{i.e.}$, satisfies $ a_{n+k} \equiv a_n \mod k $, and has the growth condition $\limsup_{n \to +\infty} |a_n|^{1/n} < e$, must…

数论 · 数学 2026-03-11 É. Delaygue

In this paper, we study $k$-term arithmetic progressions $N, N+d, ..., N+(k-1)d$ of powerful numbers. Under the $abc$-conjecture, we obtain $d \gg_\epsilon N^{1/2 - \epsilon}$. On the other hand, there exist infinitely many $3$-term…

数论 · 数学 2022-10-04 Tsz Ho Chan

Towards the Lang--Vojta conjecture, we prove results on finiteness and Zariski degeneracy of $S$-integral points of varieties over number fields $k$, including many cases with geometrically irreducible boundary divisors. Our approach builds…

Let $p(n)$ denote the partition function. In this article, we will show that congruences of the form $$ p(m^j\ell^kn+B)\equiv 0\mod m \text{for all} n\ge 0 $$ exist for all primes $m$ and $\ell$ satisfying $m\ge 13$ and $\ell\neq 2,3,m$.…

数论 · 数学 2009-04-17 Yifan Yang

Let $S$ be a closed Shimura variety uniformized by the complex $n$-ball. The Hodge conjecture predicts that every Hodge class in $H^{2k} (S, \Q)$, $k=0, \ldots, n$, is algebraic. We show that this holds for all degree $k$ away from the…

代数几何 · 数学 2014-06-04 Nicolas Bergeron , John Millson , Colette Moeglin