中文
相关论文

相关论文: On the ternary Goldbach problem with primes in ari…

200 篇论文

Let $k$ be a positive integer. In this paper, using the modular approach, we prove that if $k\equiv 0 \pmod{4}$, $30< k<724$ and $2k-1$ is an odd prime power, then under the GRH, the equation $x^2+(2k-1)^y=k^z$ has only one positive integer…

数论 · 数学 2022-04-27 Elif Kızıldere Mutlu , Maohua Le , Gökhan Soydan

Let P denote the set of all primes. Suppose that P_1, P_2, P_3 are three subsets of P with the sum of their lower densities relative to P is greater than 2. We prove that for sufficiently large odd integer n, there exist p_i\in P_i such…

数论 · 数学 2008-12-06 Hongze Li , Hao Pan

We prove that every odd number $N$ greater than 1 can be expressed as the sum of at most five primes, improving the result of Ramar\'e that every even natural number can be expressed as the sum of at most six primes. We follow the circle…

数论 · 数学 2012-07-05 Terence Tao

For $n \geq 3$, an asymptotic formula is derived for the number of representations of a sufficiently large natural number $N$ in the form $p_1+p_2+m^n=N$, where $p_1$, $p_2$ $-$ prime numbers, $m$ $-$ natural number satisfying the…

数论 · 数学 2025-10-08 Firuz Rakhmonov

We give a short proof for an explicit upper bound on the proportion of permutations of a given prime order $p$, acting on a finite set of given size $n$, which is sharp for certain $n$ and $p$. Namely, we prove that if $n\equiv k\pmod{p}$…

组合数学 · 数学 2022-10-28 Cheryl E. Praeger , Enoch Suleiman

Using the fact that the number of combinations $p_{1}$, $p_{2}$, where $p_{1}$ and $p_{2}$ are odd primes, with $p_{1} \leq p_{2}$ and $p_{1} + p_{2} \leq 2N$ is equal to the total number of Goldbach pairs for all the even integers from 6…

综合数学 · 数学 2023-04-03 Giulio Morpurgo

The theta cycle of a modular form modulo a prime $p\geq 5$ is well understood. By contrast, the theta cycle modulo a power of $p$ is still mysterious and experimentally erratic. Here we completely determine the theta cycle of a weight $k <…

数论 · 数学 2026-04-08 Scott Ahlgren , Martin Raum , Olav K. Richter

We prove that the primes below $x$ are, on average, equidistributed in arithmetic progressions to smooth moduli of size up to $x^{1/2+1/40-\epsilon}$. The exponent of distribution $\tfrac{1}{2} + \tfrac{1}{40}$ improves on a result of…

数论 · 数学 2025-02-25 Julia Stadlmann

Improving earlier estimates of several authors we show that the number E(X) of Goldbach exceptional even integers (that is, even integers which cannot be written as the sum of two primesw) below X satisfies tho bound E(X) < X^0.72 for…

数论 · 数学 2018-05-01 Janos Pintz

Let $\Lambda(n)$ be the von Mangoldt function, $x$ real and $2\leq y \leq x$. This paper improves the estimate on the exponential sum over primes in short intervals \[ S_k(x,y;\alpha) = \sum_{x< n \leq x+y} \Lambda(n) e\left( n^k \alpha…

数论 · 数学 2016-05-31 Bingrong Huang

We prove the infinitude of shifted primes $p-1$ without prime factors above $p^{0.2844}$. This refines $p^{0.2961}$ from Baker and Harman in 1998. Consequently, we obtain an improved lower bound on the the distribution of Carmichael…

数论 · 数学 2022-11-18 Jared Duker Lichtman

We present an algorithm that, given a prime $p$ as input, determines whether or not the Burau representation of the 3-strand braid group modulo $p$ is faithful. We also prove that the representation is indeed faithful when $p\le 13$.…

几何拓扑 · 数学 2024-06-21 Donsung Lee

A suggestion is put forward regarding a partial proof of FLT(case1), which is elegant and simple enough to have caused Fermat's enthusiastic remark in the margin of his Bachet edition of Diophantus' "Arithmetica". It is based on an…

历史与综述 · 数学 2007-05-23 N. F. Benschop

We initiate the study of representations of elementary abelian $p$-groups via restrictions to truncated polynomial subalgebras of the group algebra generated by $r$ nilpotent elements, $k[t_1,..., t_r]/(t^p_1,..., t_r^p)$. We introduce new…

表示论 · 数学 2011-06-23 Jon F. Carlson , Eric M. Friedlander , Julia Pevtsova

We prove explicit congruences modulo powers of arbitrary primes for three smallest parts functions: one for partitions, one for overpartitions, and one for partitions without repeated odd parts. The proofs depend on $\ell$-adic properties…

数论 · 数学 2013-06-10 Scott Ahlgren , Kathrin Bringmann , Jeremy Lovejoy

Assuming the generalized Riemann hypothesis, we give asymptotic bounds on the size of intervals that contain primes from a given arithmetic progression using the approach developed by Carneiro, Milinovich and Soundararajan [Comment. Math.…

In this paper we study the function $b_3(n)$ and $b_5(n)$, which denote the number of $3$-regular partitions and $5$-regular partitions of $n$ respectively. Using the theory of modular forms, we prove several arithmetic properties of…

数论 · 数学 2022-10-11 Qi-Yang Zheng

We introduce a variant of the large sieve and give an example of its use in a sieving problem. Take the interval [N] = {1,...,N} and, for each odd prime p <= N^{1/2}, remove or ``sieve out'' by all n whose reduction mod p lies in some…

数论 · 数学 2008-08-01 Ben Green

We prove the modularity of a positive proportion of abelian surfaces over $\mathbf{Q}$. More precisely, we prove the modularity of abelian surfaces which are ordinary at $3$ and are $3$-distinguished, subject to some assumptions on the…

数论 · 数学 2025-03-03 George Boxer , Frank Calegari , Toby Gee , Vincent Pilloni

Let n be a positive odd integer and let p>n+1 be a prime. We mainly derive the following congruence: $$\sum_{0<i_1<...<i_n<p}(i_1/3)(-1)^{i_1}/(i_1...i_n)=0 (mod p).$$

数论 · 数学 2010-02-25 Li-Lu Zhao , Zhi-Wei Sun
‹ 上一页 1 8 9 10 下一页 ›