[10] **viXra:1712.0366 [pdf]**
*submitted on 2017-12-10 01:30:48*

**Authors:** Barry Foster

**Comments:** 1 Page.

This treatment uses two simple facts and seems to confirm the Conjecture without providing an obvious method for discovering GP primes.

**Category:** Number Theory

[9] **viXra:1712.0359 [pdf]**
*submitted on 2017-12-08 08:14:04*

[8] **viXra:1712.0353 [pdf]**
*submitted on 2017-12-09 04:18:48*

**Authors:** Bado idriss olivier

**Comments:** 6 Pages.

In this paper, we are going to give the proof of the Goldbach conjecture by introducing the lemma which implies Goldbach conjecture. first of all we are going to prove that the lemma implies Goldbach conjecture and in the following we are going to prove the validity of the lemma by using Chébotarev-Artin theorem's, Mertens formula and the Principle of inclusion - exclusion of Moivre

**Category:** Number Theory

[7] **viXra:1712.0352 [pdf]**
*submitted on 2017-12-09 04:21:53*

**Authors:** Bado idriss olivier

**Comments:** 5 Pages.

In this paper, we are going to give the proof of legendre conjecture by using the Chebotarev -Artin 's theorem ,Dirichlet arithmetic theorem and the principle inclusion-exclusion of Moivre

**Category:** Number Theory

[6] **viXra:1712.0343 [pdf]**
*submitted on 2017-12-07 15:04:23*

**Authors:** Antoine Balan

**Comments:** 3 pages, written in french

We show that the problem of Syracuse is a problem of complex analysis.

**Category:** Number Theory

[5] **viXra:1712.0342 [pdf]**
*submitted on 2017-12-07 19:37:22*

**Authors:** F.L.B.Périat

**Comments:** 2 Pages.

Voici la démonstration que les nombres univers sont infiniment rare.

**Category:** Number Theory

[4] **viXra:1712.0202 [pdf]**
*submitted on 2017-12-06 19:30:08*

**Authors:** Réjean Labrie

**Comments:** 1 Page.

542 Place Macquet

**Category:** Number Theory

[3] **viXra:1712.0135 [pdf]**
*replaced on 2017-12-09 13:15:45*

**Authors:** Kamal Barghout

**Comments:** 16 Pages. The material in this article is copyrighted. Please obtain authorization to use from the author

In this article we prove Beal’s conjecture by deductive reasoning by means of elementary algebraic methods. The main assertion in the proof stands upon that the LHS of Beal’s equation represents the sum of two single-term polynomial functions with common indeterminate x of value greater than 1. The single term polynomial function on the RHS of Beal’s equation can be built from the sum of the two polynomials on the LHS. The Greatest Common Factor (GCF) of the two terms on the LHS of the equation is a number in exponential form whose base is the common indeterminate of the two polynomials. Upon factorization of the GCF, it must be combined with the sum of the two coefficients of the terms to yield the single-term polynomial on the RHS of the equation.

**Category:** Number Theory

[2] **viXra:1712.0098 [pdf]**
*submitted on 2017-12-05 06:02:16*

**Authors:** Choe Ryujin

**Comments:** 6 Pages.

Proof of Goldbach's conjecture and twin prime conjecture

**Category:** Number Theory

[1] **viXra:1712.0073 [pdf]**
*submitted on 2017-12-03 17:31:02*

**Authors:** Leszek W. Guła

**Comments:** 1 Page.

The Goldbach's Theorem

**Category:** Number Theory