DOCSLIB.ORG

Number Theory and Symmetry • Michel Planat Number Theory and Symmetry

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Number Theory and Symmetry • Michel Planat Number Theory and Symmetry Number Theory Number Symmetry and • Michel Planat Number Theory and Symmetry Edited by Michel Planat Printed Edition of the Special Issue Published in Symmetry www.mdpi.com/journal/symmetry Number Theory and Symmetry Number Theory and Symmetry Editor Michel Planat MDPI • Basel • Beijing • Wuhan • Barcelona • Belgrade • Manchester • Tokyo • Cluj • Tianjin Editor Michel Planat Institut FEMTO-ST France Editorial Office MDPI St. Alban-Anlage 66 4052 Basel, Switzerland This is a reprint of articles from the Special Issue published online in the open access journal Symmetry (ISSN 2073-8994) (available at: https://www.mdpi.com/journal/symmetry/special issues/Number Theory Symmetry). For citation purposes, cite each article independently as indicated on the article page online and as indicated below: LastName, A.A.; LastName, B.B.; LastName, C.C. Article Title. Journal Name Year, Article Number, Page Range. ISBN 978-3-03936-686-6 (Hbk) ISBN 978-3-03936-687-3 (PDF) c 2020 by the authors. Articles in this book are Open Access and distributed under the Creative Commons Attribution (CC BY) license, which allows users to download, copy and build upon published articles, as long as the author and publisher are properly credited, which ensures maximum dissemination and a wider impact of our publications. The book as a whole is distributed by MDPI under the terms and conditions of the Creative Commons license CC BY-NC-ND. Contents About the Editor .............................................. vii Preface to ”Number Theory and Symmetry” .............................. ix Germ´anSierra The Riemann Zeros as Spectrum and the Riemann Hypothesis Reprinted from: Symmetry 2019, 11, 494, doi:10.3390/sym11040494 ................. 1 Michel Planat, Raymond Aschheim, Marcelo M. Amaral and Klee Irwin Universal Quantum Computing and Three-Manifolds Reprinted from: Symmetry 2018, 10, 773, doi:10.3390/sym10120773 ................. 39 Torsten Asselmeyer-Maluga Braids, 3-Manifolds, Elementary Particles: Number Theory and Symmetry in Particle Physics Reprinted from: Symmetry 2019, 11, 1298, doi:10.3390/sym11101298 ................ 55 Bruno Aiazzi, Stefano Baronti, Leonardo Santurri and Massimo Selva An Investigation on the Prime and Twin Prime Number Functions by Periodical Binary Sequences and Symmetrical Runs in a Modified Sieve Procedure Reprinted from: Symmetry 2019, 11, 775, doi:10.3390/sym11060775 ................. 81 S.T. Ishmukhametov, B.G. Mubarakov and R.G. Rubtsova On the Number of Witnesses in the Miller–Rabin PrimalityTest Reprinted from: Symmetry 2020, 12, 890, doi:10.3390/sym12060890 .................103 Atsushi Yamagami and Kazuki Taniguchi On a Generalization of a Lucas’ Resultand an Application to the 4-Pascal’s Triangle Reprinted from: Symmetry 2020, 12, 288, doi:10.3390/sym12020288 .................115 Pavel Trojovsky´ Algebraic Numbers as Product of Powers of Transcendental Numbers Reprinted from: Symmetry 2019, 11, 887, doi:10.3390/sym11070887 .................123 Atsushi Yamagami and Y ¯ukiMatsui On Some Formulas for Kaprekar Constants Reprinted from: Symmetry 2019, 11, 885, doi:10.3390/sym11070885 .................129 Ilwoo Cho ∗ Asymptotic Semicircular Laws Induced by p-Adic Number Fields Qpand C -Algebras over Primes p Reprinted from: Symmetry 2019, 11, 819, doi:10.3390/sym11060819 .................161 v About the Editor Michel Planat was a researcher at the National Center of Scientific Research in France from 1982 to 2018. From 1980 to 2001, he researched nonlinear waves in piezoelectric crystals and 1/f noise in quartz resonators. He established links between 1/f noise and number theory. He also researched the Riemann hypothesis. He discovered Ramanujan sums signal processing. From 2002 to 2018, he was interested in quantum information theory with work concerning mutually unbiased bases, quantum entanglement and contextuality, and quantum computing, using mathematical tools such as finite geometries, number theory, dessin d’enfants, and free group theory. Since 2019, he is a visiting scientist at FEMTO-ST Institute in Besanc¸on, France. He is also an associate research scientist at Quantum Gravity Research in Los Angeles. His current research is about topological quantum computing from three- and four-manifolds to establish bridges between quantum computing and quantum gravity. vii Preface to ”Number Theory and Symmetry” “Number Theory and Symmetry” deals with topics connecting numbers (integers, algebraic integers, transcendental numbers, p-adic numbers) and symmetries. First of all, symmetry became part of number theory when Riemann investigated the distribution of prime numbers and for that purpose introduced the complex functional equation and the related Riemann hypothesis (RH) that non-trivial zeros of the Riemann zeta function lie on the symmetry axis s = 1/2. Then, in a quest to justify RH on physical grounds, the Hilbert–Polya conjecture claimed that the imaginary part of the Riemann zeros on the symmetry axis should correspond to the eigenvalues of a Hermitian operator. This topic is covered by German Sierra. Besides these classical areas, number fields offer clues to the connection between numbers and symmetries through arithmetic groups, geometry, and topology. I have in mind the Poincare´ conjecture and the whole work of Thurston about 3-manifolds. This topic is the kernel of the two papers by Michel Planat and co-authors and Torsten Asselmeyer Maluga. The aforementioned three papers highlight a strong connection between number theory and quantum physics. The range of the three subsequent papers in this series is about more standard topics of number theory. A modified Sieve procedure by Bruno Aiazzi and coauthors, the Miller–Rabin primality test by Shamil Ishmukhametov and co-authors, and the 4-Pascal’s triangle by Atsushi Yamagami and Kazuki Taniguchi are investigated. The paper by Pavel Trojovsky offers clues to the relation between algebraic and transcendental numbers through polynomials. Atsushi Yamagami and Yuki Matsui’s paper is in the field of b-adic numbers. The last paper by Ilwoo Cho covers the topic of p-adic numbers thanks to C*-algebras and Banach*-probability spaces. The rich panel of mathematical concepts involved in this Special Issue illustrates the continuous interest of scholars in the relationship between numbers, their symmetries, and physics. Michel Planat Editor ix S S symmetry Article The Riemann Zeros as Spectrum and the Riemann Hypothesis Germán Sierra Instituto de Física Teórica UAM/CSIC, Universidad Autónoma de Madrid, Cantoblanco, 28049 Madrid, Spain; [email protected] Received: 31 December 2018; Accepted: 26 March 2019; Published: 4 April 2019 Abstract: We present a spectral realization of the Riemann zeros based on the propagation of a massless Dirac fermion in a region of Rindler spacetime and under the action of delta function potentials localized on the square free integers. The corresponding Hamiltonian admits a self-adjoint extension that is tuned to the phase of the zeta function, on the critical line, in order to obtain the Riemann zeros as bound states. The model suggests a proof of the Riemann hypothesis in the limit where the potentials vanish. Finally, we propose an interferometer that may yield an experimental observation of the Riemann zeros. Keywords: zeta function; Pólya-Hilbert conjecture; Riemann interferometer 1. Introduction One of the most promising approaches to prove the Riemann Hypothesis [1–7] is based on the conjecture, due to Pólya and Hilbert, that the Riemann zeros are the eigenvalues of a quantum mechanical Hamiltonian [8]. This bold idea is supported by several results and analogies involving Number Theory, Random Matrix Theory and Quantum Chaos [9–17]. However, the construction of a Hamiltonian whose spectrum contains the Riemann zeros, has eluded researchers for several decades. In this paper we shall review the progress made along this direction starting from the famous xp model proposed in 1999 by Berry, Keating and Connes [18–20] that inspired many works [21–45], some of them will be discuss below. See [46] for a general review on physical approaches to the RH. Other approaches to the RH and related material can be found in [47–63]. To relate xp with the Riemann zeros, Berry, Keating and Connes used two different regularizations. The Berry and Keating regularization led to a discrete spectrum related to the smooth Riemann zeros [18,19], while Connes’s regularization led to an absorption spectrum where the zeros are missing spectral lines [20]. A physical realization of the Connes model was obtained in 2008 in terms of the dynamics of an electron moving in two dimensions under the action of a uniform perpendicular magnetic field and an electrostatic potential [29]. However this model has not been able to reproduce the exact location of the Riemann zeros. On the other hand, the Berry–Keating xp model was revisited in 2011 in terms of the classical Hamiltonians H = x(p + 1/p), and H =(x + 1/x)(p + 1/p) whose quantizations contain the smooth approximation of the Riemann zeros [32,36]. Later on, these models were generalized in terms of the family of Hamiltonians H = U(x)p + V(x)/p that were shown to describe the dynamics of a massive particle in a relativistic spacetime whose metric can be constructed using the functions U and V [35]. This result suggested a reformulation of H = U(x)p + V(x)/p in terms of the massive Dirac equation in the aforementioned spacetimes [38]. Using this reformulation, the Hamiltonian H = x(p + 1/p) was shown to be equivalent to the massive Dirac equation in Rindler spacetime that is the natural arena to study accelerated observers and the Unruh effect [42]. This result provides an appealing spacetime interpretation of the xp model and in particular of the smooth Riemann zeros. Symmetry 2019, 11, 494; doi:10.3390/sym110404941 www.mdpi.com/journal/symmetry Symmetry 2019, 11, 494 To obtain the exact zeros, one must make further modifications of the Dirac model. First, the fermion must become massless. This change is suggested by a field theory interpretation of the Pólya’s ξ function and its comparison with the Riemann’s ξ function.
Load more

Recommended publications
  • On Fixed Points of Iterations Between the Order of Appearance and the Euler Totient Function
    mathematics Article On Fixed Points of Iterations Between the Order of Appearance and the Euler Totient Function ŠtˇepánHubálovský 1,* and Eva Trojovská 2 1 Department of Applied Cybernetics, Faculty of Science, University of Hradec Králové, 50003 Hradec Králové, Czech Republic 2 Department of Mathematics, Faculty of Science, University of Hradec Králové, 50003 Hradec Králové, Czech Republic; [email protected] * Correspondence: [email protected] or [email protected]; Tel.: +420-49-333-2704 Received: 3 October 2020; Accepted: 14 October 2020; Published: 16 October 2020 Abstract: Let Fn be the nth Fibonacci number. The order of appearance z(n) of a natural number n is defined as the smallest positive integer k such that Fk ≡ 0 (mod n). In this paper, we shall find all positive solutions of the Diophantine equation z(j(n)) = n, where j is the Euler totient function. Keywords: Fibonacci numbers; order of appearance; Euler totient function; fixed points; Diophantine equations MSC: 11B39; 11DXX 1. Introduction Let (Fn)n≥0 be the sequence of Fibonacci numbers which is defined by 2nd order recurrence Fn+2 = Fn+1 + Fn, with initial conditions Fi = i, for i 2 f0, 1g. These numbers (together with the sequence of prime numbers) form a very important sequence in mathematics (mainly because its unexpectedly and often appearance in many branches of mathematics as well as in another disciplines). We refer the reader to [1–3] and their very extensive bibliography. We recall that an arithmetic function is any function f : Z>0 ! C (i.e., a complex-valued function which is defined for all positive integer).
    [Show full text]
  • An Amazing Prime Heuristic.Pdf
    This document has been moved to https://arxiv.org/abs/2103.04483 Please use that version instead. AN AMAZING PRIME HEURISTIC CHRIS K. CALDWELL 1. Introduction The record for the largest known twin prime is constantly changing. For example, in October of 2000, David Underbakke found the record primes: 83475759 264955 1: · The very next day Giovanni La Barbera found the new record primes: 1693965 266443 1: · The fact that the size of these records are close is no coincidence! Before we seek a record like this, we usually try to estimate how long the search might take, and use this information to determine our search parameters. To do this we need to know how common twin primes are. It has been conjectured that the number of twin primes less than or equal to N is asymptotic to N dx 2C2N 2C2 2 2 Z2 (log x) ∼ (log N) where C2, called the twin prime constant, is approximately 0:6601618. Using this we can estimate how many numbers we will need to try before we find a prime. In the case of Underbakke and La Barbera, they were both using the same sieving software (NewPGen1 by Paul Jobling) and the same primality proving software (Proth.exe2 by Yves Gallot) on similar hardware{so of course they choose similar ranges to search. But where does this conjecture come from? In this chapter we will discuss a general method to form conjectures similar to the twin prime conjecture above. We will then apply it to a number of different forms of primes such as Sophie Germain primes, primes in arithmetic progressions, primorial primes and even the Goldbach conjecture.
    [Show full text]
  • Algebraic Numbers As Product of Powers of Transcendental Numbers
    S S symmetry Article Algebraic Numbers as Product of Powers of Transcendental Numbers Pavel Trojovský Department of Mathematics, Faculty of Science, University of Hradec Králové, 500 03 Hradec Králové, Czech Republic; [email protected]; Tel.: +42-049-333-2801 Received: 17 June 2019; Accepted: 4 July 2019; Published: 8 July 2019 Abstract: The elementary symmetric functions play a crucial role in the study of zeros of non-zero polynomials in C[x], and the problem of finding zeros in Q[x] leads to the definition of algebraic and transcendental numbers. Recently, Marques studied the set of algebraic numbers in the form P(T)Q(T). In this paper, we generalize this result by showing the existence of algebraic Q (T) Qn(T) numbers which can be written in the form P1(T) 1 ··· Pn(T) for some transcendental number T, where P1, ... , Pn, Q1, ... , Qn are prescribed, non-constant polynomials in Q[x] (under weak conditions). More generally, our result generalizes results on the arithmetic nature of zw when z and w are transcendental. Keywords: Baker’s theorem; Gel’fond–Schneider theorem; algebraic number; transcendental number 1. Introduction The name “transcendental”, which comes from the Latin word “transcendˇere”, was first used for a mathematical concept by Leibniz in 1682. Transcendental numbers in the modern sense were defined by Leonhard Euler (see [1]). A complex number a is called algebraic if it is a zero of some non-zero polynomial P 2 Q[x]. Otherwise, a is transcendental. Algebraic numbers form a field, which is denoted by Q. The transcendence of e was proved by Charles Hermite [2] in 1872, and two years later Ferdinand von Lindeman [3] extended the method of Hermite‘s proof to derive that p is also transcendental.
    [Show full text]
  • New Formulas for Semi-Primes. Testing, Counting and Identification
    New Formulas for Semi-Primes. Testing, Counting and Identification of the nth and next Semi-Primes Issam Kaddouraa, Samih Abdul-Nabib, Khadija Al-Akhrassa aDepartment of Mathematics, school of arts and sciences bDepartment of computers and communications engineering, Lebanese International University, Beirut, Lebanon Abstract In this paper we give a new semiprimality test and we construct a new formula for π(2)(N), the function that counts the number of semiprimes not exceeding a given number N. We also present new formulas to identify the nth semiprime and the next semiprime to a given number. The new formulas are based on the knowledge of the primes less than or equal to the cube roots 3 of N : P , P ....P 3 √N. 1 2 π( √N) ≤ Keywords: prime, semiprime, nth semiprime, next semiprime 1. Introduction Securing data remains a concern for every individual and every organiza- tion on the globe. In telecommunication, cryptography is one of the studies that permits the secure transfer of information [1] over the Internet. Prime numbers have special properties that make them of fundamental importance in cryptography. The core of the Internet security is based on protocols, such arXiv:1608.05405v1 [math.NT] 17 Aug 2016 as SSL and TSL [2] released in 1994 and persist as the basis for securing dif- ferent aspects of today’s Internet [3]. The Rivest-Shamir-Adleman encryption method [4], released in 1978, uses asymmetric keys for exchanging data. A secret key Sk and a public key Pk are generated by the recipient with the following property: A message enciphered Email addresses: [email protected] (Issam Kaddoura), [email protected] (Samih Abdul-Nabi) 1 by Pk can only be deciphered by Sk and vice versa.
    [Show full text]
  • Arxiv:Math/0201082V1
    2000]11A25, 13J05 THE RING OF ARITHMETICAL FUNCTIONS WITH UNITARY CONVOLUTION: DIVISORIAL AND TOPOLOGICAL PROPERTIES. JAN SNELLMAN Abstract. We study (A, +, ⊕), the ring of arithmetical functions with unitary convolution, giving an isomorphism between (A, +, ⊕) and a generalized power series ring on infinitely many variables, similar to the isomorphism of Cashwell- Everett[4] between the ring (A, +, ·) of arithmetical functions with Dirichlet convolution and the power series ring C[[x1,x2,x3,... ]] on countably many variables. We topologize it with respect to a natural norm, and shove that all ideals are quasi-finite. Some elementary results on factorization into atoms are obtained. We prove the existence of an abundance of non-associate regular non-units. 1. Introduction The ring of arithmetical functions with Dirichlet convolution, which we’ll denote by (A, +, ·), is the set of all functions N+ → C, where N+ denotes the positive integers. It is given the structure of a commutative C-algebra by component-wise addition and multiplication by scalars, and by the Dirichlet convolution f · g(k)= f(r)g(k/r). (1) Xr|k Then, the multiplicative unit is the function e1 with e1(1) = 1 and e1(k) = 0 for k> 1, and the additive unit is the zero function 0. Cashwell-Everett [4] showed that (A, +, ·) is a UFD using the isomorphism (A, +, ·) ≃ C[[x1, x2, x3,... ]], (2) where each xi corresponds to the function which is 1 on the i’th prime number, and 0 otherwise. Schwab and Silberberg [9] topologised (A, +, ·) by means of the norm 1 arXiv:math/0201082v1 [math.AC] 10 Jan 2002 |f| = (3) min { k f(k) 6=0 } They noted that this norm is an ultra-metric, and that ((A, +, ·), |·|) is a valued ring, i.e.
    [Show full text]
  • Fixed Points of Certain Arithmetic Functions
    FIXED POINTS OF CERTAIN ARITHMETIC FUNCTIONS WALTER E. BECK and RUDOLPH M. WAJAR University of Wisconsin, Whitewater, Wisconsin 53190 IWTRODUCTIOW Perfect, amicable and sociable numbers are fixed points of the arithemetic function L and its iterates, L (n) = a(n) - n, where o is the sum of divisor's function. Recently there have been investigations into functions differing from L by 1; i.e., functions L+, Z.,, defined by L + (n)= L(n)± 1. Jerrard and Temperley [1] studied the existence of fixed points of L+ and /._. Lai and Forbes [2] conducted a computer search for fixed points of (LJ . For earlier references to /._, see the bibliography in [2]. We consider the analogous situation using o*, the sum of unitary divisors function. Let Z.J, Lt, be arithmetic functions defined by L*+(n) = o*(n)-n±1. In § 1, we prove, using parity arguments, that L* has no fixed points. Fixed points of iterates of L* arise in sets where the number of elements in the set is equal to the power of/.* in question. In each such set there is at least one natural number n such that L*(n) > n. In § 2, we consider conditions n mustsatisfy to enjoy the inequality and how the inequality acts under multiplication. In particular if n is even, it is divisible by at least three primes; if odd, by five. If /? enjoys the inequality, any multiply by a relatively prime factor does so. There is a bound on the highest power of n that satisfies the inequality. Further if n does not enjoy the inequality, there are bounds on the prime powers multiplying n which will yield the inequality.
    [Show full text]
  • The Evolution of Number in Mathematics Assad Ebrahim
    THE EVOLUTION OF NUMBER IN MATHEMATICS ASSAD EBRAHIM Abstract. The number concept has evolved in a gradual process over ten millenia from concrete symbol association in the Middle East c.8000 BCE (“4 sheep-tokens are different than 4 grain-tokens”)1 to an hierarchy of number sets (N ⊂ Z ⊂ Q ⊂ R ⊂ C ⊂ H ⊂ O)2 the last four of which unify number with space and motion.3 In this paper we trace this evolution from whole numbers at the dawn of accounting with number-tokens through the paradoxes of algebraic irrationals, non-solvability by radicals4 , and uncountably many transcendentals, to the physical reality of imaginary numbers and the connection of the octonions with supersymmetry and string theory.5(FAQ3) Our story is of conceptual abstraction, algebraic extension, and analytic completeness, and reflects the modern transformation of mathematics itself. The main paper is brief (four pages) followed by supplements containing FAQs, historical notes, and appendices (holding theorems and proofs), and an annotated bibliography. A project supplement is in preparation to allow learning the material through self-discovery and guided exploration. For scholars and laymen alike it is not philosophy but active experience in mathematics itself that can alone answer the question: ‘What is Mathematics?’ Richard Courant (1941), book of the same title “One of the disappointments experienced by most mathematics students is that they never get a [unified] course on mathematics. They get courses in calculus, algebra, topology, and so on, but the division of labor in teaching seems to prevent these different topics from being combined into a whole.
    [Show full text]
  • Common and Uncommon Standard Number Sets
    Common and Uncommon Standard Number Sets W. Blaine Dowler July 8, 2010 Abstract There are a number of important (and interesting unimportant) sets in mathematics. Sixteen of those sets are detailed here. Contents 1 Natural Numbers 2 2 Whole Numbers 2 3 Prime Numbers 3 4 Composite Numbers 3 5 Perfect Numbers 3 6 Integers 4 7 Rational Numbers 4 8 Algebraic Numbers 5 9 Real Numbers 5 10 Irrational Numbers 6 11 Transcendental Numbers 6 12 Normal Numbers 6 13 Schizophrenic Numbers 7 14 Imaginary Numbers 7 15 Complex Numbers 8 16 Quaternions 8 1 1 Natural Numbers The first set of numbers to be defined is the set of natural numbers. The set is usually labeled N. This set is the smallest set that satisfies the following two conditions: 1. 1 is a natural number, usually written compactly as 1 2 N. 2. If n 2 N, then n + 1 2 N. As this is the smallest set that satisfies these conditions, it is constructed by starting with 1, adding 1 to 1, adding 1 to that, and so forth, such that N = f1; 2; 3; 4;:::g Note that set theorists will often include 0 in the natural numbers. The set of natural numbers was defined formally starting with 1 long before set theorists developed a rigorous way to define numbers as sets. In that formalism, it makes more sense to start with 0, but 1 is the more common standard because it long predates modern set theory. More advanced mathematicians may have encountered \proof by induction." This is a method of completing proofs.
    [Show full text]
  • Some New Results on Odd Perfect Numbers
    Pacific Journal of Mathematics SOME NEW RESULTS ON ODD PERFECT NUMBERS G. G. DANDAPAT,JOHN L. HUNSUCKER AND CARL POMERANCE Vol. 57, No. 2 February 1975 PACIFIC JOURNAL OF MATHEMATICS Vol. 57, No. 2, 1975 SOME NEW RESULTS ON ODD PERFECT NUMBERS G. G. DANDAPAT, J. L. HUNSUCKER AND CARL POMERANCE If ra is a multiply perfect number (σ(m) = tm for some integer ί), we ask if there is a prime p with m = pan, (pa, n) = 1, σ(n) = pα, and σ(pa) = tn. We prove that the only multiply perfect numbers with this property are the even perfect numbers and 672. Hence we settle a problem raised by Suryanarayana who asked if odd perfect numbers neces- sarily had such a prime factor. The methods of the proof allow us also to say something about odd solutions to the equation σ(σ(n)) ~ 2n. 1* Introduction* In this paper we answer a question on odd perfect numbers posed by Suryanarayana [17]. It is known that if m is an odd perfect number, then m = pak2 where p is a prime, p Jf k, and p = a z= 1 (mod 4). Suryanarayana asked if it necessarily followed that (1) σ(k2) = pa , σ(pa) = 2k2 . Here, σ is the sum of the divisors function. We answer this question in the negative by showing that no odd perfect number satisfies (1). We actually consider a more general question. If m is multiply perfect (σ(m) = tm for some integer t), we say m has property S if there is a prime p with m = pan, (pa, n) = 1, and the equations (2) σ(n) = pa , σ(pa) = tn hold.
    [Show full text]
  • On Transcendental Numbers: New Results and a Little History
    Axioms 2013, xx, 1-x; doi:10.3390/—— OPEN ACCESS axioms ISSN 2075-1680 www.mdpi.com/journal/axioms Communication On transcendental numbers: new results and a little history Solomon Marcus1 and Florin F. Nichita1,* 1 Institute of Mathematics of the Romanian Academy, 21 Calea Grivitei Street, 010702 Bucharest, Romania * Author to whom correspondence should be addressed; E-Mail: [email protected]; Tel: (+40) (0) 21 319 65 06; Fax: (+40) (0) 21 319 65 05 Received: xx / Accepted: xx / Published: xx Abstract: Attempting to create a general framework for studying new results on transcendental numbers, this paper begins with a survey on transcendental numbers and transcendence, it then presents several properties of the transcendental numbers e and π, and then it gives the proofs of new inequalities and identities for transcendental numbers. Also, in relationship with these topics, we study some implications for the theory of the Yang-Baxter equations, and we propose some open problems. Keywords: Euler’s relation, transcendental numbers; transcendental operations / functions; transcendence; Yang-Baxter equation Classification: MSC 01A05; 11D09; 11T23; 33B10; 16T25 arXiv:1502.05637v2 [math.HO] 5 Dec 2017 1. Introduction One of the most famous formulas in mathematics, the Euler’s relation: eπi +1=0 , (1) contains the transcendental numbers e and π, the imaginary number i, the constants 0 and 1, and (transcendental) operations. Beautiful, powerful and surprising, it has changed the mathematics forever. We will unveil profound aspects related to it, and we will propose a counterpart: ei π < e , (2) | − | Axioms 2013, xx 2 Figure 1. An interpretation of the inequality ei π < e .
    [Show full text]
  • On Types of Elliptic Pseudoprimes
    journal of Groups, Complexity, Cryptology Volume 13, Issue 1, 2021, pp. 1:1–1:33 Submitted Jan. 07, 2019 https://gcc.episciences.org/ Published Feb. 09, 2021 ON TYPES OF ELLIPTIC PSEUDOPRIMES LILJANA BABINKOSTOVA, A. HERNANDEZ-ESPIET,´ AND H. Y. KIM Boise State University e-mail address: [email protected] Rutgers University e-mail address: [email protected] University of Wisconsin-Madison e-mail address: [email protected] Abstract. We generalize Silverman's [31] notions of elliptic pseudoprimes and elliptic Carmichael numbers to analogues of Euler-Jacobi and strong pseudoprimes. We inspect the relationships among Euler elliptic Carmichael numbers, strong elliptic Carmichael numbers, products of anomalous primes and elliptic Korselt numbers of Type I, the former two of which we introduce and the latter two of which were introduced by Mazur [21] and Silverman [31] respectively. In particular, we expand upon the work of Babinkostova et al. [3] on the density of certain elliptic Korselt numbers of Type I which are products of anomalous primes, proving a conjecture stated in [3]. 1. Introduction The problem of efficiently distinguishing the prime numbers from the composite numbers has been a fundamental problem for a long time. One of the first primality tests in modern number theory came from Fermat Little Theorem: if p is a prime number and a is an integer not divisible by p, then ap−1 ≡ 1 (mod p). The original notion of a pseudoprime (sometimes called a Fermat pseudoprime) involves counterexamples to the converse of this theorem. A pseudoprime to the base a is a composite number N such aN−1 ≡ 1 mod N.
    [Show full text]
  • Prime Numbers in Logarithmic Intervals
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by PORTO Publications Open Repository TOrino Prime numbers in logarithmic intervals Danilo Bazzanella Dipartimento di Matematica, Politecnico di Torino, Italy [email protected] Alessandro Languasco Dipartimento di Matematica Pura e Applicata Universit`adi Padova , Italy [email protected] Alessandro Zaccagnini Dipartimento di Matematica Universit`adi Parma, Italy [email protected] First published in Transactions of the American Mathematical Society 362 (2010), no. 5, 2667-2684 published by the American Mathematical Society DOI: 10.1090/S0002-9947-09-05009-0 The original publication is available at http://www.ams.org/ 1 TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 362, Number 5, May 2010, Pages 2667–2684 S0002-9947(09)05009-0 Article electronically published on November 17, 2009 PRIME NUMBERS IN LOGARITHMIC INTERVALS DANILO BAZZANELLA, ALESSANDRO LANGUASCO, AND ALESSANDRO ZACCAGNINI Abstract. Let X be a large parameter. We will first give a new estimate for the integral moments of primes in short intervals of the type (p, p + h], where p X is a prime number and h = o(X). Then we will apply this to prove that ≤ for every λ>1/2thereexistsapositiveproportionofprimesp X such that ≤ the interval (p, p+λ log X]containsatleastaprimenumber.Asaconsequence we improve Cheer and Goldston’s result on the size of real numbers λ> 1 with the property that there is a positive proportion of integers m X ≤ such that the interval
    [Show full text]