Number Theory

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(10) - 1203(6) - 1204(8) - 1205(7) - 1206(6) - 1207(5) - 1208(5) - 1209(11) - 1210(14) - 1211(10) - 1212(4)
2013 - 1301(5) - 1302(10) - 1303(16) - 1304(15) - 1305(12) - 1306(12) - 1307(25) - 1308(11) - 1309(8) - 1310(13) - 1311(15) - 1312(21)
2014 - 1401(20) - 1402(10) - 1403(27) - 1404(10) - 1405(17) - 1406(20) - 1407(34) - 1408(52) - 1409(47) - 1410(17) - 1411(16) - 1412(18)
2015 - 1501(14) - 1502(14) - 1503(35) - 1504(23) - 1505(19) - 1506(13) - 1507(16) - 1508(15) - 1509(15) - 1510(13) - 1511(9) - 1512(26)
2016 - 1601(14) - 1602(18) - 1603(78) - 1604(56) - 1605(29) - 1606(19) - 1607(21)

Recent submissions

Any replacements are listed further down

[1291] viXra:1607.0536 [pdf] submitted on 2016-07-28 15:35:29

Formula for Twin Primes

Authors: José de Jesús Camacho Medina
Comments: 1 Page.

The present article shows an unpublished formula to evaluate twin primes, the formula is based on the theorem of Wilson and contains mathematical functions such that greatest common divisor, factorial and floor function.
Category: Number Theory

[1290] viXra:1607.0522 [pdf] submitted on 2016-07-27 10:29:42

On Finding All Solutions to the Lemoine - Levy Problem

Authors: Matilda Walter
Comments: 3 Pages.

Lemoine - Levy Conjecture, probably the least known of the 'Goldbach Conjectures', states that every positive odd integer > 5 is a sum of a prime and double of a prime. We present a simple sieve procedure for finding all existing solutions to the problem for any given odd number > 5.
Category: Number Theory

[1289] viXra:1607.0468 [pdf] submitted on 2016-07-25 01:02:22

On a Possible Generalization of Fermat’s Last Theorem

Authors: Dhananjay P. Mehendale
Comments: 3 Pages

This paper proposes a generalised ABC conjecture and assuming its validity settles a generalised version of Fermat’s last theorem.
Category: Number Theory

[1288] viXra:1607.0437 [pdf] submitted on 2016-07-23 12:06:52

Infinite Arctangent Sums Involving Fibonacci and Lucas Numbers

Authors: Kunle Adegoke
Comments: 15 Pages.

Using a straightforward elementary approach, we derive numerous infinite arctangent summation formulas involving Fibonacci and Lucas numbers. While most of the results obtained are new, a couple of celebrated results appear as particular cases of the more general formulas derived here.
Category: Number Theory

[1287] viXra:1607.0434 [pdf] submitted on 2016-07-23 12:24:01

Challenge "Proof of the Lehman Expectation".

Authors: Terubumi Honjou
Comments: 7 Pages.

Chapter12. Challenge "proof of the Lehman expectation". A mathematics difficult problem biggest in history. [1] With the mathematics difficult problem "proof of the Lehman expectation" biggest in history. [2] I challenge the difficult problem Lehman expectation that rejected the geniuses challenge for 150 years. [3] It is challenged the mystery of the prime number, a mathematics difficult problem biggest in history, proof of the Lehman expectation. [4] Neology of the Lehman expectation. A point of intersection that all 0 points are straight. [5] An elementary particle pulsation principle founds a door of the Lehman expected proof.
Category: Number Theory

[1286] viXra:1607.0400 [pdf] submitted on 2016-07-21 22:44:27

Is Dirichlet's Proof of Fermat's Last Theorem for N = 5 Flawed

Authors: Quang Nguyen Van
Comments: 3 Pages.

We give an illogical point in Dirichlet's proof, therefore the used infininite descent is not powered in his proof
Category: Number Theory

[1285] viXra:1607.0381 [pdf] submitted on 2016-07-20 11:59:45

Interesting Facts Concerning Prime Products and Their Relationship to Lorentz-Like Transformations

Authors: Peter Bissonnet
Comments: 10 Pages.

Prime products are analyzed from various points of view, with an emphasis on graphical representation and analysis. A prime product N is determined to have two integer coordinates D and m. These coordinates are related to the solutions of a parabola, as well as to right triangles, in what the author calls a ‘backbone - rib’ representation. A prime number or a prime product fall on three dimensional helices, which can be represented in two dimensions as sets of parallel lines. If a prime or a prime product can be represented by 6s - 1, then helix 1 or H1 is designated; if a prime or a prime product can be represented by 6s + 1, then helix 2 or H2 is designated. The integer s is really a composite number, which can be represented as s = r + n, where r is the row number and n is the grouping number called the complex number, both determined from the two dimensional representation of the double helices. It is also discovered that, due to the mathematical form relating N to D and m, that there must be Lorentz - like transformations between N, D, and m and a new set Nʹ, Dʹ and mʹ; however, the concept of velocity and the speed of light seem out of place in this instance. Nevertheless, the question is asked as to whether or not prime products can be considered to be away to unite relativity and quantum mechanics, which also depends upon integers in a large measure.
Category: Number Theory

[1284] viXra:1607.0360 [pdf] submitted on 2016-07-18 13:58:50

Proof Bill Hypothesis a Consequence of the Properties of Invariant Identity of a Certain Type (Elementary Aspect)

Authors: Reuven Tint
Comments: 13 Pages. Original written in Russian

A variant of the solution with the help of Bill hypothesis direct evidence "Great" Fermat's theorem elementary methods rows. New are "invariant identity" (keyword) and obtained by us in the text, the identity of the work, which allowed directly to solve the FLT, and several others.
Category: Number Theory

[1283] viXra:1607.0359 [pdf] submitted on 2016-07-18 15:28:12

On Finding All Solutions to the Goldbach Probem for 2N

Authors: Matilda Walter
Comments: 2 Pages.

We present a simple sieve algorithm for finding all existing solutions to the binary Goldbach problem for a given even number 2N > 4.
Category: Number Theory

[1282] viXra:1607.0178 [pdf] submitted on 2016-07-15 06:08:08

Divide Beal’s Conjecture into Several Parts Gradually to Prove the Beal’s Conjecture

Authors: Zhang Tianshu
Comments: 25 Pages.

In this article, we first classify A, B and C according to their respective odevity, and thereby get rid of two kinds from AX+BY=CZ. Then, affirmed AX+BY=CZ in which case A, B and C have at least a common prime factor by several concrete equalities. After that, proved AX+BY≠CZ in which case A, B and C have not any common prime factor by mathematical induction with the aid of the symmetric relations of positive odd numbers concerned after divide the inequality in four. Finally, reached a conclusion that the Beal’s conjecture holds water via the comparison between AX+BY=CZ and AX+BY≠CZ under the given requirements.
Category: Number Theory

[1281] viXra:1607.0161 [pdf] submitted on 2016-07-12 19:35:56

Version of Proof of the Fermat's Last Theorem

Authors: Michael Pogorsky
Comments: 7 Pages.

The theorem is proved by means of general algebra. The proof is based on set of polynomials a=uwv+v^n; b=uwv+w^n; c=uwv+v^n+w^n and their modifications deduced as required for a,b,c to meet condition of being integers and to satisfy equation a^n+b^n=c^n. The equation also requires existence of positive integers u_p and c_p such that a+b is divisible by u_p^n and c is divisible by u_p c_p. Then the contradiction revealed between expressed by deduced polynomials a^n+b^n and c^n.
Category: Number Theory

[1280] viXra:1607.0159 [pdf] submitted on 2016-07-13 11:11:18

Checking if a Number is Prime

Authors: Maaninou Youssef
Comments: 1 Page.

by this theory you can chek any number if it is a prime or not also you can generat a new prime number
Category: Number Theory

[1279] viXra:1607.0095 [pdf] submitted on 2016-07-07 16:22:11

Mathworld, Entry to ”Finite Difference” Powered by Wolfram

Authors: Kolosov Petro
Comments: 2 Pages.

The basic and short description of proposed entry to Wolfram MathWorld, Finite Difference, starting from line ”An n-th power has a constant nth finite difference. For example, take n=3 and make a difference table”. The entry appears to to wide the properties of high order difference of n-th power.
Category: Number Theory

[1278] viXra:1607.0094 [pdf] submitted on 2016-07-07 16:24:21

Wolfram Mathworld, Entry to ”Power”

Authors: Kolosov Petro
Comments: 2 Pages.

The basic and short description of proposed entry to Wolfram MathWorld, ”Power”, properties section. The entry appears to connect the high order finite difference and derivative of Power function.
Category: Number Theory

[1277] viXra:1607.0093 [pdf] submitted on 2016-07-07 16:26:41

Series Representation of Power Function (Version 3)

Authors: Kolosov Petro
Comments: 12 Pages.

This paper presents the way to make expansion for the next form function: y = x n , ∀(x,n) ∈ N to the numerical series. The most widely used methods to solve this problem are Newton’s Binomial Theorem and Fundamental Theorem of Calculus (that is, derivative and integral are inverse operators). The paper provides the other kind of solution, except above described theorems.
Category: Number Theory

[1276] viXra:1607.0087 [pdf] submitted on 2016-07-07 12:02:36

Induction and Analogy in a Problem of Finite Sums

Authors: Ryan Zielinski
Comments: 81 Pages. This work is licensed under the CC BY 4.0, a Creative Commons Attribution License.

What is a general expression for the sum of the first n integers, each raised to the mth power, where m is a positive integer? Answering this question will be the aim of the paper....We will take the unorthodox approach of presenting the material from the point of view of someone who is trying to solve the problem himself. Keywords: analogy, Johann Faulhaber, finite sums, heuristics, inductive reasoning, number theory, George Polya, problem solving, teaching of mathematics.
Category: Number Theory

[1275] viXra:1607.0072 [pdf] submitted on 2016-07-07 03:56:39

The Disappointment of the Riemann Hypothesis

Authors: Korn Rakpradit
Comments: 47 Pages.

The opinions of this work are stalking and proving in details the derivation of Riemann Zeta Function and Riemann Hypothesis, which Riemann did roughly for more than 150 years ago without proof, and correcting all mistakes about the boundaries of the integrals and the undefined or divergent functional equations which caused very big problems to this Riemann Hypothesis. Proof or disproof of Riemann Hypothesis’s derivation will be very useful for mathematicians and physicists because it is widespread in use though it is unproved officially for a long time.
Category: Number Theory

[1274] viXra:1607.0058 [pdf] submitted on 2016-07-06 02:42:43

General Proof for Irrationality of Infinite Sums Based on Fourier's Proof

Authors: Tomer Shushi
Comments: 4 Pages.

In this paper we give a general proof for the irrationality property of numbers which take a certain form of infinite sums. As special cases we prove the irrationality of infinite sums involving pi and e constants. This proof is obtained in the spirit of the well known Fourier's proof for the irrationality of e.
Category: Number Theory

[1273] viXra:1607.0047 [pdf] submitted on 2016-07-04 21:15:33

The Half Proof of the Gilbreath’s Onjeture

Authors: T.Nakashima
Comments: 1 Page.

The half proof of the Gilbreath’s onjeture
Category: Number Theory

[1272] viXra:1607.0029 [pdf] submitted on 2016-07-03 05:30:52

The Origin of the Frey Elliptic Curve in a Too Narrow Margin.

Authors: Andrea OSSICINI
Comments: 16 Pages.

It is shown that an appropriate use of so-called << double equations >> by Diophantus provides the origin of the Frey elliptic curve and from it we can deduce an elementary proof of Fermat’s Last Theorem
Category: Number Theory

[1271] viXra:1607.0003 [pdf] submitted on 2016-07-01 03:27:48

Goldbach and Twin Prime Conjectures Implied by Strong Goldbach Number Sequence

Authors: Pingyuan Zhou
Comments: 13 Pages. If so-called strong Goldbach number sequence introduced in this paper is acceptable then the existence of strong Goldbach number sequence will imply both Goldbach and twin prime conjectures.

Abstract: In this note, we present a new and direct appraoch to prove the Goldbach conjecture that if the existence of the limit of (P) = NSGL/2P as P approaches infinity being 1/2 can be confirmed by asymptotic result arising from large-scale observation data for status of (P) then the Goldbach conjecture is true, where P is a prime greater than 3 but NSGL and 2P are separately the largest strong Goldbach number and the largest Goldbach number generated by P. Further, the existence of the limit also implies the twin prime conjecture by means of the existence of good approximate function form to 2(A) such as our introduced C2/A(1/2) as an attempt, which tends to lower order infinitesimal as 1/A approaches infinitesimal, where A = NSGL-P but 2(A) is the density of strong Goldbach numbers generated by distinct twin prime pairs (p,p+2) among all strong Goldbach numbers from P+1 to P+A and C2 is the twin prime constant in the first Hardy-Littlewood conjecture.
Category: Number Theory

[1270] viXra:1606.0345 [pdf] submitted on 2016-06-30 11:00:58

A Polynomial Recursion for Prime Constellations

Authors: Scott B. Guthery
Comments: 8 Pages.

An algorithm for recursively generating the sequence of solutions of a prime constellation is described. The algorithm is based on an polynomial equation formed from the first n elements of the constellation. A root of this equation is the next element of the sequence.
Category: Number Theory

[1269] viXra:1606.0327 [pdf] submitted on 2016-06-29 07:46:25

The Logic of the Prime Numbers

Authors: Mohamed Ouiter
Comments: 7 Pages.

From the definition that a number is Prime if he admits that two dividers and any number not prime can it write as a product of prime factors, I was able to identify a simple law that governs the distribution of prime numbers.
Category: Number Theory

[1268] viXra:1606.0310 [pdf] submitted on 2016-06-28 09:09:00

Do Prime Numbers Obey a Three Dimensional Double Helix?

Authors: Peter Bissonnet
Comments: 14 Pages.

When a subset of sequential integers is arranged in a specific way, there appears a paired set of slanted straight lines along which prime numbers seem to naturally arrange themselves in a repeated fashion. This arrangement can further be observed to be a two dimensional surface applicable to the cylinder. If this arrangement is on a piece of paper, then one can fold the paper in the form of a cylinder, and the paired set of slanted straight lines unite at the page edges to form a double helix winding down the cylinder. Paired primes are thus seen to be an association between primes residing on these two paired helixes, and further analysis shows that there appears to be two types of paired primes. Is the prime number double helix nature’s secret for jump starting life (DNA) and thereby defeating entropy (at least in the initial stage) by creating order from order instead of order from disorder? The prime number trends examined exhibit right handed chirality; left handed chirality is obtained by symmetry considerations.
Category: Number Theory

[1267] viXra:1606.0306 [pdf] submitted on 2016-06-28 09:30:16

An Investigation into Reducing a Prime Product From Two Seemingly Independent Variables to Only One Independent Variable

Authors: Peter Bissonnet
Comments: 2 Pages. This is a Russian journal named "Almanac of Modern Science and Education" and can be found at the following link: http://www.gramota.net/eng/editions/5.html

This very short paper illustrates a mathematical method which illustrates the possibility of reducing a prime product (N = PQ) from two independent variables, namely the two original prime numbers P and Q, to only one independent variable which determines both prime numbers.
Category: Number Theory

[1266] viXra:1606.0302 [pdf] submitted on 2016-06-27 21:24:29

The Reration of Recurring Decimal and Primitive Root

Authors: T.Nakashima
Comments: 1 Page.

reration of recurring decimal and primitive root
Category: Number Theory

[1265] viXra:1606.0271 [pdf] submitted on 2016-06-25 20:21:56

Affirmative Resolve of Conway’s Problem

Authors: T.Nakashima
Comments: 1 Page.

Conway’s problem is correct.
Category: Number Theory

[1264] viXra:1606.0264 [pdf] submitted on 2016-06-24 20:45:44

Affirmative Resolve of Legendre’s Conjecture

Authors: T.Nakashima
Comments: 2 Pages.

Near m,the destance of primes is lower order than logm.This is the Legendre’s conjecture.
Category: Number Theory

Replacements of recent Submissions

[581] viXra:1607.0359 [pdf] replaced on 2016-07-20 07:41:06

On Finding All Solutions to the Goldbach Problem for 2N

Authors: Matilda Walter
Comments: 2 Pages.

We present a simple sieve algorithm for finding all existing solutions to the binary Goldbach problem for a given even number 2N > 4.
Category: Number Theory

[580] viXra:1607.0087 [pdf] replaced on 2016-07-25 10:05:25

Induction and Analogy in a Problem of Finite Sums

Authors: Ryan Zielinski
Comments: 84 Pages. This work is licensed under the CC BY 4.0, a Creative Commons Attribution License.

What is a general expression for the sum of the first n integers, each raised to the mth power, where m is a positive integer? Answering this question will be the aim of the paper....We will take the unorthodox approach of presenting the material from the point of view of someone who is trying to solve the problem himself. Keywords: analogy, Johann Faulhaber, finite sums, heuristics, inductive reasoning, number theory, George Polya, problem solving, teaching of mathematics.
Category: Number Theory

[579] viXra:1607.0072 [pdf] replaced on 2016-07-15 07:54:41

The Disappointment of the Riemann Hypothesis

Authors: Korn Rakpradit
Comments: 47 Pages.

The opinions of this work are revising, stalking and proving in details the derivation of Riemann Zeta Function and Riemann Hypothesis, which Riemann did roughly for more than 150 years ago without proof, and correcting all mistakes about the boundaries of the integrals that was found and those undefined (and/or multiplied by zero) functional equations which caused very big problems to this Riemann Hypothesis. Proof or disproof of Riemann Hypothesis’s derivation will be very useful for many mathematicians and physicists nowadays because the Hypothesis is widely used in many subjects and works, unaware of risks, thought it is not officially proved right or wrong.
Category: Number Theory

[578] viXra:1607.0072 [pdf] replaced on 2016-07-08 11:10:23

The Disappointment of the Riemann Hypothesis

Authors: Korn Rakpradit
Comments: 48 Pages.

The opinions of this work are stalking and proving in details the derivation of Riemann Zeta Function and Riemann Hypothesis, which Riemann did roughly for more than 150 years ago without proof, and correcting all mistakes about the boundaries of the integrals and the undefined or divergent functional equations which caused very big problems to this Riemann Hypothesis. Proof or disproof of Riemann Hypothesis’s derivation will be very useful for mathematicians and physicists because it is widespread in use though it is unproved officially for a long time.
Category: Number Theory

[577] viXra:1607.0047 [pdf] replaced on 2016-07-27 04:35:14

The Half Proof of the Gilbreath’s Onjeture

Authors: T.Nakashima
Comments: 1 Page.

The half proof of the Gilbreath’s onjeture
Category: Number Theory

[576] viXra:1606.0302 [pdf] replaced on 2016-07-21 20:07:29

The Reration of Recurring Decimal and Primitive Root

Authors: T.Nakashima
Comments: 2 Pages.

reration of recurring decimal and primitive root
Category: Number Theory