English
Related papers

Related papers: Linnik's approximation to Goldbach's conjecture, a…

200 papers

An approximate formula for the partitions of Goldbach's Conjecture is derived using Prime Number Theorem and a heuristic probabilistic approach. A strong form of Goldbach's conjecture follows in the form of a lower bounding function for the…

General Mathematics · Mathematics 2007-05-23 Max S. C. Woon

This paper introduces a general technique for estimating the absolute value of pure Gaussian sums of order k over a prime p for a class of composite order k. The new estimate improves the classical estimate by a factor of about 2 or better…

Number Theory · Mathematics 2007-05-23 N. A. Carella

We study an optimization problem originated from the Grothendieck constant. A generalized normal equation is proposed and analyzed. We establish a correspondence between solutions of the general normal equation and its dual equation.…

Functional Analysis · Mathematics 2025-05-09 Naihuan Jing , Yibo Liu , Jiacheng Sun , Chengrui Zhao , Haoran Zhu

For an even integer $k$, let $r_{2k}(n)$ be the number of representations of $n$ as a sum of $2k$ squares. The quantity $r_{2k}(n)$ is appoximated by the classical singular series $\rho_{2k}(n) \asymp n^{k-1}$. Deligne's bound on the…

Number Theory · Mathematics 2012-12-27 Jeremy Rouse

We investigate progressions in the set of pairs of integers $\mathbb{Z}^2$ and define a generalisation of the Jacobsthal function. For this function, we conjecture a specific upper bound and prove that this bound would be a sufficient…

Number Theory · Mathematics 2017-06-02 Mario Ziller , John F. Morack

This paper presents some considerations about the Goldbach's conjecture (GC). The work is based on elementary results of the number theory and it provides a constructive method that permits, given an even integer, to find at least a pair of…

General Mathematics · Mathematics 2013-12-13 Ciro D'Urso

We survey the potential for progress in additive number theory arising from recent advances concerning major arc bounds associated with mean value estimates for smooth Weyl sums. We focus attention on the problem of representing large…

Number Theory · Mathematics 2024-02-16 Joerg Bruedern , Trevor D. Wooley

For $n \geq 3$, an asymptotic formula is derived for the number of representations of a sufficiently large natural number $N$ as a sum of $r = 2^n + 1$ summands, each of which is an $n$-th power of natural numbers $x_i$, $i = \overline{1,…

Number Theory · Mathematics 2024-11-12 Zarullo Rakhmonov , Firuz Rakhmonov

We fix a positive integer $k$ and look for solutions of the equations $\phi(n+k) = \phi(n)$ and $\phi(n + k) = 2\phi(n)$. We prove that Fermat primes can be used to build five solutions for the first equation when $k$ is even and five for…

Number Theory · Mathematics 2023-01-25 Matteo Ferrari , Lorenzo Sillari

Let $A$ be a finite set of integers. We show that if $k$ is a prime power or a product of two distinct primes then $$|A+k\cdot A|\geq(k+1)|A|-\lceil k(k+2)/4\rceil$$ provided $|A|\geq (k-1)^{2}k!$, where $A+k\cdot A=\{a+kb:\ a,b\in A\}$. We…

Combinatorics · Mathematics 2014-02-21 Shan-Shan Du , Hui-Qin Cao , Zhi-Wei Sun

Let $f\in \mathbb{Q}(x)$ be a non-constant rational function. We consider "Waring's Problem for $f(x)$," i.e., whether every element of $\bbq$ can be written as a bounded sum of elements of $\{f(a)\mid a\in \mathbb{Q}\}$. For rational…

Number Theory · Mathematics 2018-01-23 Bo-Hae Im , Michael Larsen

We consider weighted averages of the number of representations of an even integer as a sum of two prime numbers, where each summand lies in a given arithmetic progression modulo a common integer $q$. Our result is uniform in a suitable…

Number Theory · Mathematics 2021-05-19 Marco Cantarini , Alessandro Gambini , Alessandro Zaccagnini

A recent heuristic argument based on basic concepts in spectral analysis showed that the twin prime conjecture and a few other related primes counting problems are valid. A rigorous version of the spectral method, and a proof of the more…

General Mathematics · Mathematics 2016-06-20 N. A. Carella

Let $c$ be a positive odd integer and $R$ a set of $n$ primes coprime with $c$. We consider equations $X + Y = c^z$ in three integer unknowns $X$, $Y$, $z$, where $z > 0$, $Y > X > 0$, and the primes dividing $XY$ are precisely those in…

Number Theory · Mathematics 2023-01-24 Reese Scott , Robert Styer

On the Waring's problems for matrices over a commutative ring, there are some trace conditions provided for matrices eligibly expressed as a sum of $k$-th powers with $k=2,3,4,5,6,7,8$ in several literatures. In this paper, we provide the…

Rings and Algebras · Mathematics 2022-04-05 Kunlathida Muangma , Kijti Rodtes

The problem of the least prime number in an arithmetic progression is one of the most important topics in Number Theory. In [11], we are the first to study the relations between this problem and Goldbach's conjecture. In this paper, we…

General Mathematics · Mathematics 2010-02-03 Shaohua Zhang

The ternary Goldbach conjecture states that every odd number n>=7 is the sum of three primes. The estimation of sums of the form \sum_{p\leq x} e(\alpha p), \alpha = a/q + O(1/q^2), has been a central part of the main approach to the…

Number Theory · Mathematics 2013-12-31 H. A. Helfgott

We give a more comrehensive treatment of Chen's double sieve and improve related constants in Goldbach's conjecture and the twin prime problem.

Number Theory · Mathematics 2007-05-23 Jie Wu

For $k$ a positive integer let $S_k(n) = 1^k + 2^k + \cdots + n^k$, i.e., $S_k(n)$ is the sum of the first $k$-th powers. Faulhaber conjectured (later proved by Jacobi) that for $k$ odd, $S_k(n)$ could be written as a polynomial of…

Number Theory · Mathematics 2020-09-08 Steven J. Miller , Enrique Treviño

In the present work we investigate the largest possible gaps between consecutive numbers which can be written as the difference of two primes. The best known upper bounds are the same as those concerning the largest possible difference of…

Number Theory · Mathematics 2012-06-04 Janos Pintz