DOCSLIB.ORG

The Prime Number Theorem a PRIMES Exposition

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
The Prime Number Theorem a PRIMES Exposition The Prime Number Theorem A PRIMES Exposition Ishita Goluguri, Toyesh Jayaswal, Andrew Lee Mentor: Chengyang Shao TABLE OF CONTENTS 1 Introduction 2 Tools from Complex Analysis 3 Entire Functions 4 Hadamard Factorization Theorem 5 Riemann Zeta Function 6 Chebyshev Functions 7 Perron Formula 8 Prime Number Theorem © Ishita Goluguri, Toyesh Jayaswal, Andrew Lee, Mentor: Chengyang Shao 2 Introduction • Euclid (300 BC): There are infinitely many primes • Legendre (1808): for primes less than 1,000,000: x π(x) ' log x © Ishita Goluguri, Toyesh Jayaswal, Andrew Lee, Mentor: Chengyang Shao 3 Progress on the Distribution of Prime Numbers • Euler: The product formula 1 X 1 Y 1 ζ(s) := = ns 1 − p−s n=1 p so (heuristically) Y 1 = log 1 1 − p−1 p • Chebyshev (1848-1850): if the ratio of π(x) and x= log x has a limit, it must be 1 • Riemann (1859): On the Number of Primes Less Than a Given Magnitude, related π(x) to the zeros of ζ(s) using complex analysis • Hadamard, de la Vallée Poussin (1896): Proved independently the prime number theorem by showing ζ(s) has no zeros of the form 1 + it, hence the celebrated prime number theorem © Ishita Goluguri, Toyesh Jayaswal, Andrew Lee, Mentor: Chengyang Shao 4 Tools from Complex Analysis Theorem (Maximum Principle) Let Ω be a domain, and let f be holomorphic on Ω. (A) jf(z)j cannot attain its maximum inside Ω unless f is constant. (B) The real part of f cannot attain its maximum inside Ω unless f is a constant. Theorem (Jensen’s Inequality) Suppose f is holomorphic on the whole complex plane and f(0) = 1. Let Mf (R) = maxjzj=R jf(z)j. Let Nf (t) be the number of zeros of f with norm ≤ t where a zero of multiplicity n is counted n times. Then R Z Nf (t) dt ≤ log Mf (R): 0 t • Relates growth of a holomorphic function to distribution of its zeroes • Used to bound the number of zeroes of an entire function © Ishita Goluguri, Toyesh Jayaswal, Andrew Lee, Mentor: Chengyang Shao 5 Theorem (Borel-Carathéodory Lemma) Suppose f = u + iv is holomorphic on the whole complex plane. Suppose u ≤ A on @B(0;R): Then 2n! jf (n)(0)j ≤ (A − u(0)) Rn • Bounds all derivatives of f at 0 using only the real part of f • Used in proof of Hadamard Factorization Theorem to prove that function is a polynomial by taking limit and showing that nth derivative approaches 0 © Ishita Goluguri, Toyesh Jayaswal, Andrew Lee, Mentor: Chengyang Shao 6 Entire Functions Definition (Order) The order of an entire function, f, is the infimum of all possible λ > 0 such that there exists constants A and B that satisfy λ jf(z)j ≤ AeBjzj • sin z, cos z have order 1 p • cos z has order 1=2 © Ishita Goluguri, Toyesh Jayaswal, Andrew Lee, Mentor: Chengyang Shao 7 Entire Functions Theorem Let f be an entire function of order λ with f(0) = 1. Then, for any " > 0 there exists a constant, C", that satisfies λ+" Nf (R) ≤ C"R Theorem Let f be an entire function of order λ with f(0) = 1 and a1; a2; ::: be the zeroes of f in non-decreasing order of norms. Then, for any " > 0, 1 X 1 < 1 ja jλ+" n=1 n In other words, the convergence index of the zeros is at most λ. Forp example, sin z and cos z have order 1, and their zeroes grow linearly while cos z has order 1=2, and its zeroes grow quadratically. © Ishita Goluguri, Toyesh Jayaswal, Andrew Lee, Mentor: Chengyang Shao 8 Hadamard Factorization Theorem Theorem (Hadamard Factorization Theorem) A complex entire function f(z) of finite order λ and roots ai can be written as 1 p ! Y z X zk f(z) = eQ(z) 1 − exp a kak n=1 n k=1 n with p = bλc, and Q(z) being some polynomial of degree at most p The theorem extends the property of polynomials to be factored based on their roots as n Y z k 1 − : ai i=1 © Ishita Goluguri, Toyesh Jayaswal, Andrew Lee, Mentor: Chengyang Shao 9 proof The proof is based off of truncating the first p terms of the series 1 z X zk log 1 − = − k an ka k=1 n which bounds the magnitude to O(Rλ+) and gives rise to the exponential factor. Now, 1 p ! Y z X zk g(z) = 1 − exp k an ka n=1 k=1 n has the same roots as f(z) and the polynomial Q(z) is found by taking the logarithm of f(z)=g(z). The degree of Q is determined by bounding the derivatives using the Borel-Carathéodory lemma. © Ishita Goluguri, Toyesh Jayaswal, Andrew Lee, Mentor: Chengyang Shao 10 Riemann Zeta Function Definition (Reimann ζ Function) 1 X 1 ζ(s) = ; s = σ + it; σ > 1: ns n=1 Theorem (Euler Product Formula) The zeta function can also be written as Y 1 ζ(s) = −s p 1 − p The Euler product formula is the analytic equivalent of the unique factorization theorem for integers. © Ishita Goluguri, Toyesh Jayaswal, Andrew Lee, Mentor: Chengyang Shao 11 Chebyshev Functions Definition (Van-Mangoldt Function) ( log p if n = pm for some prime p and some m ≥ 1 Λ(n) = 0 otherwise Definition (Chebyshev Functions) X X (x) = Λ(n);#(x) = log p: n≤x p≤x Theorem 1 ζ0 X Λ(n) (s) = − ζ ns n=1 © Ishita Goluguri, Toyesh Jayaswal, Andrew Lee, Mentor: Chengyang Shao 12 Equivalent Asymptotic Expressions The Chebyshev functions can be related to π(x) by the following integral expressions. Theorem Z x π(t) #(x) = π(x) log x + dt 2 t #(x) Z x #(t) π(x) = + 2 dt log x 2 t log t Studying the asymptotic behavior of the formulas, we see that all of the following expressions are logically equivalent: π(x) log x lim = 1 x!1 x #(x) lim = 1 x!1 x (x) lim = 1 x!1 x © Ishita Goluguri, Toyesh Jayaswal, Andrew Lee, Mentor: Chengyang Shao 13 Perron Formula The Perron Formula acts as a filter to isolate the first finitely many terms from a Dirichlet series. Theorem (Perron Formula) P1 s Let F (s) = n=1 f(n)=n be absolutely convergent for σ > σa. Then for arbitrary c; x > 0, if σ > σa − c, 1 Z c+1i xz X f(n) F (s + z) dz = ∗ 2πi z ns c−∞i n≤x where P∗ means that the last term is halved when x is an integer. Corollary For x > 0, Z x (y) 1 Z 2+i1 ζ0 xs dy = − (s) ds 2 0 y 2πi 2−i1 ζ s © Ishita Goluguri, Toyesh Jayaswal, Andrew Lee, Mentor: Chengyang Shao 14 Reimann Zeta Function Continued We define a function ξ in terms of Γ; ζ and π to obtain a functional equation that gives information about the symmetry of zero distribution. Definition Γ s ζ(s) ξ(s) = 2 : πs=2 Theorem (Functional Equation, Riemann 1859) ξ(s) = ξ(1 − s) The proof relies on the Poisson summation formula from Fourier analysis. © Ishita Goluguri, Toyesh Jayaswal, Andrew Lee, Mentor: Chengyang Shao 15 Proof of the Functional Equation s 1 Z 1 Γ ζ(s) X s=2−1 −n2πx 2 = x e dx πs=2 n=1 0 Z 1 Z 1 Z 1 = xs=2−1Ψ(x)dx = + 0 0 1 where 1 X −πn2x Ψ(x) = e : n=1 Using the Poisson summating formula, 1 1 2Ψ(x) + 1 = p 2Ψ + 1 ; x x substituting into the integral from 0 to 1, 1 Z 1 1 Z 1 ξ(s) = + xs=2−3=2Ψ dx + xs=2−1Ψ(x)dx: s(s − 1) 0 x 1 © Ishita Goluguri, Toyesh Jayaswal, Andrew Lee, Mentor: Chengyang Shao 16 1 Changing the variable x ! x s Z 1 Γ 2 ζ(s) 1 −s=2−1=2 s=2−1 ξ(s) = s=2 = + x + x Ψ(x)dx π s(s − 1) 1 Substituting s = 1 − s gives ξ(s) = ξ(1 − s). © Ishita Goluguri, Toyesh Jayaswal, Andrew Lee, Mentor: Chengyang Shao 17 p-adic Analysis • The functional relations of ζ(s) can remarkably be obtained by studying the theory of p-adic numbers. • Generally, the distance between two numbers is considered using the usual metric jx − yj, but for every prime p, a separate notion of distance can be made for Q. n • For a rational number x = p a=b, p - a; b, we define the p-adic absolute value −n as jxjp = p . Then, the p-adic distance between two numbers is defined as jx − yjp. • The p-adic absolute value is multiplicative, positive definite, and satisfies the strong triangle inequality: jx − yjp ≤ max(jxjp; jyjp) ≤ jxjp + jyjp • Examples: j7=24j2 = 8 j2 − 27j5 = 1=25 © Ishita Goluguri, Toyesh Jayaswal, Andrew Lee, Mentor: Chengyang Shao 18 Qp • Q can be completed under this metric to form the field Qp • Qp contains a subring, Zp, which is the completion of Z under j · jp • Zp can be written using an "infinite p-adic expansion" with no negative powers and numbers in Qp have finite negative powers • Example: in Q5, 1 2 X n 1 1 ::: + 5 + 5 + 1 = 5 = = − 2 1 − 5 4 Z5 n=0 4 and −1=5 = :::111 × 5 = :::444:4 × × S n × • Letting p denote the elements of p for which jxjp = 1, p = p p Z Z Q n2Z Z © Ishita Goluguri, Toyesh Jayaswal, Andrew Lee, Mentor: Chengyang Shao 19 Adèles and Idèles • The fields R and Qp can be put together to form what is called the ring of Adèles • The Adèle ring AQ is the collection of sequences x = fxpgp2P[f1g for the primes P and where for each p 2 P, xp 2 Qp and x1 2 R with almost all xp 2 Zp × • The Idèle group IQ is the collection of Adèles for which almost all xp 2 Zp and forms a group under componentwise multiplication • We can also introduce a topology on IQ with open sets being the product of × × open sets in R and Qp , making IQ is a locally compact abelian group, a Haar measure, µ, can be formed for it Q • Introduce the volume function kxk := jx1j × jxpjp and the function p2P 2 Q '(x) := exp(−πjx1j ) 1Zp (xp) and consider the integral Z '(x)kxksdµ(x) IQ © Ishita Goluguri, Toyesh Jayaswal, Andrew Lee, Mentor: Chengyang Shao 20 The ξ Function Revisited The integral can be split into the real and p-adic components to obtain Z Z ! −πjtj2 s dt Y s × ξ(s) = e jtj × jxpjpdµp (xp) : × t × R p Zp s −s=2 1 The first integral turns out to be Γ 2 π and the latter ones are 1−p−s which combine to form ζ(s).
Load more

Recommended publications
  • Zero-One Laws
    1 THE LOGIC IN COMPUTER SCIENCE COLUMN by 2 Yuri GUREVICH Electrical Engineering and Computer Science UniversityofMichigan, Ann Arb or, MI 48109-2122, USA [email protected] Zero-One Laws Quisani: I heard you talking on nite mo del theory the other day.Itisinteresting indeed that all those famous theorems ab out rst-order logic fail in the case when only nite structures are allowed. I can understand that for those, likeyou, educated in the tradition of mathematical logic it seems very imp ortantto ndoutwhichof the classical theorems can b e rescued. But nite structures are to o imp ortant all by themselves. There's got to b e deep nite mo del theory that has nothing to do with in nite structures. Author: \Nothing to do" sounds a little extremist to me. Sometimes in nite ob jects are go o d approximations of nite ob jects. Q: I do not understand this. Usually, nite ob jects approximate in nite ones. A: It may happ en that the in nite case is cleaner and easier to deal with. For example, a long nite sum may b e replaced with a simpler integral. Returning to your question, there is indeed meaningful, inherently nite, mo del theory. One exciting issue is zero- one laws. Consider, say, undirected graphs and let be a propertyofsuch graphs. For example, may b e connectivity. What fraction of n-vertex graphs have the prop erty ? It turns out that, for many natural prop erties , this fraction converges to 0 or 1asn grows to in nity. If the fraction converges to 1, the prop erty is called almost sure.
    [Show full text]
  • On the Normality of Numbers
    ON THE NORMALITY OF NUMBERS Adrian Belshaw B. Sc., University of British Columbia, 1973 M. A., Princeton University, 1976 A THESIS SUBMITTED 'IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF MASTER OF SCIENCE in the Department of Mathematics @ Adrian Belshaw 2005 SIMON FRASER UNIVERSITY Fall 2005 All rights reserved. This work may not be reproduced in whole or in part, by photocopy or other means, without the permission of the author. APPROVAL Name: Adrian Belshaw Degree: Master of Science Title of Thesis: On the Normality of Numbers Examining Committee: Dr. Ladislav Stacho Chair Dr. Peter Borwein Senior Supervisor Professor of Mathematics Simon Fraser University Dr. Stephen Choi Supervisor Assistant Professor of Mathematics Simon Fraser University Dr. Jason Bell Internal Examiner Assistant Professor of Mathematics Simon Fraser University Date Approved: December 5. 2005 SIMON FRASER ' u~~~snrllbrary DECLARATION OF PARTIAL COPYRIGHT LICENCE The author, whose copyright is declared on the title page of this work, has granted to Simon Fraser University the right to lend this thesis, project or extended essay to users of the Simon Fraser University Library, and to make partial or single copies only for such users or in response to a request from the library of any other university, or other educational institution, on its own behalf or for one of its users. The author has further granted permission to Simon Fraser University to keep or make a digital copy for use in its circulating collection, and, without changing the content, to translate the thesislproject or extended essays, if technically possible, to any medium or format for the purpose of preservation of the digital work.
    [Show full text]
  • Diophantine Approximation and Transcendental Numbers
    Diophantine Approximation and Transcendental Numbers Connor Goldstick June 6, 2017 Contents 1 Introduction 1 2 Continued Fractions 2 3 Rational Approximations 3 4 Transcendental Numbers 6 5 Irrationality Measure 7 6 The continued fraction for e 8 6.1 e's Irrationality measure . 10 7 Conclusion 11 A The Lambert Continued Fraction 11 1 Introduction Suppose we have an irrational number, α, that we want to approximate with a rational number, p=q. This question of approximating an irrational number is the primary concern of Diophantine approximation. In other words, we want jα−p=qj < . However, this method of trying to approximate α is boring, as it is possible to get an arbitrary amount of precision by making q large. To remedy this problem, it makes sense to vary with q. The problem we are really trying to solve is finding p and q such that p 1 1 jα − j < which is equivalent to jqα − pj < (1) q q2 q Solutions to this problem have applications in both number theory and in more applied fields. For example, in signal processing many of the quickest approximation algorithms are given by solutions to Diophantine approximation problems. Diophantine approximations also give many important results like the continued fraction expansion of e. One of the most interesting aspects of Diophantine approximations are its relationship with transcendental 1 numbers (a number that cannot be expressed of the root of a polynomial with rational coefficients). One of the key characteristics of a transcendental number is that it is easy to approximate with rational numbers. This paper is separated into two categories.
    [Show full text]
  • Network Intrusion Detection with Xgboost and Deep Learning Algorithms: an Evaluation Study
    2020 International Conference on Computational Science and Computational Intelligence (CSCI) Network Intrusion Detection with XGBoost and Deep Learning Algorithms: An Evaluation Study Amr Attia Miad Faezipour Abdelshakour Abuzneid Computer Science & Engineering Computer Science & Engineering Computer Science & Engineering University of Bridgeport, CT 06604, USA University of Bridgeport, CT 06604, USA University of Bridgeport, CT 06604, USA [email protected] [email protected] [email protected] Abstract— This paper introduces an effective Network Intrusion In the KitNET model introduced in [2], an unsupervised Detection Systems (NIDS) framework that deploys incremental technique is introduced for anomaly-based intrusion statistical damping features of the packets along with state-of- detection. Incremental statistical feature extraction of the the-art machine/deep learning algorithms to detect malicious packets is passed through ensembles of autoencoders with a patterns. A comprehensive evaluation study is conducted predefined threshold. The model calculates the Root Mean between eXtreme Gradient Boosting (XGBoost) and Artificial Neural Networks (ANN) where feature selection and/or feature Square (RMS) error to detect anomaly behavior. The higher dimensionality reduction techniques such as Principal the calculated RMS at the output, the higher probability of Component Analysis (PCA) and Linear Discriminant Analysis suspicious activity. (LDA) are also integrated into the models to decrease the system Supervised learning has achieved very decent results with complexity for achieving fast responses. Several experimental algorithms such as Random Forest, ZeroR, J48, AdaBoost, runs confirm how powerful machine/deep learning algorithms Logit Boost, and Multilayer Perceptron [3]. Machine/deep are for intrusion detection on known attacks when combined learning-based algorithms for NIDS have been extensively with the appropriate features extracted.
    [Show full text]
  • Network Topology Generators: Degree-Based Vs
    Network Topology Generators: Degree-Based vs. Structural Hongsuda Tangmunarunkit Ramesh Govindan Sugih Jamin USC-ISI ICSI Univ. of Michigan [email protected] [email protected] [email protected] Scott Shenker Walter Willinger ICSI AT&T Research [email protected] [email protected] ABSTRACT in the Internet more closely; we find that degree-based generators Following the long-held belief that the Internet is hierarchical, the produce a form of hierarchy that closely resembles the loosely hi- network topology generators most widely used by the Internet re- erarchical nature of the Internet. search community, Transit-Stub and Tiers, create networks with a deliberately hierarchical structure. However, in 1999 a seminal Categories and Subject Descriptors paper by Faloutsos et al. revealed that the Internet’s degree distri- bution is a power-law. Because the degree distributions produced C.2.1 [Computer-Communication Networks]: Network Archi- by the Transit-Stub and Tiers generators are not power-laws, the tecture and Design—Network topology; I.6.4 [Simulation and Mod- research community has largely dismissed them as inadequate and eling]: Model Validation and Analysis proposed new network generators that attempt to generate graphs with power-law degree distributions. General Terms Contrary to much of the current literature on network topology generators, this paper starts with the assumption that it is more im- Performance, Measurement portant for network generators to accurately model the large-scale structure of the Internet (such as its hierarchical structure) than to Keywords faithfully imitate its local properties (such as the degree distribu- tion). The purpose of this paper is to determine, using various Network topology, hierarchy, topology characterization, topology topology metrics, which network generators better represent this generators, structural generators, degree-based generators, topol- large-scale structure.
    [Show full text]
  • Some of Erdös' Unconventional Problems in Number Theory, Thirty
    Some of Erdös’ unconventional problems in number theory, thirty-four years later Gérald Tenenbaum To cite this version: Gérald Tenenbaum. Some of Erdös’ unconventional problems in number theory, thirty-four years later. Erdös centennial, János Bolyai Math. Soc., pp.651-681, 2013. hal-01281530 HAL Id: hal-01281530 https://hal.archives-ouvertes.fr/hal-01281530 Submitted on 2 Mar 2016 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. (26/5/2014, 16h36) Some of Erd˝os’ unconventional problems in number theory, thirty-four years later G´erald Tenenbaum There are many ways to recall Paul Erd˝os’ memory and his special way of doing mathematics. Ernst Straus described him as “the prince of problem solvers and the absolute monarch of problem posers”. Indeed, those mathematicians who are old enough to have attended some of his lectures will remember that, after his talks, chairmen used to slightly depart from standard conduct, not asking if there were any questions but if there were any answers. In the address that he forwarded to Mikl´os Simonovits for Erd˝os’ funeral, Claude Berge mentions a conversation he had with Paul in the gardens of the Luminy Campus, near Marseilles, in September 1995.
    [Show full text]
  • There Are Infinitely Many Mersenne Primes
    Scan to know paper details and author's profile There are Infinitely Many Mersenne Primes Fengsui Liu ZheJiang University Alumnus ABSTRACT From the entire set of natural numbers successively deleting the residue class 0 mod a prime, we retain this prime and possibly delete another one prime retained. Then we invent a recursive sieve method for exponents of Mersenne primes. This is a novel algorithm on sets of natural numbers. The algorithm mechanically yields a sequence of sets of exponents of almost Mersenne primes, which converge to the set of exponents of all Mersenne primes. The corresponding cardinal sequence is strictly increasing. We capture a particular order topological structure of the set of exponents of all Mersenne primes. The existing theory of this structure allows us to prove that the set of exponents of all Mersenne primes is an infnite set . Keywords and phrases: Mersenne prime conjecture, modulo algorithm, recursive sieve method, limit of sequence of sets. Classification: FOR Code: 010299 Language: English LJP Copyright ID: 925622 Print ISSN: 2631-8490 Online ISSN: 2631-8504 London Journal of Research in Science: Natural and Formal 465U Volume 20 | Issue 3 | Compilation 1.0 © 2020. Fengsui Liu. This is a research/review paper, distributed under the terms of the Creative Commons Attribution-Noncom-mercial 4.0 Unported License http://creativecommons.org/licenses/by-nc/4.0/), permitting all noncommercial use, distribution, and reproduction in any medium, provided the original work is properly cited. There are Infinitely Many Mersenne Primes Fengsui Liu ____________________________________________ ABSTRACT From the entire set of natural numbers successively deleting the residue class 0 mod a prime, we retain this prime and possibly delete another one prime retained.
    [Show full text]
  • An Elementary Proof That Almost All Real Numbers Are Normal
    Acta Univ. Sapientiae, Mathematica, 2, 1 (2010) 99–110 An elementary proof that almost all real numbers are normal Ferdin´and Filip Jan Sustekˇ Department of Mathematics, Department of Mathematics and Faculty of Education, Institute for Research and J. Selye University, Applications of Fuzzy Modeling, Roln´ıckej ˇskoly 1519, Faculty of Science, 945 01, Kom´arno, Slovakia University of Ostrava, email: [email protected] 30. dubna 22, 701 03 Ostrava 1, Czech Republic email: [email protected] Abstract. A real number is called normal if every block of digits in its expansion occurs with the same frequency. A famous result of Borel is that almost every number is normal. Our paper presents an elementary proof of that fact using properties of a special class of functions. 1 Introduction The concept of normal number was introduced by Borel. A number is called normal if in its base b expansion every block of digits occurs with the same frequency. More exact definition is Definition 1 A real number x ∈ (0,1) is called simply normal to base b ≥ 2 if its base b expansion is 0.c1c2c3 ... and #{n ≤ N | c = a} 1 lim n = for every a ∈ {0,...,b − 1} . N N b 2010 Mathematics→∞ Subject Classification: 11K16, 26A30 Key words and phrases: normal number, measure 99 100 F. Filip, J. Sustekˇ A number is called normal to base b if for every block of digits a1 ...aL, L ≥ 1 #{n ≤ N − L | c = a ,...,c = a } 1 lim n+1 1 n+L L = . N N bL A number is called→∞ absolutely normal if it is normal to every base b ≥ 2.
    [Show full text]
  • GH HARDY and JE LITTLEWOOD, Cambridge, England. 1
    Some More Integral Inequalities, by G. H. HARDYand J. E. LITTLEWOOD,Cambridge, England. 1. This is in a sense a companion to an earlier note with a similar title(1) ; and the contents of both notes were suggested by a more systematic investigation concerned primarily with series. Both in the note just referred to and here we are concerned with special cases of a general theorem which we have stated without proof elsewhere(2), and also (and more particularly) with their integral analogues. These special cases are peculiar, and deserve special treatment, because in them we can go further than in the general case and determine the best value of the constant K of the inequa- lity. The actual inequality proved here, which corresponds to the case p = q = r of " Theorem 25 ", is much easier than that proved in Note X(3), but has some distinguishing features. There is generally an attained maximum, which is unusual in such problems ; and the proof that the maximal solution is effectively unique involves points of some independent interest. Integral theorems. 2. In what follows it is assumed throughout that f and g are positive (in the wide sense) and measurable. Theorem 1. If and (2.1) then (2.2) where (1) G. H. Hardy and J. E. Littlewood : "Notes on the theory of series (X) ; Some more inequalities", Journal of London Math. Soc. 3 (1928), 294-299. (2) G. H. Hardy and J. E. Littlewood : " Elementary theorems concern- ing power series with positive coefficients and moment constants of positive func- tions ", Journal fur Math., 157 (1927), 141-158.
    [Show full text]
  • Transcendental Number Theory, by Alan Baker, Cambridge Univ. Press, New York, 1975, X + 147 Pp., $13.95
    1370 BOOK REVIEWS REFERENCES 1. J. Horvâth, Topological vector spaces and distributions, Addison-Wcsley, Reading, Mass., 1966. 2. A. P. Robertson and W. J. Robertson, Topological vector spaces, Cambridge Tracts in Mathematics and Physics, no. 53 Cambridge Univ. Press, New York, 1964. 3. H. H. Schaefer, Topological vector spaces, MacMillan, New York, 1966. 4. F. Treves, Topological vector spaces, distributions and kernels, Academic Press, New York, 1967. L. WAELBROECK BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY Volume 84, Number 6, November 1978 © American Mathematical Society 1978 Transcendental number theory, by Alan Baker, Cambridge Univ. Press, New York, 1975, x + 147 pp., $13.95. Lectures on transcendental numbers, by Kurt Mahler, Edited and completed by B. Divis and W. J. LeVeque, Lecture Notes in Math., no. 546, Springer- Verlag, Berlin, Heidelberg, New York, 1976, xxi + 254 pp., $10.20. Nombres transcendants, by Michel Waldschmidt, Lecture Notes in Math., no. 402, Springer-Verlag, Berlin and New York, 1974, viii + 277 pp., $10.30. The last dozen years have been a golden age for transcendental number theory. It has scored successes on its own ground, while its methods have triumphed over problems in classical number theory involving exponential sums, class numbers, and Diophantine equations. Few topics in mathematics have such general appeal within the discipline as transcendency. Many of us learned of the circle squaring problem before college, and became acquainted with Cantor's existence proof, Liouville's construction, and even Hermite's proof of the transcendence of e well before the close of our undergraduate life. How can we learn more? Sophisticated readers may profitably consult the excellent survey articles of N.
    [Show full text]
  • Essential Skills in Mathematics a Comparative Analysis of American and Japanese Assessments of Eighth-Graders
    NATIONAL CENTER FOR EDUCATION STATISTICS Essential Skills in Mathematics A Comparative Analysis of American and Japanese Assessments of Eighth-Graders John A. Dossey Department of Mathematics Illinois State University Lois Peak and Dawn Nelson, Project Officers National Center for Education Statistics U.S. Department of Education Office of Educational Research and Improvement NCES 97-885 For sale by the U.S. Ckwemment Riming Office Superintendent of Dncuments, Mail Stop SSOP, Wadungton, DC 20402-932S U.S. Department of Education Richard W. Riley Secretaty Office of Educational Research and Improvement Marshall S. Smith Acting Assistant Secreta~ National Center for Education Statistics Pascal D. Forgione, Jr. Commissioner The National Center for Education Statistics (NCES) is the primary federal entity for collecting, analyzing, and reporting data related to education in the United States and other nations. It fulfills a congressional mandate to collect, collate, analyze, and report full and complete statistics on the condition of education in the United States; conduct and publish reports and specialized analyses of the meaning and significance of such statistics; assist state and local education agencies in improving their statistical systems; and review and report on education activities in foreign countries. NCES activities are designed to address high prioriy education data needs; provide consistent, reliable, complete, and accurate indicators of education status and trends; and report timely, useful, and high quality data to the U.S. Department of Education, the Congress, the states, other education policymakers, practitioners, data users, and the general public. We strive to make our products available in a variety of formats and in language that is appropriate to a variety of audiences.
    [Show full text]
  • 25 Primes in Arithmetic Progression
    b2530 International Strategic Relations and China’s National Security: World at the Crossroads This page intentionally left blank b2530_FM.indd 6 01-Sep-16 11:03:06 AM Published by World Scientific Publishing Co. Pte. Ltd. 5 Toh Tuck Link, Singapore 596224 SA office: 27 Warren Street, Suite 401-402, Hackensack, NJ 07601 K office: 57 Shelton Street, Covent Garden, London WC2H 9HE Library of Congress Cataloging-in-Publication Data Names: Ribenboim, Paulo. Title: Prime numbers, friends who give problems : a trialogue with Papa Paulo / by Paulo Ribenboim (Queen’s niversity, Canada). Description: New Jersey : World Scientific, 2016. | Includes indexes. Identifiers: LCCN 2016020705| ISBN 9789814725804 (hardcover : alk. paper) | ISBN 9789814725811 (softcover : alk. paper) Subjects: LCSH: Numbers, Prime. Classification: LCC QA246 .R474 2016 | DDC 512.7/23--dc23 LC record available at https://lccn.loc.gov/2016020705 British Library Cataloguing-in-Publication Data A catalogue record for this book is available from the British Library. Copyright © 2017 by World Scientific Publishing Co. Pte. Ltd. All rights reserved. This book, or parts thereof, may not be reproduced in any form or by any means, electronic or mechanical, including photocopying, recording or any information storage and retrieval system now known or to be invented, without written permission from the publisher. For photocopying of material in this volume, please pay a copying fee through the Copyright Clearance Center, Inc., 222 Rosewood Drive, Danvers, MA 01923, SA. In this case permission to photocopy is not required from the publisher. Typeset by Stallion Press Email: [email protected] Printed in Singapore YingOi - Prime Numbers, Friends Who Give Problems.indd 1 22-08-16 9:11:29 AM October 4, 2016 8:36 Prime Numbers, Friends Who Give Problems 9in x 6in b2394-fm page v Qu’on ne me dise pas que je n’ai rien dit de nouveau; la disposition des mati`eres est nouvelle.
    [Show full text]