[13] **viXra:1809.0351 [pdf]**
*submitted on 2018-09-17 17:16:10*

**Authors:** S.I. Nada, A. Elrokh, R. Hamza

**Comments:** 16 pages

Abstract
A graph is called cordial if it has a 0 - 1 labeling such that the number
of vertices (edges) labeled with ones and zeros dier by at most one. The
conjunction of two graphs (V1;E1) and (V2;E2) is the graph G = (V;E),
where V = V1 x V2 and u = (a1; a2), v = (b1; b2) are two vertices, then
uv belongs to E if aibi belongs to Ei for i = 1 or 2. In this paper, we present necessary and
sucient condition for cordial labeling for the conjunction of two paths,
denoted by Pn ^ Pm. Also, we drive an algorithm to generate cordial labeling for the conjunction Pn ^ Pm.

**Category:** Number Theory

[12] **viXra:1809.0341 [pdf]**
*submitted on 2018-09-16 11:10:33*

**Authors:** Pablo Hernan Pereyra

**Comments:** 8 Pages. Copyright 2007

In the present work is demonstrate that the so called Goldbach conjecture from 1742 -- “All positive even numbers greater than two can be expressed as a sum of two primes” – due to Leonhard Euler, is a true statement. This result is partially based on the Wilson theorem, and complementary on our reasoning to cast the problem into a diophantine equation. The latter is the master equation for the conjectures proof.

**Category:** Number Theory

[11] **viXra:1809.0340 [pdf]**
*submitted on 2018-09-16 12:48:43*

**Authors:** Pedro Hugo García Peláez

**Comments:** 12 Pages.

When dividing any number between 1.618033 we obtain decimal numbers with a period of 1618032 decimals

**Category:** Number Theory

[10] **viXra:1809.0338 [pdf]**
*submitted on 2018-09-16 13:40:39*

**Authors:** Paco Derek Tucker

**Comments:** 1 Page.

A simple and fast factoring algorithm that requires only copy paste, the modular operation, and paired additive partitions of the number.

**Category:** Number Theory

[9] **viXra:1809.0322 [pdf]**
*submitted on 2018-09-15 10:35:14*

**Authors:** Hajime Mashima

**Comments:** 9 Pages.

Legendre's conjecture argues that there is always a prime number between n2 and (n + 1)2 when natural number n.

**Category:** Number Theory

[8] **viXra:1809.0317 [pdf]**
*submitted on 2018-09-15 19:51:43*

**Authors:** Pedro Hugo García Peláez

**Comments:** Pages.

Al dividir cualquier número entre 1,618033 obtenemos números decimales con un periodo de 1,618032 decimales

**Category:** Number Theory

[7] **viXra:1809.0207 [pdf]**
*submitted on 2018-09-10 14:02:28*

**Authors:** Samia Lakehal

**Comments:** 13 Pages ; 2 Tables ; 766 Ko

The Sieve of Eratosthenes finds all the prime numbers up to any given limit by eliminating all non-primes from the list of all natural numbers. A list of natural numbers containing no multiples of 2, 3 or 5 is created, it is obtained by 8 formulas. The elimination of non-primes is effectuated from this new list. It then appears that it is possible to express all the non-primes belonging to this list by 36 other formulas, the prime numbers being the numbers satisfying the 8 formulas but not the 36.

**Category:** Number Theory

[6] **viXra:1809.0158 [pdf]**
*submitted on 2018-09-07 14:10:16*

**Authors:** Robert C. Hall

**Comments:** 27 Pages.

The Summation test consists of adding all numbers that begin with a particular first digit or first two digits and determining its distribution with respect to these first or first two digits numbers. Most people familiar with this test believe that the distribution is a uniform distribution for any distribution that conforms to Benford's law i.e. the distribution of the mantissas of the logarithm of the data set is uniform U[0,12). The summation test that results in a uniform distribution is true for an exponential function (geometric progression) but not true for a data set that conforms to a Log Normal distribution even when the Log Normal distribution itself closely approximates Benford's Law.

**Category:** Number Theory

[5] **viXra:1809.0139 [pdf]**
*submitted on 2018-09-08 05:07:23*

**Authors:** Ryujin Choe

**Comments:** 1 Page.

Solution of Goldbach's Conjecture

**Category:** Number Theory

[4] **viXra:1809.0086 [pdf]**
*submitted on 2018-09-04 16:35:05*

**Authors:** Kunle Adegoke

**Comments:** 7 pages, no figures

We derive an identity connecting any two Horadam sequences having the same recurrence relation but whose initial terms may be different. Binomial and ordinary summation identities arising from the identity are developed.

**Category:** Number Theory

[3] **viXra:1809.0060 [pdf]**
*submitted on 2018-09-03 15:11:34*

**Authors:** Pablo Hernan Pereyra

**Comments:** 5 Pages. 2009 Copyright

This paper aims to present an elementary demonstration of the Fermat-Wiles theorem, also known as Fermat's Last Theorem, using a different equivalent statement and a parameterization method.

**Category:** Number Theory

[2] **viXra:1809.0059 [pdf]**
*submitted on 2018-09-03 20:40:44*

**Authors:** Jeozadaque Marcos

**Comments:** 4 pages

We show in this paper another proof of Benford’s Law. The idea starts with the
problem of to find the first digit of a power. Then we deduced a function to calculate
the first digit of any power a j called L f function. The theorem 1.2 its a consequence
of the periodicity of the $L_f$ function.

**Category:** Number Theory

[1] **viXra:1809.0008 [pdf]**
*submitted on 2018-09-01 03:59:30*

**Authors:** Radomir Majkic

**Comments:** 3 Pages.

The minimal homothetic integer solution of the Fermat equation is zero and the Fermat last theorem is true.

**Category:** Number Theory