**Previous months:**

2007 - 0703(3) - 0706(2)

2008 - 0807(1) - 0809(1) - 0810(1) - 0812(2)

2009 - 0901(2) - 0904(2) - 0907(2) - 0908(4) - 0909(1) - 0910(2) - 0911(1) - 0912(3)

2010 - 1001(3) - 1002(1) - 1003(55) - 1004(50) - 1005(36) - 1006(7) - 1007(11) - 1008(16) - 1009(21) - 1010(8) - 1011(7) - 1012(13)

2011 - 1101(14) - 1102(7) - 1103(13) - 1104(3) - 1105(1) - 1106(2) - 1107(1) - 1108(2) - 1109(3) - 1110(5) - 1111(4) - 1112(4)

2012 - 1201(2) - 1202(13) - 1203(7) - 1204(9) - 1205(7) - 1206(6) - 1207(5) - 1208(5) - 1209(11) - 1210(15) - 1211(10) - 1212(4)

2013 - 1301(5) - 1302(10) - 1303(17) - 1304(16) - 1305(12) - 1306(13) - 1307(26) - 1308(12) - 1309(9) - 1310(13) - 1311(16) - 1312(23)

2014 - 1401(21) - 1402(11) - 1403(26) - 1404(8)

Any replacements are listed further down

[632] **viXra:1404.0115 [pdf]**
*submitted on 2014-04-13 19:32:55*

**Authors:** Marius Coman

**Comments:** 2 Pages.

There are known few interesting properties which distinquish twin primes from the general set of primes, like for instance that 46% of primes smaller than 19000 are Ramanujan primes while about 78% of the lesser of twin primes smaller than 19000 are Ramanujan primes. But seems that a much more trivial observation about the lesser of twin primes escaped attention: from the first 500 numbers which are lesser in a pair of twin primes, 66 of them have the following remarkable property: the sum of their digits is equal to 14.

**Category:** Number Theory

[631] **viXra:1404.0111 [pdf]**
*submitted on 2014-04-14 00:35:51*

**Authors:** Marius Coman

**Comments:** 2 Pages.

In this paper, inspired by one of my previous papers posted on Vixra, I make, considering the sum of the digits of an odd integer, a conjecture about an infinity of sets of integers, each one having an infinite number of primes and I also make, considering the sum of the digits of a prime number, two other conjectures.

**Category:** Number Theory

[630] **viXra:1404.0098 [pdf]**
*submitted on 2014-04-12 09:00:43*

**Authors:** Golden Gadzirayi Nyambuya

**Comments:** 3 Pages. To be submitted to a Peer Reviewed Journal.

Using the same method that we used in the paper http://vixra.org/abs/1309.0154 to prove Fermat's Last Theorem in a simpler and truly marvellous way, we demonstrate that Beal's Conjecture yields -- in the simplest imaginable manner; to our effort to proving it.

**Category:** Number Theory

[629] **viXra:1404.0085 [pdf]**
*submitted on 2014-04-11 06:35:44*

**Authors:** Jamel Ghanouchi

**Comments:** 5 Pages.

We begin with Catalan equation and solve it.

**Category:** Number Theory

[628] **viXra:1404.0031 [pdf]**
*submitted on 2014-04-04 14:34:52*

**Authors:** Idan Raman

**Comments:** 10 Pages.

When defining O(N) as the sum of all divisors of N including himself, it is to be proved that there is no odd number which satisfy the equation:
O(N)=2N

**Category:** Number Theory

[627] **viXra:1404.0028 [pdf]**
*submitted on 2014-04-03 16:35:31*

**Authors:** Giuseppe Rauti

**Comments:** 1 Page.

Brocard's Problem.

**Category:** Number Theory

[626] **viXra:1404.0003 [pdf]**
*submitted on 2014-04-01 11:42:33*

**Authors:** Jamel Ghanouchi

**Comments:** 9 Pages.

We deal with the concept of prime number together with the Riemann hypothesis and present a proof of Riemann hypothesis.

**Category:** Number Theory

[625] **viXra:1403.0981 [pdf]**
*submitted on 2014-03-31 16:42:09*

**Authors:** Marius Coman

**Comments:** 3 Pages.

I was playing with randomly formed formulas based on two distinct primes and the difference of them, when I noticed that the formula p + q + 2*(q – p) – 1, where p, q primes, conducts often to a result which is prime, semiprime, square of prime or product of very few primes. Starting from here, I made a conjecture about a way in which any square of a prime seems that can be written. Following from there, I made a conjecture about a possible infinite set of primes, a conjecture regarding the squares of primes and Poulet numbers and yet three other related conjectures.

**Category:** Number Theory

[624] **viXra:1403.0968 [pdf]**
*submitted on 2014-03-29 07:55:34*

**Authors:** Marius Coman

**Comments:** 2 Pages.

In this paper we present four conjectures, one of them regarding a possible infinite sequence of primes and three of them regarding three possible infinite sequences of Poulet numbers, each of them obtained starting from other possible infinite sequence of Poulet numbers.

**Category:** Number Theory

[623] **viXra:1403.0942 [pdf]**
*submitted on 2014-03-26 15:36:59*

**Authors:** A.Garcés Doz

**Comments:** 7 Pages.

Legendre’s conjecture, stated by Adrien-Marie Legendre ( 1752-1833 ), says there is always a prime between n2 and (n+1)2 . This conjecture is part of Landau’s problems. In this paper a proof of this conjecture is presented, using the method of generating prime numbers between consecutive squares, and proving that for every pair of consecutive squares with n >= 3 may be generated at least one prime number that belongs to the interval [n,(n+1)^2]

**Category:** Number Theory

[622] **viXra:1403.0939 [pdf]**
*submitted on 2014-03-26 07:30:09*

**Authors:** Raj C Thiagarajan

**Comments:** 5 Pages. An engineering proof to Beals Conjecture; This paper shows proof and highlights that finding a counter example is not possible due to the intrinsic nature of the equation which will have gcd greater than 1

In this paper, we provide computational results and a proof for Beal’s conjecture. We demonstrate that the common prime factor is intrinsic to this conjecture using the laws of powers. We show that the greatest common divisor is greater than 1 for the Beal’s conjecture.

**Category:** Number Theory

[621] **viXra:1403.0932 [pdf]**
*submitted on 2014-03-25 12:17:13*

**Authors:** Barar Stelian Liviu

**Comments:** 9 Pages.

the method of determining if a number is prime up to a given number .

**Category:** Number Theory

[620] **viXra:1403.0771 [pdf]**
*submitted on 2014-03-23 08:50:47*

**Authors:** Giuseppe Rauti

**Comments:** 1 Page.

A Proof.

**Category:** Number Theory

[619] **viXra:1403.0672 [pdf]**
*submitted on 2014-03-23 03:47:33*

**Authors:** Th. Guyer

**Comments:** 1 Page.

A + B = C
Rad(ABC) infinite < C
Number Example: 2*12p2 + 1 = 17p2

**Category:** Number Theory

[277] **viXra:1404.0036 [pdf]**
*replaced on 2014-04-07 10:44:57*

**Authors:** Giuseppe Rauti

**Comments:** 5 Pages.

A Proof of the Riemann Hypothesis.

**Category:** Number Theory

[276] **viXra:1403.0959 [pdf]**
*replaced on 2014-04-04 14:30:10*

**Authors:** Giuseppe Rauti

**Comments:** 5 Pages.

A Proof of the Riemann Hypothesis.

**Category:** Number Theory