Results 11 to 20 of about 1,226 (146)
Números primos; método gráfico de la conjetura de GOLDBACH
Mediante el uso de Microsoft Excel el siguiente trabajo examina las tablas de multiplicar desde una perspectiva distinta, con un método sencillo para encontrar la secuencia de los números primos en la línea continua de los números naturales , y así luego
Yandry Intriago Delgado
doaj +1 more source
Counting on Determinants [PDF]
No abstract provided in this ...
Benjamin, Arthur T., Cameron, Naiomi T.
core +3 more sources
On the intervals bewtween consecutive numbers that are sums of two primes [PDF]
It is the well known conjecture of H. Cramer that Pn+1-Pn≪(log Pn)2 where Pn is the n-th prime. In 1940 P. Erdos proposed the problem to estimate the sum ..
Mikawa Hiroshi
core +1 more source
Figurate primes and Hilbert's 8th problem
In this paper, by using the theory of elliptic curves, we discuss several Diophantine equations related with the so-called figurate primes. Meanwhile, we raise several conjectures related with figurate primes and Hilbert's 8th problem, including Goldbach'
Cai, Tianxin +2 more
core +1 more source
ON GOLDBACH'S CONJECTURE [PDF]
This paper considers some aspects of Goldbach's conjecture as a conjecture and estimates the number of prime pairs in some intervals in order to portray a compelling picture of some of the computational issues generated by the conjecture.
Anthony G. Shannon, J.V Leyendekkers
openaire +1 more source
Thinking over the Goldbach conjecture solution from a probabilistic point of view
This paper aims to provide a set of considerations that allow us to see a possible solution to the problematic issue of Goldbach's "strong" conjecture, which amounts to asserting that any even natural number greater than 2 can be written as the sum of ...
Rosario D'Amico
doaj +1 more source
Ternary Goldbach Conjecture implies Strong Goldbach Conjecture
A simple argument proves the conjecture.
openaire +1 more source
Prime labelings on a 3xn grid graph
It is conjectured that the mxn grid graph has a prime labeling for all positive integers m and n. It is known that for any prime p and any integer n such that 1≤n≤p2, there exists a prime labeling on the pxn grid graph Pm x Pn. Also, it is known that the
Stephen J. Curran, Matt A. Ollis
doaj +1 more source
Most Subsets are Balanced in Finite Groups [PDF]
The sumset is one of the most basic and central objects in additive number theory. Many of the most important problems (such as Goldbach's conjecture and Fermat's Last theorem) can be formulated in terms of the sumset $S + S = \{x+y : x,y\in S\}$ of a ...
Miller, Steven J., Vissuet, Kevin
core +1 more source
Sums and differences of correlated random sets [PDF]
Many fundamental questions in additive number theory (such as Goldbach's conjecture, Fermat's last theorem, and the Twin Primes conjecture) can be expressed in the language of sum and difference sets. As a typical pair of elements contributes one sum and
Do, Thao +4 more
core +2 more sources

