Related papers: Goldbach's Function Approximation Using Deep Learn…
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…
In this paper we propose an alternative formulation of the binary and ternary Goldbach conjectures as the systems of equations involving the Euler $\phi$-function.
Using the concepts of Hyperbolic Classification of Natural Numbers, Essential Regions and Goldbach Conjecture Function we prove that the existence of a proof of the Goldbach Conjecture in First-Order Arithmetic would imply the existence of…
In a study, published in Nature, researchers from DeepMind and mathematicians demonstrated a general framework using machine learning to make conjectures in pure mathematics. Here, we build upon this framework to develop a method for…
We formulate Goldbach type questions for Gaussian, Hurwitz, Octavian and Eisenstein primes. They are different from Goldbach type statements by Takayoshi Mitsui from 1960 for number fields or C.A. Holben and James Jordan from 1968 for…
In this note we use recent developments in sieve theory to highlight the interplay between Goldbach and de Polignac numbers. Assuming that the primes have level of distribution greater than $1/2$, we show that at least one of two nice…
We study the approximation complexity of the partition function of the eight-vertex model on general 4-regular graphs. For the first time, we relate the approximability of the eight-vertex model to the complexity of approximately counting…
We study the number of ways to decompose a monic polynomial in F_q[t] of degree n as a sum of two monic irreducible polynomials in F_q[t]. Our principal result is an asymptotic formula for the number of such representations in the case when…
Recently, [{arXiv:0810.3134}] is accepted and published. We show that the Bell inequalities lead to a new type of linear-optical Deutsch algorithms. We have considered a use of entangled photon pairs to determine simultaneously and…
We give a possible explanation for the mystery of a missing number in the statement of a problem that asks for the non-negative integers to be partitioned into three subsets. We interpret the missing number as one of the clues that can lead…
For $n \geq 3,$ let $ p_n $ denote the $n^{\rm th}$ prime number. Let $[ \; ]$ denote the floor or greatest integer function. For a positive integer $m,$ let $\pi_2(m)$ denote the number of twin primes not exceeding $m.$ The twin prime…
In this paper, we investigate exceptional sets in the Waring-Goldbach problem for unlike powers. For example, estimates are obtained for sufficiently large integers below a parameter subject to the necessary local conditions that do not…
Deep generative models, since their inception, have become increasingly more capable of generating novel and perceptually realistic signals (e.g., images and sound waves). With the emergence of deep models for graph structured data, natural…
The goal of this paper is to describe an elementary combinatorial heuristic that predicts Hardy and Littlewood's extended Goldbach's conjecture. We examine common features of other heuristics in additive prime number theory, such as…
We show that every $N \geq 2$ can be written as the sum of positive integers $a$ and $b$ where $\Omega(ab) \leq 40$. The result is obtained through the direct application of an explicit lower bound Selberg sieve along with some computation…
A common problem in machine learning is to rank a set of n items based on pairwise comparisons. Here ranking refers to partitioning the items into sets of pre-specified sizes according to their scores, which includes identification of the…
Let $\mathcal{P}$ denote the set of all primes, and let $\underline\delta(P)$ denote the relative lower density of a subset $P$ in $\mathcal{P}$. Suppose that $P_1, P_2, P_3, P_4$ are four subsets of primes with…
Given a computable sequence of natural numbers, it is a natural task to find a G\"odel number of a program that generates this sequence. It is easy to see that this problem is neither continuous nor computable. In algorithmic learning…
Consider the set of all natural numbers that are co-prime to primes less than or equal to a given prime. Then given a consecutive pair of numbers in that set with an arbitrary even gap, we prove there exists an unbounded number of actual…
In this note, assuming a variant of the Generalized Riemann Hypothesis, which does not exclude the existence of real zeros, we prove an asymptotic formula for the mean value of the representation function for the sum of two primes in…