Results 61 to 70 of about 188,366 (125)
Sylvester: Ushering in the Modern Era of Research on Odd Perfect Numbers
In 1888, James Joseph Sylvester (1814-1897) published a series of papers that he hoped would pave the way for a general proof of the nonexistence of an odd perfect number (OPN).
Gimbel, Steven, Jaroma, John
core +1 more source
The Goldbach Problem is reduced to three smaller problems according to the concept of left, middle, and right numbers [1]. The left and right numbers are present in the Goldbach pairs. The solutions to the three problems are similar and simpler. A condition for the satisfaction of the Goldbach conjecture as well as a main equation for the number of ...
openaire +2 more sources
Smarandache Sequences: Explorations and Discoveries with a Computer Algebra System [PDF]
We study Smarandache sequences of numbers, and related problems, via a Computer Algebra System.
Delfim F. M. Torres, Paulo D. F. Gouveia
core
It is shown that if every odd integer $n > 5$ is the sum of three primes, then every even integer $n > 2$ is the sum of two primes. A conditional proof of Goldbach's conjecture, based on Cram r's conjecture, is presented. Theoretical and experimental results available on Goldbach's conjecture allow that a less restrictive conjecture than Cram r'
openaire +2 more sources
Ternary Goldbach Conjecture implies ABC Conjecture
Several crucial properties of abc conjecture are presented and proven. One of the resultsis that the ternary Goldbach Conjecture implies the existence of three numbers \((a, b, c)\) that satisfy the abc conjecture for an arbitrary value of the sum \(c=a+b\).
openaire +1 more source
Every even number greater than 2 is the sum of two primes provided Riemann hypothesis holds
We solve Goldbach's conjecture for all the evens greater than 2. This solution is based upon the proof of Sabihi's first and second conjectures (my own conjectures on Goldbach's one) and Riemann Hypothesis is supposed to be correct.
Sabihi, Ahmad
core
About Goldbach strong conjecture
13 pages, 8 figures, 3 ...
Funes, G. +3 more
openaire +2 more sources
In this paper we give the complete proof of Golbach conjecture by using Chebotarev -Artin theorem , principle inclusion -exclusion of Moivre and Mertens ...
openaire +4 more sources
The Goldbach's conjecture has been described as the most difficult problem in the history of Mathematics. This conjecture states that every even integer greater than 2 can be written as the sum of two primes. On the other hand, P versus NP is considered as one of the most important open problems in computer science.
openaire +1 more source
A New Method to Prove Goldbach’s Conjecture
Zengyong Liang
semanticscholar +1 more source

