viXra.org > Number Theory
Abstracts Authors Papers Full Site
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(1)
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(2) - 1110(5) - 1111(4) - 1112(4)
2012 - 1201(2) - 1202(7) - 1203(6) - 1204(6) - 1205(7) - 1206(6) - 1207(5) - 1208(5) - 1209(11) - 1210(14) - 1211(10) - 1212(4)
2013 - 1301(5) - 1302(9) - 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(26) - 1404(10) - 1405(17) - 1406(19) - 1407(33) - 1408(50) - 1409(47) - 1410(16) - 1411(16) - 1412(18)
2015 - 1501(14) - 1502(14) - 1503(33) - 1504(23) - 1505(18) - 1506(12) - 1507(15) - 1508(14) - 1509(13) - 1510(11) - 1511(9) - 1512(25)
2019 - 1901(12) - 1902(11) - 1903(21) - 1904(25) - 1905(23) - 1906(45) - 1907(20)
Any replacements are listed farther down
[2063] viXra:1907.0288 [pdf] submitted on 2019-07-15 08:52:01
Disproof of the Riemann Hypothesis, Long Version
Authors: Igor Hrnčić
Comments: 29 Pages.
In this manuscript we use the Perron formula to connect zeta evaluated on the root free halfplane to zeta evaluated on the critical strip. This is possible since the Perron formula is of the form f(s)=O f(s+w) with O being an integral operator. The variable s+w is on the root free halfplane, and yet s can be on the critical strip. Hence, the Perron formula serves as a form of a functional equation that connects the critical strip with the root free halfplane. Then, one simply notices that in the Perron formula, the left hand side converges only conditionally, whilst the right hand side converges absolutely. This, of course, cannot be, since the left side of an equation is always equal to the right side. This contradiction when examined in detail disproves the Riemann hypothesis. This method is employed on an arbitrary distribution of zeta roots as well, concluding that zeta has a root arbitrarily close to the vertical line passing through unity.
Category: Number Theory
A Proof of Goldbach's Strong Conjecture
Authors: Sitangsu Maitra
Comments: 2 page
Proof of Goldbach's strong conjecture by unique path in a prime selection system.
The Abc Conjecture as Expansion of Powers of Binomials
Authors: Kamal Barghout
Comments: 5 Pages. The manuscript is not to be copied or used in whole or part. The manuscript is copyrighted.
In this note I will show how Beal's conjecture can be used to study abc conjecture. I will first show how Beal's conjecture was proved and derive the necessary steps that will lead to further understand the abc conjecture hoping this will aid in proving it. In short, Beal's conjecture was identified as a univariate Diophantine polynomial identity derived from the binomial identity by expansion of powers of binomials, e.g. the binomial〖 (λx^l+γy^l )〗^n; λ,γ,l,n are positive integers. The idea is that upon expansion and reduction to two terms we can cancel the gcd from the identity equation which leaves the coefficient terms coprime and effectively describes the abc conjecture. To further study the abc terms we need to specifically look for criterion upon which the general property of abc conjecture that states that if the two numbers a and b of the conjecture are divisible by large powers of small primes, a+b tends to be divisible by small powers of large primes which leads to a+b be divisible by large powers of small primes. In this note I only open the door to investigate related possible criterions that may lead to further understand the abc conjecture by expressing it in terms of binomial expansions as Beal's conjecture was handled.
On Non-Trivial Zero Point
Authors: Toshiro Takami
In the Riemann zeta function, when the value of the nontrivial zero is zero, the value of the real part of the function is negative from 0 to 0.5, but the value of the real part of the function is 0.5 to 1 I found it to be positive. We also found that the positive and negative of the imaginary part also interchanged with the real part 0.5. This tendency is seen as a tendency near the non-trivial zero value, but becomes less and less as it deviates from the non-trivial zero value. We present and discuss the case of four non-trivial zero values. This seems to be an important finding and will be announced here.
Algorithms for Testing Prime Factors Against Positive Composite Numbers (Finding the Unique Factorization Domain for Said Composite Numbers) in Base 10: a First Course Into Formal Mathematics
Authors: Labib Zakaria
Comments: 12 Pages. Hopefully this is obvious from the abstract & a quick overview of the paper, but this is not meant to be an immensely technical paper. It is simply meant to be so that people can nurture an appreciation for math. Constructive criticism appreciated.
There exist many algorithms to test the primality of positive natural numbers both proved and unproved, as well as in base 10 and outside base 10. Once the primality of a number has been determined, natural questions are $(1)$ what the unique prime factors of it are and $(2)$ their degree, according to the fundamental theorem of arithmetic. These questions can prove to be useful in beginning to analyze the properties of the number by allowing us to determine the number of (proper) divisors of a number as well as their sum and product. In regards to $(1)$, there are many algorithms that could be applied to determine these prime factors through modular arithmetic algorithms. We will be tackling this question in base 10 specifically by constructing functions as curious mathematicians.
Proof of Riemann Hypothesis and Other Prime Conjectures
Authors: Surajit Ghosh
Riemann hypothesis stands proved in three different ways.To prove Riemann hypothesis from the functional equation concept of Delta function is introduced similar to Gamma and Pi function. Zeta values are renormalised to remove the poles of zeta function. Extending sum to product rule fundamental formula of numbers are defined which then helps proving other prime conjectures namely goldbach conjecture, twin prime conjecture etc.
A Concise Paper Summarizing a Contradiction with the Riemann Hypothesis
Authors: Viktor Kalaj
Comments: 10 Pages. This paper is rather succinct; it deals with a contradiction while testing the Riemann Zeta function valid on 0 < Re(s) < 1
In this paper, we summarize results of a contradiction while testing the Riemann Hypothesis
Collatz Conjecture Partially Proven. no Loops and Infinite Ascent Unlikely.
Authors: Darrin Taylor
Comments: Pages.
In base 3, the presence of leading 1s during division has a one to one correlation with the 3n+1 operation. This is because dividing a leading 1 in base 3 is the only way to lose a digit and 3n+1 shifts are the only way to gain a digit. Total digit length doesn't change around a loop so they must equal each other. Because the leading 1 pattern among a series of divides only has 2 segments either 1->2 or 1->2->1 there are a limited number of patterns that can make up a loop. Naming 1->2->(next segments leading 1) as segment A Naming 1->2->1->(next segments leading 1) as segment B We can see that A is 2 divides and 1 non localized shift while B is 3 divides and 2 non localized shifts. The pattern ABB...ABB descends because 8 divides and 5 shifts descends for numbers larger than 1000 and lower then 1000 have been numerically disqualified previously. So the sequence BBB must exist at least once in every loop. BBB implies ABBB or BBBB if BBBB then "expel" a B which ascends and keep searching for the segment before the sequence. Once ABBB is found this implies AABBB or BABBB and AABBB is disproven as not possible. Once BABBB is known this implies ABABBB or BBABBB and ABABBB is disproven. Once BBABBB is known this implies ABBABBB or BBBABBB and ABBABBB is disproven. Once BBBABBB is found we can "expel" ABBB which ascends and BBB(ABBB) becomes BBB and we are back where we started. Once the entire loop has been traversed this way the sequence has expelled only (B) or (ABBB) and the remaining sequence is BBB and all of these ascend. Loops must have ascending and descending segments for a total non ascending and non descending but this loop always ascends. Thus it cannot be a loop and no loops of As and Bs can exist as those with fewer Bs than ABBABBABB…..always descend and adding a single B makes it always ascend. And As and Bs are the only possible segments to add.
Fermat's Last Theorem. Unified Method (Russian)
Authors: Victor Sorokine
Comments: 4 Pages.
В ПЕРВОМ СЛУЧАЕ каждое число (А) заменяется на сумму (A'+A°n) последней цифры и остатка. После раскрытия биномов в равенстве Ферма все члены объединятся в два слагаемых: E=A'^n+B'^n-C'^n с третьей цифрой E''', которая в одном из n-1 эквивалентных равенств Ферма равна 2, и остаток D с третьей цифрой D''', равной либо 0, либо n-1, и, следовательно, третья цифра в числе A^n+B^n-C^n не равна 0. ВО ВТОРОМ СЛУЧАЕ (например A=A°n^k, но (BС)'≠0, ) после преобразования 3kn-значного окончания числа B в 1 и оставления в числах А, В, С лишь последних значащих цифр простейшие расчёты показывают, что (3kn-2)-я цифра числа A^n+B^n-C^n нулю не равна и не меняется после восстановления всех остальных цифр в числах A, B, C, т.к. является функцией только последней цифры числа A°.
Pi, the Primes and the Lambert Function
Authors: Simon Plouffe
Conference in Montreal, Canada to be held on July 17 2019. The subject is Pi , the prime numbers and the Lambert W function
A Technical Procedure for the Riemann Hypothesis
Comments: 11 Pages. Notify me, the author, Viktor Kalaj, if this paper is in anyway difficult to read by the print (font, size, etc.)
This paper deals with a proposed contradiction to the Riemann Hypothesis. We see by a deductive approach the necessity of no zeroes for the entire critical strip, including for the critical line.
A Minor Typographical Error in Paper "A Technical Procedure for the Riemann Hypothesis"
Comments: 1 Page. Minor typo correction in my paper "A technical procedure for the Riemann Hypothesis".
There was a minor typographical error in my paper entitled "A technical procedure for the Riemann Hypothesis". It does not affect the technical procedure of the paper.
An Minor Typographical Correction to Paper Riemann Hypothesis
Comments: A minor typographical correction to my 11-page paper
I made a typographical error that is now corrected. There is no change in the flow of the paper entitled "A technical procedure for the Riemann Hypothesis".
Proof of Riemann Hypothesis (Final)
Comments: 5 Pages. Riemann's hypothesis really proved.
In my previous paper "Consideration of the Riemann hypothesis" c=0.5 and x is non- trivial zero value, and it was described that it converges to almost 0, but a serious proof in mathematical expression could not be obtained. In this paper, we give a proof of mathematical expression. "the non-trivial zero values of all positive infinity and negative infinity lie on the real value 0.5" I am here mathematically proved.
Polynomials of the Form P_n^{(a)}(x)=(1/2)*((x-Sqrt{x^2+a})^n+(x+sqrt{x^2+a})^n) and Primality Testing
Authors: Predrag Terzic
General,deterministic,unconditional,polynomial time primality test is introduced.
Decomposition of Integer Powers of a Mersenne Number Into Binomial Coefficients
Authors: Http://vixra.org/author/andrew_w_ivashenko
Comments: 1 Page.
Integrals - Identities - Pi
Authors: Edgar Valdebenito
We give some integrals for Pi.
Two Identities
This note presents two identities for Pi.
Disproof of the Riemann Hypothesis
In my previous paper "Consideration of the Riemann hypothesis" c=0.5 and x is non- trivial zero value, and it was described that it converges to almost 0, but a serious proof in mathematical expression could not be obtained. It is impossible to make c = 0.5 exactly like this. c can only be 0.5 and its edge. It is considered that "when the imaginary value increases to infinity, the denominator of the number becomes infinity and shifts from 0.5 to 0".
Jounrée de pi , 25 Avril 2019
Une revue historique du nombre Pi faite à l'IUT de Nantes. A presentation of Pi made at Université de Nantes (IUT) on April 25 2019.
Akalabu Emmanuel's Proof of Fermat's Last Theorem
Authors: Akalabu, Emmanuel Chukwuemeka
Les Nombres Premiers, Les Zéros de la Fonction ζ et la Fonction W de Lambert
Un nouveau modèle est proposé pour représenter ces quantités. En premier lieu, 4 formules sont données qui sont déduites des résultats classiques, ensuite un principe est appliqué, appelé matriochkas ou des poupées russes qui permet de trouver des développements asymptotiques remarquablement simples et élégants. De plus, les développements obtenus sont tous très similaires. A new model is proposed to represent these quantities. In the first place, 4 formulas are given which are deduced from the classical results, then a principle is applied, called matriochkas or Russian dolls which allows to find remarkably simple and elegant asymptotic expansions. Moreover, the developments obtained are all very similar.
Oppermann Conjecture
Authors: Xuan Zhong Ni
In this article, we use the sieve of Eratosthenes to prove the Oppermann Conjecture.
Periodic Biotope Spaces
Authors: Oksana Vozniuk, Bogdana Oliynyk, Roman Yavorskyi
Comments: 5 Pages. Text in Ukrainian. Mohyla Mathematical Journal, Vol 1 (2018) http://mmj.ukma.edu.ua/article/view/152597
iotope spaces were introduced by Marchevsky-Steinhaus in for the needs of mathematical biology, namely the study of ecosystems. Biotope distance is defined on the set of all subsets of some finite set X. The distance between any subsets A1 and A2 of X is calculated by the rule: d(A1, A2) = (0, if A1 = A2 = ∅; |A1⊕A2| |A1∪A2| , if A1, A2 ∈ B(X)).We introduce a new generalization of a biotope metric to the infinite case using supernatural or Steinitz numbers. A supernatural number (or Steinitz number) is an infinite formal product of the form Y p∈P p kp where P is the set of all primes and kp ∈ N ∪ {0, ∞}. On the set of all periodic {0, 1}-sequences with the period that is a divisor of some supernatural u; we define the metric dB for any infinite periodic sequences x¯ and y¯ by the rule: dB(¯x, y¯) = dBn (¯xn, y¯n) where n is a common period of periodic sequences x¯ and y¯, and the formula dB(¯xn, y¯n) denotes the biotope distance between the first n coordinates of sequences x¯ and y¯ in the finite biotope metric space Bn. We denote the periodic biotope space that is defined by some Steinitz number u as B(u). If u is a finite Steinitz number, i.e. u is a positive integer, then B(u) is isometric finite biotope space Bu. We also prove that the introduced metric between such two periodic sequences does not depend on a choice of a common period. A family of such introduced periodic biotope spaces is naturally parametrized by supernatural numbers. More precisely, the family of these spaces forms a lattice that is isomorphic to the lattice of supernatural numbers. Moreover, each of these spaces B(u) is invariant with respect to the shift. We prove that the diametr of any periodic biotope space equals 1. We also show that any finite subset of a countable biotope space introduced in is isometric embedding in the periodic biotope space B(u) for any u.
Solutions to Erdos-Straus Conjecture
Authors: Nurlan Qasimli
History of conjecture
Dottie Number: a Simple Remark
This note presents a simple formula for Pi.
Finding The Hamiltonian
Authors: H. Tran
Comments: 12 Pages. Proof of the Riemann hypothesis
We first find a Hamiltonian H that has the Hurwitz zeta functions ζ(s,x) as eigenfunctions. Then we continue constructing an operator G that is self-adjoint, with appropriate boundary conditions. We will find that the ζ(s,x)-functions do not meet these boundary conditions, except for the ones where s is a nontrivial zero of the Riemann zeta, with the real part of s being greater than 1/2. Finally, we find that these exceptional functions cannot exist, proving the Riemann hypothesis, that all nontrivial zeros have real part equal to 1/2.
Can the Collatz Conjecture be Proven
Authors: James Edwin Rock
We look at items that appear to be essential elements in a proof of the Collatz Conjecture. Details are available in the Collatz Conjecture Proof. http://vixra.org/pdf/1901.0227v9.pdf
Goldbach Conjecture
In this article, we use method of a modified sieve of Eratosthenes to prove that any large even numbers can always be expressed as sums of two prime numbers.
Cousin Prime Conjecture
In this article, we use method of a modified sieve of Eratosthenes to prove the cousin prime conjecture.
Irrationality
Authors: Israel Meireles Chrisostomo
Mostre que o seno de um arco na forma 1/p, com p inteiro, resulta em um irracional. Observe que
Irrationality and pi
Title, authors and abstract should also be included in the PdF file. These should be in English. If the submission is not in English please translate the title and abstract here.
Prime Gap near a Primorial Number
In this article, we use method of sieve of Eratosthenes to prove that there is a larger prime gap near any primorial number.
Irrationality and pi Other Transformation
Comments: 2 Pages. irrationality and pi other transformation
irrationality and pi other transformationirrationality and pi other transformationirrationality and pi other transformationirrationality and pi other transformation
Infinite Number of Lucas Primes
Authors: Pedro Hugo García Peláez
What I try to prove is that there are infinite number of Lucas primes
Can Pi, i, and e Generate the Real Numbers
We show that attempting to map the set of real numbers to the natural numbers by listing them as infinite decimal fractions is futile. The real numbers are represented as the limit of partial decimal sums. This allows them to be explicitly referenced and makes them into a countable set. We conjecture that the Pi, i, and e generate the Real Numbers.
The Inconsistency of Arithmetic – Expressed by a Sum
Authors: Ralf Wüsthofen
Comments: 2 Pages. Proof of the Goldbach conjecture on http://vixra.org/abs/1702.0300
Based on a strengthened form of the strong Goldbach conjecture, this paper presents an antinomy within the Peano arithmetic (PA). We derive two contradictory statements by using the same main instrument as in the proof of the conjecture, that is, a structuring of the natural numbers starting from 3.
Twin Prime Conjecture
In this article, we use a modified sieve of Eratosthenes to prove twin prime conjecture.
Zero Points of Riemann Zeta Function
In this article, we assume that the Riemann Zeta Function equals to the Euler product at the non zero points of the Riemann Zeta function. From this assumption we can prove that there are no zero points of Riemann Zeta function, ς(s) in Re(s) > 1/2. We applied proof by contradiction.
A Simple Proof for Catalan's Conjecture
Authors: Julian TP Beauchamp
Catalan's Conjecture was first made by Belgian mathematician Eugène Charles Catalan in 1844, and states that 8 and 9 (2^3 and 3^2) are the only consecutive powers, excluding 0 and 1. That is to say, that the only solution in the natural numbers of a^x - b^y=1 for a,b,x,y > 1 is a=3, x=2, b=2, y=3. In other words, Catalan conjectured that 3^2-2^3=1 is the only nontrivial solution. It was finally proved in 2002 by number theorist Preda Mihailescu making extensive use of the theory of cyclotomic fields and Galois modules.
Algèbre D'appell
Authors: Méhdi Pascal
The bute of this algebra is to give a tool which makes it possible to find new formulas for the sequences of the numbers, for example, I take the numbers of Bernoulli (Bn), and the numbers of Fibonacci (Fn), and this algebra allows us the following formula: n*F(n)=sum(binomial(n,j)*(F(2n-2j+1)-F(n-j+1))*B(j)), From j=0 to j=n.
An Anomaly in the set of Complex Numbers
We exploit some rudimentary facts about the number one: (-1)(-1) = 1, 1 = sqrt(1 squared), and 1 squared = 1 to show an anomaly in the set of Complex Numbers.
Primality Test with Fibonacci Numbers
All prime numbers are represented as factors of Fibonacci numbers, following a relationship with the corresponding Fibonacci number index.
Maximum First Open Numbers and Goldbach's Conjecture
Authors: Sally Myers Moite
For a fixed last prime, sieve the positive integers as follows. For every prime up to and including that last prime, choose one arbitrary remainder and its negative. Sieve the positive integers by eliminating all numbers congruent to the chosen remainders modulo their prime. Consider the maximum of the first open numbers left by all such sieves for a particular last prime. Computations for small last primes support a conjecture that the maximum first open number is less than (last prime)^1.75. If this conjecture could be proved, it would imply Goldbach's Theorem is true.
Is there an Order in the Distribution of Prime Numbers?
Authors: Silvio Gabbianelli
By arranging the prime numbers on four columns ten-to-ten (columns of one, three, seven, nine) and establishing a suitable correspondence between the quadruples obtained and the numbers between zero and fifteen, we obtain a synthetic representation of them which allows to establish that the order in the distribution of prime numbers among positive natural numbers is not random.
Speed and Measure Theorems Related to the Lonely Runner Conjecture
Authors: David Rudisill
We prove an important new result on this problem: Given any epsilon > 0 and k >= 5, and given any set of speeds s_1 < s_2 < ... < s_k, there is a set of speeds v_1 < v_2 < ... < v_k for which the lonely runner conjecture is true and for which |s_i - v_i| < epsilon. We also prove some measure theorems.
Some Diophantine Approximation Problems Equivalent to the Lonely Runner Conjecture
We prove that the lonely runner conjecture is equivalent to a set of Diophantine approximation problems.
Covering Problems That Imply The Lonely Runner Conjecture
Authors: David v. Rudisill
We prove some measure and covering problems related to the lonely runner conjecture.
A Concise Proof for Beal's Conjecture
In this paper, we show how a^x - b^y can be expressed as a binomial expansion (to an indeterminate power, z, and use it as the basis for a proof for the Beal Conjecture.
Intimations of the Irrationality of Pi From Reflections of the Rational Root Test
Authors: Timothy W. Jones
The rational root test gives a means for determining if a root of a polynomial is rational. If none of the tests possible rational roots are roots, then if the roots are real, they must be irrational. Combining this observation with Taylor polynomials and the Taylor series for sin(x) gives an intimation that pi, and e, are likely irrational.
Properties of Data Sets that Conform to Benford's Law
Authors: Robert C. Hall
The concept and application of Benford's Law have been examined a lot in the last 10 years or so, especially with regard to accounting forensics. There have been many papers written as to why Benford's Law is so prevalent and the concomitant reasons why(proofs). There are, unfortunately, many misconceptions such as the newly coined phrase "the Summation theorem", which states that if a data set conforms to Benford's Law then the sum of all numbers that begin with a particular digit (1,2,3,4,5,6,7,8,9) should be equal. Such is usually not the case. For exponential functions (y=aexp(x) it is but not for most other functions. I will show as to why this is the case. The distribution tends to be a Benford instead of a Uniform distribution. Also, I will show that if the probability density function (pdf) of the logarithm of a data set begins and ends on the x axis and if the the values of the pdf between all integral powers of ten can be approximated with a straight line then the data set will tend to conform to Benford's Law.
A Simple Representation for pi
We recall a simple representation for Pi.
This paper disproves the Riemann hypothesis by generalizing the results from Titchmarsh's book The Theory of the Riemann Zeta-Function to rearrangements of conditionally convergent series that represent the reciprocal function of zeta. When one replaces the conditionally convergent series in Titchmarsh's theorems and consequent proofs by its rearrangements, the left hand sides of equations change, but the right hand sides remain invariant. This contradiction disproves the Riemann hypothesis.
Orduality vesus Flausible Falsifiability & Inference Criteria Explicated: None (All) is a Proof?
Authors: Arthur Shevenyonov
Comments: 8 Pages. bridging
Some testing criteria or decision-procedures, notably when deployed as part of automated proving vehicles, might pose more of an AI threat than they do in terms of an opportunity leverage. In particular, tautology, unless rethought, will likely prove just that--irrelevant and inefficient. Mochizuki's IUT, referred to for benchmarking and illustration purposes, may well bear fruit beyond ABC if shown to be Teichmueller legacy-invariant.
A Possible Solution to Gauss Circle Problem
Authors: Franco Sabino Stoianoff Lindstron
The method used in this article is based on analytical geometry, abstract algebra and number theory.
Partition Of The Primorial Square By Remainder Agreement Counts
For the n-th prime P, P# or P primorial is the product of all the primes up to and including P. Let (c, d) be a pair of integers that represents a point in the primorial square, 1 < c, d < P#. For each prime p, 2 < p < P, the remainders of c and d mod p may be the same, opposite (sum to a multiple of p) or neither. Count the number of remainders of (c, d) which have same, opposite or either agreement for any such P. This gives three partitions of the primorial square, by counts for same, opposite and either agreement. Polynomial multiplication is used to find the number of points in each part of these partitions.
Disproof of Twin Prime Conjecture
Authors: K.H.K. Geerasee Wijesuriya
A twin prime numbers are two prime numbers which have the difference of 2 exactly. In other words, twin primes is a pair of prime that has a prime gap of two. Sometimes the term twin prime is used for a pair of twin primes; an alternative name for this is prime twin or prime pair. Up to date there is no any valid proof/disproof for twin prime conjecture. Through this research paper, my attempt is to provide a valid disproof for twin prime conjecture.
El Algoritmo de Hugo Para Hallar el Máximo Común Divisor Fácilmente
Con este algoritmo podrás encontrar el máximo común divisor de dos polinomios o de números complejos y por supuesto también de números naturales de una manera fácil.
Hugo's Algorithm to Find the Greatest Common Divisor Easily
With this algorithm you can find the greatest common divisor of two polynomials or complex numbers and of course also natural numbers in an easy way.
A Survey Of The Riemann Zeta Function With Its Applications
Authors: Bertrand Wong
This paper explicates the Riemann hypothesis and proves its validity. [The paper is published in a journal of number theory.]
A New Proof of the ABC Conjecture
Authors: Abdelmajid Ben Hadj Salem
Comments: 7 Pages. Submitted to the Ramanujan Journal. Comments welcome.
In this paper, using the recent result that $c<rad(abc)^2$, we will give the proof of the $abc$ conjecture for $\epsilon \geq 1$, then for $\epsilon \in ]0,1[$. We choose the constant $K(\epsilon)$ as $K(\epsilon)=e^{\frac{1}{\epsilon^2} $. Some numerical examples are presented.
Denial of A.v. Shevenyonov's Proof for the Abc Conjecture
Authors: Colin James III
Comments: 2 Pages. © Copyright 2019 by Colin James III All rights reserved. Respond to author by email only: info@cec-services dot com. See updated abstract at ersatz-systems.com.
The six seminal equations evaluated are not tautologous, refuting the subsequent claimed proof of the ABC conjecture, and forming a non tautologous fragment of the universal logic VŁ4.
Riemann Hypothesis Yielding to Minor Effort--Part III: Ubiquitous Matching Paradox Irrelevant if Reduced to Extensions
Comments: 5 Pages. pre-ordual
While seeking to bypass the complex matching/ordering/comparability issue, the paper appears to have straddled areas seemingly as diverse as RH, Mikusinski operators, Euler equation for variations, and Veblen ordinals.
Nature Works the Way Number Work
Based on Eulers formula a concept of dually unit or d-unit circle is discovered. Continuing with, Riemann hypothesis is proved from different angles, Zeta values are renormalised to remove the poles of Zeta function and relationships between numbers and primes is discovered. Other unsolved prime conjectures are also proved with the help of theorems of numbers and number theory. Imaginary number i can be defined such a way that it eases the complex logarithm without needing branch cuts. Pi can also be a base to natural logarithm and complement complex logarithm.Grand integrated scale is discovered which can reconcile the scale difference between very big and very small. Complex constants derived from complex logarithm following Goldbach partition theorem and Eulers Sum to product and product to unity can explain lot of mysteries in the universe.
Some Results on the Greatest Common Divisor of Two Integers
Authors: Henry Wong
An addendum to elementary number theory.
Refutation of the Root in Partition Jensen Polynomials for Hyperbolicity
Comments: 1 Page. © Copyright 2019 by Colin James III All rights reserved. Respond to author by email only: info@cec-services dot com. See updated abstract at ersatz-systems.com.
The root in partition Jensen polynomials for hyperbolicity is not tautologous. Hence its use to prove the Riemann hypothesis is denied. These conjectures form a non tautologous fragment of the universal logic VŁ4.
The Greatest Common Divisor Function is Symmetric
With this algorithm you can easily find the greatest common divisor of two numbers even with large numbers of figures and the same can be done if you want to find the greatest common divisor of polynomials easily and also complex numbers.
La Función Máximo Común Divisor es Simétrica
Con este algoritmo podrás hallar fácilmente el máximo comun divisor de dos números incluso con gran cantidad de cifras y lo mismo podrás hacer si quieres hallar el máximo común divisor de polinomios fácilmente.
Number of Pythagorean Triples and Expansion of Euclid's Formula
Authors: Aryan Phadke
Set of Pythagorean triple consists of three values such that they comprise the three sides of a right angled triangle. Euclid gave a formula to find Pythagorean Triples for any given number. Motive of this paper is to find number of possible Pythagorean Triples for a given number. I have been able to provide a different proof for Euclid's formula, as well as find the number of triples for any given number. Euclid's formula is altered a little and is expanded with a variable 'x'. When 'x' follows the conditions mentioned the result is always a Pythagorean Triple.
Some Infinite Sum Series for pi
We give some infinite series for Pi.
On the Equation: X^x-X-1=0
This note presents some remarks on the equation: x^x-x-1=0,x>0
Consideration of the Riemann Hypothesis
I considered Riemann's hypothesis. At first, the purpose was to prove, but can not to prove. It is written in the middle of the proof, but it can not been proved at all. (The calculation formula is also written, but the real value 0.5 was not shown at all) The non-trivial zero values match perfectly in the formula of this paper. However, the formula did not reach the real value 0.5. In this case, it only reaches the pole near the real value 0.5.
Proof of Riemann Hypothesis
Authors: Gang tae geuk
리만가설이란 ζ(s)=0를 만족하는 모든 자명하지 않은 근의 실수부는 0.5이라는 가설이다 이것을 존 비더셔와 데니스 헤이셜, 두분의 아이디어로 일반인에게 설명하기 위해 변형한 (이하 일반인을 위한 설명)으로 바꾼다면 "임의의 자연수를 골라 소인수분해했을때(1과 소수의 거듭제곱인 약수가 포함된 수는 제외한다) 약수의 개수가 짝수 또는 홀수일 확률은 0.5이다"라고 할수있다 여기서 나는 리만가설을 푸는것이 아니라 일반인을 위한 설명을 풀어낼것이다 그것은 곧 리만가설의 해결로 이어질것이다 이미 자명한 사실인 이항계수의 성질에 의하면 C(n,1)+C(n,3)+C(n,5)+...+(홀수번째 항의 계수의 합)=2^(n-1),C(n,0)+C(n,2)+C(n,4)+...+(짝수번째 항의 계수의 합)=2^(n-1)이다. 이를 언급하였던 일반인을 위한 설명에 사용할것이다 소수의 개수 = n일때 모든 수는 소수들의 중복을 허용한 조합으로 표현가능하다 만약 중복을 허용하지 않는다면 소수의 거듭제곱인 약수가 포함되지 않은 수들을 얻을수 있다. 우리는 이 숫자들에 전부 문자를 붙일것이다 이를 위 언급한 이항계수의 성질에 대입하고 n을 무한대로 보낸다면 홀수번째 항의 계수의 합은 계수가 홀수인 문자조합의 개수가 될것이고 짝수번째 항의 계수의 합은 계수가 짝수인 문자조합의 개수가 될것이다 이는 계수가 홀수인 문자조합의 계수 = 계수가 짝수인 문자조합의 계수+1이다 (오른쪽 항에 1을 더한 이유는 계수가 짝수인 문자조합의 계수 계산에 C(n,0)을 포함하지 않았기 때문이다) 라는 식을 얻을수 있다 결국 '약수의 개수가 홀수인경우가 짝수보다 1경우 많다'라는 사실을 알수있다 이로써 리만가설은 증명되었다 가족분들 감사드리고 선생님들 모두 감사드리고 내 친구들에게도 감사를 표한다
Twin Prime Conjecture.
Comments: 2 Pages. for I am first.
I proved the Twin Prime Conjecture.\\ All Twin Prime are executed in hexadecimal notation. For example, it does not change in a huge number (forever huge number).\\ In a hexagonal diagram, (6n -1) and (6n+1), many are prime numbers.\\ Since the positive integers keep spinning around this hexagon forever, Twin Primes exist forever. All Twin Prime numbers are consist in (6n -1) or (6n +1) (n is a positive integer).\\ All numbers are executed in hexadecimal notation. This does not change even in a huge number (forever huge number).\\
About Goldbach's Conjecture
Authors: Esteve J., Martinez J.E.
By using results obtained by Srinivāsa A. Rāmānujan (specifically in his paper A Proof of Bertrand's Postulate), we made a proof of Goldbach's Conjecture. A generalization of the conjecture is also proven for every natural not coprime with a natural m > 1 and greater or equal than 2m.
Approximation of Sum of Harmonic Progression
Sum of Harmonic Progression is an old problem. While a few complex approximations have surfaced, a simple and efficient formula hasn't. Motive of the paper is to find a general formula for sum of harmonic progression without using 'summation' as a tool. This is an approximation for sum of Harmonic Progression for numerical terms. The formula was obtained by equating the areas of graphs of Harmonic Progression and curve of equation (y=1/x). Formula also has a variability that makes it more suitable for different users with different priorities in terms of accuracy and complexity.
Crazy Proof of Fermat's Last Theorem
Authors: Bambore Dawit Geinamo
Comments: 9 Pages. If there is any correction and comment welcom
This paper magically shows very interesting and simple proof of Fermat's Last Theorem. The proof identifies sufficient derivations of equations that holds the statement true and describes contradictions on them to satisfy the theorem. If Fermat had proof, his proof is most probably similar to this one. The proof does not require any higher field of mathematics and it can be understood in high school level of mathematics. It uses only modular arithmetic, factorization and some logical statements.
The L/R Symmetry and the Categorization of Natural Numbers
Authors: Emmanuil Manousos
"Every natural number, with the exception of 0 and 1, can be written in a unique way as a linear combination of consecutive powers of 2, with the coefficients of the linear combination being -1 or +1". According to this theorem we define the L/R symmetry of the natural numbers. The L/R symmetry gives the factors which determine the internal structure of natural numbers. As a consequence of this structure, we have an algorithm for determining prime numbers and for factorization of natural numbers.
Zeros of Gamma
Authors: Wilson Torres Ovejero
160 years ago that in the complex analysis a hypothesis was raised, which was used in principle to demonstrate a theory about prime numbers, but, without any proof; with the passing Over the years, this hypothesis has become very important, since it has multiple applications to physics, to number theory, statistics, among others In this article I present a demonstration that I consider is the one that has been dodging all this time.
Second Edition: The Twin Power Conjecture
Authors: Yuly Shipilevsky
We consider a new conjecture regarding powers of integer numbers and more specifically, we are interesting in existence and finding pairs of integers: n ≥ 2 and m ≥ 2, such that nm = mn. We conjecture that n = 2, m = 4 and n = 4, m = 2 are the only integral solutions. Next, we consider the corresponding generalizations for Hypercomplex Integers: Gaussian and Lipschitz Integers.
Riemann Hypothesis Yielding to Minor Effort--Part II: A [Generalizing] One-Line Demonstration
Comments: 6 Pages. trilinear
A set of minimalist demonstrations suggest how the key premises of RH may have been inspired and could be qualified, by proposing a linkage between the critical strip (0..n) and Re(s)=x-1/2 interior of candidate solutions. The solution density may be concentrated around the focal areas amid the lower and upper bound revealing rarefied or latent representations. The RH might overlook some of the ontological structure while confining search to phenomena while failing to distinguish between apparently concentrated versus seemingly non-distinct candidates.
A Proof that Exists an Infinite Number of Sophie Germain Primes
Authors: Marko Jankovic
In this paper a proof of the existence of an infinite number of Sophie Germain primes, is going to be presented. In order to do that, we analyse the basic formula for prime numbers and decide when this formula would produce a Sophie Germain prime, and when not. Originally very difficult problem (in observational space) has been transformed into a simpler one (in generative space) that can be solved by elementary math.
New Cubic Potentiation Algorithm
Authors: Zeolla Gabriel Martín
This document develops and demonstrates the discovery of a new cubic potentiation algorithm that works absolutely with all the numbers using the formula of the cubic of a binomial.
A Final Tentative of The Proof of The ABC Conjecture - Case c=a+1
Comments: 9 Pages. Submitted to the journal Monatshefte für Mathematik. Comments welcome.
In this paper, we consider the abc conjecture in the case c=a+1. Firstly, we give the proof of the first conjecture that c1, then for \epsilon \in ]0,1[ for the two cases: c rad(ac). We choose the constant K(\epsilon) as K(\epsilon)=e^{\frac{1}{\epsilon^2}). A numerical example is presented.
Weights at the Gym and the Irrationality of Zeta(2)
This is an easy approach to proving zeta(2) is irrational. The reasoning is by analogy with gym weights that are rational proportions of a unit. Sometimes the sum of such weights is expressible as a multiple of a single term in the sum and sometimes it isn't. The partials of zeta(2) are of the latter type. We use a result of real analysis and this fact to show the infinite sum has this same property and hence is irrational.
Second Edition: Polar Hypercomplex Integers
We introduce a special class of complex numbers, wherein their absolute values and arguments given in a polar coordinate system are integers, which when considered within the complex plane, constitute Unicentered Radial Lattice and similarly for quaternions.
Pi Formula
In this note we recall a formula for Pi.
Proof that there Are no Odd Perfect Numbers
Authors: Kouji Takaki
We have obtained the conclusion that there are no odd perfect numbers.
A Simple Proof of the Legendre's Conjecture
Authors: Afmika, AF. Michael
This is a simple proof of the Legendre's conjecture. afmichael73@gmail.com afmichael.san@gmail.com
Remarks on Infinitesimal Amount of Riemann Zeta Zeros
Authors: Algirdas Antano Maknickas
This remarks proves, that Riemann zeta function has infinitesimal amount of zeros.
Sums of Powers of the Terms of Lucas Sequences with Indices in Arithmetic Progression
Authors: Kunle Adegoke
We evaluate the sums $\sum_{j=0}^k{u_{rj+s}^{2n}\,z^j}$, $\sum_{j=0}^k{u_{rj+s}^{2n-1}\,z^j}$ and $\sum_{j=0}^k{v_{rj+s}^{n}\,z^j}$, where $r$, $s$ and $k$ are any integers, $n$ is any nonnegative integer, $z$ is arbitrary and $(u_n)$ and $(v_n)$ are the Lucas sequences of the first kind and of the second kind, respectively. As natural consequences we obtain explicit forms of the generating functions for the powers of the terms of Lucas sequences with indices in arithmetic progression. This paper therefore extends the results of P.~Sta\u nic\u a who evaluated $\sum_{j=0}^k{u_{j}^{2n}\,z^j}$ and $\sum_{j=0}^k{u_{j}^{2n-1}\,z^j}$; and those of B. S. Popov who obtained generating functions for the powers of these sequences.
The Number Alpha=0.5*arccos(0.5*arccos(0.5*...))
In this note we give some formulas related with the number: alpha=0.5*arccos(0.5*arccos(0.5*arccos(0.5*...))).
New Square Potentiation Algorithm
This document develops and demonstrates the discovery of a new square potentiation algorithm that works absolutely with all the numbers using the formula of the square of a binomial.
The Inconsistency of Arithmetic
Based on a strengthened form of the strong Goldbach conjecture, this paper presents an arithmetic antinomy within the Peano arithmetic (PA). We derive two contradictory statements by using the same main instrument as in the proof of the conjecture, i.e. a set that is a structuring of the natural numbers starting from 3.
About the Congruent Number
Authors: Hajime Mashima
The three sides of the right triangle are rational numbers, and those with natural numbers are congruent numbers.
Fermat Equation for Hypercomplex Numbers
We consider generalized Fermat equation for hypercomplex numbers, in order to stimulate research and development of those generalization
Meaning of Irrational Numbers
Authors: Divyendu Priyadarshi
In this short paper, I have tried to give a physical meaning to irrational numbers.
Riemann Zeta Function Nine Propositions
Authors: Pedro Caceres
The Riemann Zeta function or Euler–Riemann Zeta function, ζ(s), is a function of a complex variable z that analytically continues the sum of the Dirichlet series: () = ∑ ^(-z) from k=1,∞ The Riemann zeta function is a meromorphic function on the whole complex z-plane, which is holomorphic everywhere except for a simple pole at z = 1 with residue 1. One of the most important advance in the study of Prime numbers was the paper by Bernhard Riemann in November 1859 called "Ueber die Anzahl der Primzahlen unter einer gegebenen Grösse" (On the number of primes less than a given quantity). In this paper, Riemann gave a formula for the number of primes less than x in terms the integral of 1/log(x), and also provided insights into the roots (zeros) of the zeta function, formulating a conjecture about the location of the zeros of () in the critical line Re(z)=1/2. The Riemann Zeta function is one of the most studied and well known mathematical functions in history. In this paper, we will formulate nine new propositions to advance in the knowledge of the Riemann Zeta function
Nature Works the Way Number Works
Starting with proof of Riemann hypothesis, zeta values are renormalised to remove the poles of zeta function and get relationships between numbers and prime. Imaginary number i has been defined such a way that it eases the complex logarithm and accounts for the scale difference between very big and very small. Other unsolved prime conjectures are also proved with the help of newly gathered information.
Riemann Hypothesis Yielding to Minor Effort
Comments: 8 Pages. Trilinear, IIIVNII
A set of distinct and elementary approaches, all embarking on the Euler-Riemann equivalence representing the zeta at zero, invariably point to a consistent solution structure. The Riemann Hypothesis as regards Re=1/2 gains full support as a core solution, albeit one amounting to a special nontrivial case warranting extensions and qualifications.
Algorithm Capable of Proving Goldbach's Conjecture- An Unconventional Approach
Authors: Elizabeth Gatton-Robey
I created an algorithm capable of proving Goldbach's Conjecture. This is not a claim to have proven the conjecture. The algorithm and all work contained in this document is original, so no outside sources have been used. This paper explains the algorithm then applies the algorithm with examples. The final section of the paper contains a series of proof-like reasoning to accompany my thoughts on why I believe Goldbach's Conjecture can be proven with the use of my algorithm.
The Twin Power Conjecture
We consider a new conjecture regarding powers of integer numbers and more specifically, we are interesting in existence and finding pairs of integers: n ≥ 2 and m ≥ 2, such that n^m = m^n.
Solving Incompletely Predictable Problems Polignac's and Twin Prime Conjectures with Research Method Information-Complexity Conservation
Authors: John Yuk Ching Ting
Comments: 18 Pages. Rigorous Proof for Polignac's and Twin prime conjectures dated April 12, 2019
Prime numbers are Incompletely Predictable numbers calculated using complex algorithm Sieve of Eratosthenes. Involving proposals that prime gaps and associated sets of prime numbers are infinite in magnitude, Twin prime conjecture deals with even prime gap 2 and is a subset of Polignac's conjecture which deals with all even prime gaps 2, 4, 6, 8, 10,.... Treated as Incompletely Predictable problems, we solve these conjectures as Plus Gap 2 Composite Number Continuous Law and Plus-Minus Gap 2 Composite Number Alternating Law obtained using novel research method Information-Complexity conservation.
A Tentative of The Proof of The ABC Conjecture - Case c=a+1
Comments: 10 Pages. Submitted to the journal Research In Number Theory. Comments welcome.
In this paper, we consider the $abc$ conjecture in the case $c=a+1$. Firstly, we give the proof of the first conjecture that $c rad(ac)$. We choose the constant $K(\epsilon)$ as $K(\epsilon)=e^{\ds \left(\frac{1}{\epsilon^2} \right)}$. A numerical example is presented.}
Discovery on Beal Conjecture
Authors: Idriss Olivier Bado
In this paper we give a proof for Beal's conjecture . Since the discovery of the proof of Fermat's last theorem by Andre Wiles, several questions arise on the correctness of Beal's conjecture. By using a very rigorous method we come to the proof. Let $ \mathbb{G}=\{(x,y,z)\in \mathbb{N}^{3}: \min(x,y,z)\geq 3\}$ $\Omega_{n}=\{ p\in \mathbb{P}: p\mid n , p \nmid z^{y}-y^{z}\}$ , $$\mathbb{T}=\{(x,y,z)\in \mathbb{N}^{3}: x\geq 3,y\geq 3,z\geq 3\}$$ $\forall(x,y,z) \in \mathbb{T}$ consider the function $f_{x,y,z}$ be the function defined as : $$\begin{array}{ccccc} f_{x,y,z} & : \mathbb{N}^{3}& &\to & \mathbb{Z}\\ & & (X,Y,Z) & \mapsto & X^{x}+Y^{y}-Z^{z}\\ \end{array}$$ Denote by $$\mathbb{E}^{x,y,z}=\{(X,Y,Z)\in \mathbb{N}^{3}:f_{x,y,z}(X,Y,Z)=0\}$$ and $\mathbb{U}=\{(X,Y,Z)\in \mathbb{N}^{3}: \gcd(X,Y)\geq2,\gcd(X,Z)\geq2,\gcd(Y,Z)\geq2\}$ Let $ x=\min(x,y,z)$ . The obtained result show that :if $ A^{x}+B^{y}=C^{z}$ has a solution and $ \Omega_{A}\not=\emptyset$, $\forall p \in \Omega_{A}$ , $$ Q(B,C)=\sum_{j=1}^{x-1}[\binom{y}{j}B^{j}-\binom{z}{j}C^{j}]$$ has no solution in $(\frac{\mathbb{Z}}{p^{x}\mathbb{Z}})^{2}\setminus\{(\overline{0},\overline{0})\} $ Using this result we show that Beal's conjecture is true since $$ \bigcup_{(x,y,z)\in\mathbb{T}}\mathbb{E}^{x,y,z}\cap \mathbb{U}\not=\emptyset$$ Then $\exists (\alpha,\beta,\gamma)\in \mathbb{N}^{3}$ such that $\min(\alpha,\beta,\gamma)\leq 2$ and $\mathbb{E}^{\alpha,\beta,\gamma}\cap \mathbb{U}=\emptyset$ The novel techniques use for the proof can be use to solve the variety of Diophantine equations . We provide also the solution to Beal's equation . Our proof can provide an algorithm to generate solution to Beal's equation
Proof of the Polignac Prime Conjecture and other Conjectures
Authors: Stephen Marshall
The Polignac prime conjecture, was made by Alphonse de Polignac in 1849. Alphonse de Polignac (1826 – 1863) was a French mathematician whose father, Jules de Polignac (1780-1847) was prime minister of Charles X until the Bourbon dynasty was overthrown in1830. Polignac attended the École Polytechnique (commonly known as Polytechnique) a French public institution of higher education and research, located in Palaiseau near Paris. In 1849, the year Alphonse de Polignac was admitted to Polytechnique, he made what's known as Polignac's conjecture: For every positive integer k, there are infinitely many prime gaps of size 2k. Alphonse de Polignac made other significant contributions to number theory, including the de Polignac's formula, which gives the prime factorization of n!, the factorial of n, where n ≥ 1 is a positive integer. This paper presents a complete and exhaustive proof of the Polignac Prime Conjecture. The approach to this proof uses same logic that Euclid used to prove there are an infinite number of prime numbers.
Replacements of recent Submissions
[1081] viXra:1907.0108 [pdf] replaced on 2019-07-15 06:03:35
Pi, the Primes and the Lambert W Function
Pi, the primes and the Lambert W function, conference in Montréal at the ACA 2019. July 17.
Pi, primes and the Lambert W function, conference in Montréal, July 17 2019 (update)
This is a conference to be hold in Montréal on July 17, 2019.
Pi the primes and the Lambert W function, a conference to be hold in Montréal on July 17 2019.
Conference to be given in Montréal , july 17 2019. The talk is in english. Subject : Pi, the primes and the Lambert W function.
Authors: Hung Tran
Comments: 5 Pages. Proof of the Riemann hypothesis using a Hamiltonian and a self-adjoint operator
Infinite Number of Fibonacci and Lucas Primes
What I try to prove is if there are infinite number of Fibonacci and Lucas primes
Asymptotic Closed-form Nth Zero Formula for Riemann Zeta Function
Authors: Alan M. Gómez
Assuming the Riemann Hypothesis to be true, we propose an asymptotic and closed-form formula to find the imaginary part for non-trivial zeros of the Riemann Zeta Function.
Comments: 4 Pages. Additional comments and examples added.
The rational root test gives a means for determining if a root of a polynomial is rational. If none of the possible rational roots are roots, then if the roots are real, they must be irrational. Combining this observation with Taylor polynomials and the Taylor series for $\sin (x)$ gives intimations that $\pi$, and $e$, are likely irrational.
Proof of the Riemann Hypothesis
Comments: 5 Pages. refined
In the previous paper "Consideration of the Riemann hypothesis" c = 0.5 and x is non-trivial zero value, and it was described that it converges to 0, but a serious proof in mathematical expression could not be obtained. In this paper, we will give a proof of mathematical expression. "the non-trivial zero values of all positive infinity and negative infinity lie on the real value 0.5" I am here explained.
Comments: 78 Pages. refined
Comments: 35 Pages. I polished it.
Comments: 55 Pages. It has been refined
Riemann hypothesis means that satisfying ζ(s)=0(ζ(s) means Riemann Zeta function) unselfevidenceable root's part of true numbers are 1/2. Dennis Hejhal, and John Dubisher explained this hypothesis to : "Choosed Any natural numbers(exclude 1 and constructed with two or higher powered prime numbers) then the probability of numbers that choosed number's forming prime factor become an even number is 1/2." I'll prove this explain to prove Riemann hypothesis indirectly. In binomial coefficient, C(n,0)+C(n+1)+...+C(n,n)=2^n. And C(n,1)+C(n,3)+C(n,5)+...+C(n,n) and C(n,0)+C(n,2)+C(n,4)+...+C(n,n) is 2^(n-1). If you pick up 8 prime numbers, then you can make numbers that exclude 1 and constructed with two or higher powered prime numbers, and the total amount of numbers that you made is 2^8. Same principle, if you pick the numbers in k times(k is a variable), the total amount of numbers you made is C(8,k). If k is an even number, the total amount of numbers you can make is C(8,0)+C(8,2)+...+C(8,8)-1(because we must exclude 1,same for C(8,0)), and as what i said, it equals to 2^(8-1)-1. So, the probability of the numbers that forming prime factor's numbers is an even number is 2^(8-1)-1/2^8 If there are amount of prime numbers exist, and we say that amount to n(n is a variable, as the k so), and sequence of upper works sameas we did, so the probability is 2^(n-1)/2^n. If you limits n to inf, then probability convergents to 1/2. This answer coincident with the explain above, so explain is established, same as the Riemann hypothesis is.
Comments: 4 Pages. It has been refined
Authors: Esteve J., Martinez J. E.
Comments: 6 Pages. A correction in the logical argumentation of the main theorem was made.
We proof Goldbach's Conjecture. We use results obtained by Srinivāsa A. Rāmānujan (specifically in his paper A Proof of Bertrand's Postulate). A generalization of the conjeture is also proven for every natural not coprime with a natural m > 1 and greater or equal than 2m.
A Proof of Sophie Germain Primes Conjecture
Authors: Marko V. Jankovic
We have obtained the conclusion that there are no odd perfect numbers when n=1 and the number is one at most when n≧5.
We have obtained the conclusion that if a proposition is correct, there are no odd perfect numbers.
This remarks prove, that Riemann zeta function has infinitesimal amount of zeros.
Based on a strengthened form of the strong Goldbach conjecture, this paper presents an antinomy within the Peano arithmetic (PA). We derive two contradictory statements by using the same main instrument as in the proof of the conjecture, i.e. a set that is a structuring of the natural numbers starting from 3.
Based on Euler 's formula a concept of duality unit or dunit circle is discovered. Continuing with Riemann hypothesis is proved from different angles, zeta values are renormalised to remove the poles of zeta function and discover relationships between numbers and primes. Other unsolved prime conjectures are also proved with the help of theorems of numbers and number theory. Imaginary number i can be defined such a way that it eases the complex logarithm and accounts for the scale difference between very big and very small. Pi can also be a base to natural logarithm and complement the scale gap. 96 complex constants derived from complex logarithm can explain everything in the universe.
Based on Euler 's formula a concept of duality unit or dunit circle is discovered. Continuing with Riemann hypothesis is proved from different angles, zeta values are renormalised to remove the poles of zeta function and discover relationships between numbers and primes. Imaginary number i can be defined such a way that it eases the complex logarithm and accounts for the scale difference between very big and very small. Pi can also be a base to natural logarithm and complement the scale gap. Other unsolved prime conjectures are also proved with the help of theorems of numbers and number theory.
Algorithm Capable of Proving Goldbach's Conjecture
I created an algorithm capable of proving Goldbach's Conjecture. This is not a claim to have proven the conjecture. The algorithm and all work contained in this document is original, so no outside sources have been used. This paper explains the algorithm then applies the algorithm with examples. The final section of the paper contains information to accompany my thoughts on why I believe Goldbach's Conjecture can be proven with the use of my algorithm.
Solving Incompletely Predictable Problems Polignac's and Twin Prime Conjectures Using Information-Complexity Conservation
Comments: 18 Pages. Rigorous proofs for Polignac's and Twin prime conjectures.
Prime numbers are Incompletely Predictable numbers calculated using complex algorithm Sieve of Eratosthenes. Involving proposals that prime gaps and associated sets of prime numbers are infinite in magnitude, Twin prime conjecture deals with even prime gap 2 and is a subset of Polignac's conjecture which deals with all even prime gaps 2, 4, 6, 8, 10,.... Treated as Incompletely Predictable problems, we solve these conjectures with research method Information-Complexity conservation to get Plus Gap 2 Composite Number Continuous Law and Plus-Minus Gap 2 Composite Number Alternating Law.
Contact - Disclaimer - Privacy - Funding