DOCSLIB.ORG

Special Prime Numbers and Discrete Logs in Finite Prime Fields

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Special Prime Numbers and Discrete Logs in Finite Prime Fields MATHEMATICS OF COMPUTATION Volume 71, Number 237, Pages 363{377 S 0025-5718(00)01308-9 Article electronically published on October 17, 2000 SPECIAL PRIME NUMBERS AND DISCRETE LOGS IN FINITE PRIME FIELDS IGOR A. SEMAEV Abstract. AsetA of primes p involving numbers such as abt + c,where jaj; jbj; jcj = O(1) and t !1, is defined. An algorithm for computing dis- crete logs in the finite field of order p with p 2 A is suggested. Its heuris- 1 32 1=3 32 1=3 ··· tic expected running time is Lp[ 3 ;( 9 ) ]for(9 ) =1:526 ,where α 1−α Lp[α; β]=exp((β + o(1)) ln p(ln ln p) )asp !1,0<α<1, and 0 <β. At present, the most efficient algorithm for computing discrete logs in the finite field of order p for general p is Schirokauer's adaptation of the 1 64 1=3 Number Field Sieve. Its heuristic expected running time is Lp[ 3 ;( 9 ) ]for 64 1=3 ··· 2 ( 9 ) =1:9229 .Usingp A rather than general p does not enhance the performance of Schirokauer's algorithm. The definition of the set A and the algorithm suggested in this paper are based on a more general congruence than that of the Number Field Sieve. The congruence is related to the resultant of integer polynomials. We also give a number of useful identities for resultants that allow us to specify this congruence for some p. Let Fp be a finite field of prime order p,anda 2 Fp its primitive element. The discrete log problem in Fp is as follows: given a nonzero b 2 Fp, find the residue y y(mod p − 1) for y such that a = b in Fp. The security of several cryptographic systems depends on the difficulty of com- puting discrete logs [1, 2]. The best known algorithm for computing discrete logs in Fp with an arbitrary prime p is that suggested by Schirokauer in [3]. Its heuristic 1 64 1=3 64 1=3 ··· expected running time is L[ 3 ;( 9 ) ]for(9 ) =1:9229 . Here, as usual, α 1−α L[α; β]=Lp[α; β]=exp((β + o(1)) ln p ln ln p) as p !1,0<α<1, and 0 <β. This method is an adaptation of the popular Number Field Sieve algorithm (NFS), which has been used previously for factor- ization. It comes from the Gaussian integers method derived in [4] for computing discrete logs in Fp. The NFS algorithm is based on the congruence (1) f(m) ≡ 0(mod p); where f(x) is an irreducible polynomial in Z[x]andm 2 Z. The main parameter of the method is k =degf(x); the other parameters, such as m and the coefficients of f(x), are bounded by p1=k in absolute value. There exists p for which the coefficients of f(x) are no larger than po(1=k) in absolute value. For example, let abt + c ≡ 0(mod p)forjaj; jbj; jcj = O(1) as t !1. Thenwehave(1)with k t0 (t+t0)=k f(x)=ax + cb ,andm = b ,wheret ≡−t0(mod k)and0≤ t0 <k. Received by the editor July 16, 1998 and, in revised form, April 3, 2000. 2000 Mathematics Subject Classification. Primary 11Y16, 94A60. Key words and phrases. Cryptography, discrete logarithms, Number Field Sieve. c 2000 American Mathematical Society 363 License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use 364 I. A. SEMAEV p If k = o( ln p), then p is as required. Such p are called special prime numbers in [5]. K. McCurley offers a $100 reward for breaking the Diffie-Hellman scheme with the prime p =2· 739 · q +1,where q =(7149 − 1)=6 [6]. This requires solving the discrete log problem in Fp. The algorithms for solving the discrete log problem in Fp suggested by Gordon [5] and Schirokauer [3] give no advantage to special primes over general primes. There is yet another algorithm in Gordon's work 2 designed specifically for special p, but its expected running time is Lp[ 5 ;1; 004]. In other words, it is asymptotically slower than the algorithms for general p.In[7] McCurley's challenging problem was solved. In this paper, we define a set A of primes p that includes numbers of the form abt + c or their prime factors. We suggest an algorithm for solving the discrete log 2 1 32 1=3 32 1=3 problem in Fp for p A in heuristic expected running time Lp[ 3 ;( 9 ) ]; ( 9 ) = 1:526 ···. The definition of the set A and the algorithm are based on a more general congruence than (1), namely, (2) Res(f;g) ≡ 0(mod p); where Res is the resultant of the polynomials n1 ··· n2 ··· f(x)=a0x + + an1−1x + an1 and g(x)=b0x + + bn2−1x + bn2 over Z. By definition [8] Y Y Y n2 n1 − n2 − n2n1 n1 Res(f;g)=a0 b0 (α β)=a0 g(α)=( 1) b0 f(β); α,β α β where α and β range over the roots of f(x)andg(x), respectively, with multiplic- ities taken into account. Obviously, (1) is the special case of (2) corresponding to deg g(x)=1. 0 Let jfj =maxi jaij and jgj =maxj jbjj. Consider the set A of the primes p for which congruence (2) is valid. The degrees of the polynomials are related to the coefficients as δ 1=3 1=3 ln p ≤ k = n1 + n2 ≤ ((3=2) + o(1))(ln p= ln ln p) ; (3) o(1=k) 1=k n2 = o(n1); jf|≤p ; jg|≈p for any fixed positive δ<1=3. For two positive real-valued functions a(x)andb(x) we write a(x) ≈ b(x)iflna(x)= ln b(x) ! 1asx !1. We estimate the complexity 0 2=k2 of the discrete log problem in Fp with p 2 A by ≈ p operations. In the set A, we include those primes p 2 A0 for which k = ((3=2)1=3 + o(1))(ln p= ln ln p)1=3 in 2=k2 ≈ 1 32 1=3 2 (3). It is easy to see that p Lp[ 3 ;( 9 ) ]forp A. The algorithm has two parts. The first is computing the discrete logs to some base; this only must be done ≈ 2=k2 once for a given p and requires p operations. The second finds thep logarithm 2 ≈ (1+ 2)=2k2 of anp individual b Fp. It is asymptotically faster and takes p for (1 + 2)=2=1:914 ···. We believe that our algorithm would solve McCurley's challenging problem faster than those suggested in [3, 5, 7]. " Let AX be a set of primes p<Xfrom A. The definition suggests that jAX |≥X for any " = "(X) such that "(X) ! 0asX !1. Note that recognizing p 2 A requires generally more calculations than solving the discrete log problem in Fp. We note also that the prime numbers p; p !1,suchasabt + c or their big prime factors, are in the set A for ln(maxfjaj; jbj; jcjg)=o(ln1=3 p ln ln2=3 p). License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use SPECIAL PRIME NUMBERS AND DISCRETE LOGS 365 We stress that our method differs from those of [3, 5]. Indeed, evaluating an individual logarithm by the methods of [3, 5] involves finding an integer l such that l a b ≡ q1q2 ···qr(mod p) 1=k for prime integers qi ≤ p . Next the logarithm of each qi must be evaluated. For this purpose, authors of [3, 5] sieve the values of polynomials f(x)=fqi (x) depen- dent on qi for which (1) holds. The advantage of our method is that congruence (2) or (1) does not depend on qi (see Section 5). This allows us to apply relations (3) or use a polynomial f(x) with small coefficients. In other words, we make extensive use of the structure of special primes. This author has already used congruence (2) for factoring purposes [9]; simi- lar but more special results are obtained in [10]. Section 7 contains some useful identities for resultants derived in [9]. The author is grateful to MacCentre, Moscow, for technical assistance in prepa- ration of this paper and to Olga Sipacheva for her transformations of my English prose. 1. Algebraic numbers In this section, we recall some results from algebraic number theory that are used in what follows. We assume that the polynomials f(x)andg(x) in (2) are irreducible over Q.Letα and β be roots of f(x)andg(x), respectively. Then K1 = Q(α)andK2 = Q(β) are fields of algebraic numbers of degrees n1 and n2. Let Oi be the ring of integers in Ki. Generally, α and β are not integers over Q. But α1 = a0α, β1 = b0β are integers. They are roots of the polynomials − − n1 n1 1 ··· n1 1 f1(x)=x + a1x + + a0 an1 ; − − n2 n2 1 ··· n2 1 g1(x)=x + b1x + + b0 bn2 ; respectively. Proposition 1. Let gcd(a0;an1 )=1,andletR denote the ideal that is the gcd of the ideals α1O1 and a0O1 in O1.Then n1−1 Norm R = ja0j : Proposition 1 is proved in [9]. Put k k−1 h(x)=c0x + c1x + ···+ ck 2 Z[x]: O −1 O Proposition 2. Let gcd(a0;an1 )=1and R1 =(a0 1)R .Thenh(α) 1 = −k QR1 ,whereQ is an integer ideal in K1 with j k |≤ n1 k=2j jkj jn1 Norm Q = a0 Norm h(α) (k +1) (n1 +1) f h : Proof.
Load more

Recommended publications
  • The Enigmatic Number E: a History in Verse and Its Uses in the Mathematics Classroom
    To appear in MAA Loci: Convergence The Enigmatic Number e: A History in Verse and Its Uses in the Mathematics Classroom Sarah Glaz Department of Mathematics University of Connecticut Storrs, CT 06269 [email protected] Introduction In this article we present a history of e in verse—an annotated poem: The Enigmatic Number e . The annotation consists of hyperlinks leading to biographies of the mathematicians appearing in the poem, and to explanations of the mathematical notions and ideas presented in the poem. The intention is to celebrate the history of this venerable number in verse, and to put the mathematical ideas connected with it in historical and artistic context. The poem may also be used by educators in any mathematics course in which the number e appears, and those are as varied as e's multifaceted history. The sections following the poem provide suggestions and resources for the use of the poem as a pedagogical tool in a variety of mathematics courses. They also place these suggestions in the context of other efforts made by educators in this direction by briefly outlining the uses of historical mathematical poems for teaching mathematics at high-school and college level. Historical Background The number e is a newcomer to the mathematical pantheon of numbers denoted by letters: it made several indirect appearances in the 17 th and 18 th centuries, and acquired its letter designation only in 1731. Our history of e starts with John Napier (1550-1617) who defined logarithms through a process called dynamical analogy [1]. Napier aimed to simplify multiplication (and in the same time also simplify division and exponentiation), by finding a model which transforms multiplication into addition.
    [Show full text]
  • Exponent and Logarithm Practice Problems for Precalculus and Calculus
    Exponent and Logarithm Practice Problems for Precalculus and Calculus 1. Expand (x + y)5. 2. Simplify the following expression: √ 2 b3 5b +2 . a − b 3. Evaluate the following powers: 130 =,(−8)2/3 =,5−2 =,81−1/4 = 10 −2/5 4. Simplify 243y . 32z15 6 2 5. Simplify 42(3a+1) . 7(3a+1)−1 1 x 6. Evaluate the following logarithms: log5 125 = ,log4 2 = , log 1000000 = , logb 1= ,ln(e )= 1 − 7. Simplify: 2 log(x) + log(y) 3 log(z). √ √ √ 8. Evaluate the following: log( 10 3 10 5 10) = , 1000log 5 =,0.01log 2 = 9. Write as sums/differences of simpler logarithms without quotients or powers e3x4 ln . e 10. Solve for x:3x+5 =27−2x+1. 11. Solve for x: log(1 − x) − log(1 + x)=2. − 12. Find the solution of: log4(x 5)=3. 13. What is the domain and what is the range of the exponential function y = abx where a and b are both positive constants and b =1? 14. What is the domain and what is the range of f(x) = log(x)? 15. Evaluate the following expressions. (a) ln(e4)= √ (b) log(10000) − log 100 = (c) eln(3) = (d) log(log(10)) = 16. Suppose x = log(A) and y = log(B), write the following expressions in terms of x and y. (a) log(AB)= (b) log(A) log(B)= (c) log A = B2 1 Solutions 1. We can either do this one by “brute force” or we can use the binomial theorem where the coefficients of the expansion come from Pascal’s triangle.
    [Show full text]
  • Leonhard Euler: His Life, the Man, and His Works∗
    SIAM REVIEW c 2008 Walter Gautschi Vol. 50, No. 1, pp. 3–33 Leonhard Euler: His Life, the Man, and His Works∗ Walter Gautschi† Abstract. On the occasion of the 300th anniversary (on April 15, 2007) of Euler’s birth, an attempt is made to bring Euler’s genius to the attention of a broad segment of the educated public. The three stations of his life—Basel, St. Petersburg, andBerlin—are sketchedandthe principal works identified in more or less chronological order. To convey a flavor of his work andits impact on modernscience, a few of Euler’s memorable contributions are selected anddiscussedinmore detail. Remarks on Euler’s personality, intellect, andcraftsmanship roundout the presentation. Key words. LeonhardEuler, sketch of Euler’s life, works, andpersonality AMS subject classification. 01A50 DOI. 10.1137/070702710 Seh ich die Werke der Meister an, So sehe ich, was sie getan; Betracht ich meine Siebensachen, Seh ich, was ich h¨att sollen machen. –Goethe, Weimar 1814/1815 1. Introduction. It is a virtually impossible task to do justice, in a short span of time and space, to the great genius of Leonhard Euler. All we can do, in this lecture, is to bring across some glimpses of Euler’s incredibly voluminous and diverse work, which today fills 74 massive volumes of the Opera omnia (with two more to come). Nine additional volumes of correspondence are planned and have already appeared in part, and about seven volumes of notebooks and diaries still await editing! We begin in section 2 with a brief outline of Euler’s life, going through the three stations of his life: Basel, St.
    [Show full text]
  • Calculus Terminology
    AP Calculus BC Calculus Terminology Absolute Convergence Asymptote Continued Sum Absolute Maximum Average Rate of Change Continuous Function Absolute Minimum Average Value of a Function Continuously Differentiable Function Absolutely Convergent Axis of Rotation Converge Acceleration Boundary Value Problem Converge Absolutely Alternating Series Bounded Function Converge Conditionally Alternating Series Remainder Bounded Sequence Convergence Tests Alternating Series Test Bounds of Integration Convergent Sequence Analytic Methods Calculus Convergent Series Annulus Cartesian Form Critical Number Antiderivative of a Function Cavalieri’s Principle Critical Point Approximation by Differentials Center of Mass Formula Critical Value Arc Length of a Curve Centroid Curly d Area below a Curve Chain Rule Curve Area between Curves Comparison Test Curve Sketching Area of an Ellipse Concave Cusp Area of a Parabolic Segment Concave Down Cylindrical Shell Method Area under a Curve Concave Up Decreasing Function Area Using Parametric Equations Conditional Convergence Definite Integral Area Using Polar Coordinates Constant Term Definite Integral Rules Degenerate Divergent Series Function Operations Del Operator e Fundamental Theorem of Calculus Deleted Neighborhood Ellipsoid GLB Derivative End Behavior Global Maximum Derivative of a Power Series Essential Discontinuity Global Minimum Derivative Rules Explicit Differentiation Golden Spiral Difference Quotient Explicit Function Graphic Methods Differentiable Exponential Decay Greatest Lower Bound Differential
    [Show full text]
  • Hydraulics Manual Glossary G - 3
    Glossary G - 1 GLOSSARY OF HIGHWAY-RELATED DRAINAGE TERMS (Reprinted from the 1999 edition of the American Association of State Highway and Transportation Officials Model Drainage Manual) G.1 Introduction This Glossary is divided into three parts: · Introduction, · Glossary, and · References. It is not intended that all the terms in this Glossary be rigorously accurate or complete. Realistically, this is impossible. Depending on the circumstance, a particular term may have several meanings; this can never change. The primary purpose of this Glossary is to define the terms found in the Highway Drainage Guidelines and Model Drainage Manual in a manner that makes them easier to interpret and understand. A lesser purpose is to provide a compendium of terms that will be useful for both the novice as well as the more experienced hydraulics engineer. This Glossary may also help those who are unfamiliar with highway drainage design to become more understanding and appreciative of this complex science as well as facilitate communication between the highway hydraulics engineer and others. Where readily available, the source of a definition has been referenced. For clarity or format purposes, cited definitions may have some additional verbiage contained in double brackets [ ]. Conversely, three “dots” (...) are used to indicate where some parts of a cited definition were eliminated. Also, as might be expected, different sources were found to use different hyphenation and terminology practices for the same words. Insignificant changes in this regard were made to some cited references and elsewhere to gain uniformity for the terms contained in this Glossary: as an example, “groundwater” vice “ground-water” or “ground water,” and “cross section area” vice “cross-sectional area.” Cited definitions were taken primarily from two sources: W.B.
    [Show full text]
  • The Logarithmic Chicken Or the Exponential Egg: Which Comes First?
    The Logarithmic Chicken or the Exponential Egg: Which Comes First? Marshall Ransom, Senior Lecturer, Department of Mathematical Sciences, Georgia Southern University Dr. Charles Garner, Mathematics Instructor, Department of Mathematics, Rockdale Magnet School Laurel Holmes, 2017 Graduate of Rockdale Magnet School, Current Student at University of Alabama Background: This article arose from conversations between the first two authors. In discussing the functions ln(x) and ex in introductory calculus, one of us made good use of the inverse function properties and the other had a desire to introduce the natural logarithm without the classic definition of same as an integral. It is important to introduce mathematical topics using a minimal number of definitions and postulates/axioms when results can be derived from existing definitions and postulates/axioms. These are two of the ideas motivating the article. Thus motivated, the authors compared manners with which to begin discussion of the natural logarithm and exponential functions in a calculus class. x A related issue is the use of an integral to define a function g in terms of an integral such as g()() x f t dt . c We believe that this is something that students should understand and be exposed to prior to more advanced x x sin(t ) 1 “surprises” such as Si(x ) dt . In particular, the fact that ln(x ) dt is extremely important. But t t 0 1 must that fact be introduced as a definition? Can the natural logarithm function arise in an introductory calculus x 1 course without the
    [Show full text]
  • Differentiating Logarithm and Exponential Functions
    Differentiating logarithm and exponential functions mc-TY-logexp-2009-1 This unit gives details of how logarithmic functions and exponential functions are differentiated from first principles. In order to master the techniques explained here it is vital that you undertake plenty of practice exercises so that they become second nature. After reading this text, and/or viewing the video tutorial on this topic, you should be able to: • differentiate ln x from first principles • differentiate ex Contents 1. Introduction 2 2. Differentiation of a function f(x) 2 3. Differentiation of f(x)=ln x 3 4. Differentiation of f(x) = ex 4 www.mathcentre.ac.uk 1 c mathcentre 2009 1. Introduction In this unit we explain how to differentiate the functions ln x and ex from first principles. To understand what follows we need to use the result that the exponential constant e is defined 1 1 as the limit as t tends to zero of (1 + t) /t i.e. lim (1 + t) /t. t→0 1 To get a feel for why this is so, we have evaluated the expression (1 + t) /t for a number of decreasing values of t as shown in Table 1. Note that as t gets closer to zero, the value of the expression gets closer to the value of the exponential constant e≈ 2.718.... You should verify some of the values in the Table, and explore what happens as t reduces further. 1 t (1 + t) /t 1 (1+1)1/1 = 2 0.1 (1+0.1)1/0.1 = 2.594 0.01 (1+0.01)1/0.01 = 2.705 0.001 (1.001)1/0.001 = 2.717 0.0001 (1.0001)1/0.0001 = 2.718 We will also make frequent use of the laws of indices and the laws of logarithms, which should be revised if necessary.
    [Show full text]
  • Math1414-Laws-Of-Logarithms.Pdf
    Properties of Logarithms Since the exponential and logarithmic functions with base a are inverse functions, the Laws of Exponents give rise to the Laws of Logarithms. Laws of Logarithms: Let a be a positive number, with a ≠ 1. Let A > 0, B > 0, and C be any real numbers. Law Description 1. log a (AB) = log a A + log a B The logarithm of a product of numbers is the sum of the logarithms of the numbers. ⎛⎞A The logarithm of a quotient of numbers is the 2. log a ⎜⎟ = log a A – log a B ⎝⎠B difference of the logarithms of the numbers. C 3. log a (A ) = C log a A The logarithm of a power of a number is the exponent times the logarithm of the number. Example 1: Use the Laws of Logarithms to rewrite the expression in a form with no logarithm of a product, quotient, or power. ⎛⎞5x3 (a) log3 ⎜⎟2 ⎝⎠y (b) ln 5 x2 ()z+1 Solution (a): 3 ⎛⎞5x 32 log333⎜⎟2 =− log() 5xy log Law 2 ⎝⎠y 32 =+log33 5 logxy − log 3 Law 1 =+log33 5 3logxy − 2log 3 Law 3 By: Crystal Hull Example 1 (Continued) Solution (b): 1 ln5 xz22()+= 1 ln( xz() + 1 ) 5 1 2 =+5 ln()xz() 1 Law 3 =++1 ⎡⎤lnxz2 ln() 1 Law 1 5 ⎣⎦ 112 =++55lnxz ln() 1 Distribution 11 =++55()2lnxz ln() 1 Law 3 21 =+55lnxz ln() + 1 Multiplication Example 2: Rewrite the expression as a single logarithm. (a) 3log44 5+− log 10 log4 7 1 2 (b) logx −+ 2logyz2 log( 9 ) Solution (a): 3 3log44 5+−=+− log 10 log 4 7 log 4 5 log 4 10 log 4 7 Law 3 3 =+−log444 125 log 10 log 7 Because 5= 125 =⋅−log44() 125 10 log 7 Law 1 =−log4 () 1250 log4 7 Simplification ⎛⎞1250 = log4 ⎜⎟ Law 2 ⎝⎠7 By: Crystal Hull Example 2 (Continued):
    [Show full text]
  • H:\My Documents\AAOF\Front and End Material\AAOF2-Preface
    The factorial function occurs widely in function theory; especially in the denominators of power series expansions of many transcendental functions. It also plays an important role in combinatorics [Section 2:14]. Because they too arise in the context of combinatorics, Stirling numbers of the second kind are discussed in Section 2:14 [those of the first kind find a home in Chapter 18]. Double and triple factorial functions are described in Section 2:14. 2:1 NOTATION The factorial function of n, also spoken of as “n factorial”, is generally given the symbol n!. It is represented byn in older literature. The symbol (n) is occasionally encountered. 2:2 BEHAVIOR The factorial function is defined only for nonnegative integer argument and is itself a positive integer. Because of its explosive increase, a plot of n!versusn is not very informative. Figure 2-1 is a graph of the logarithm (to base 10) of n!versusn. Note that 70! 10100. 2:3 DEFINITIONS The factorial function of the positive integer n equals the product of all positive integers up to and including n: n 2:3:1 nnnjn!123 u u uu ( 1) u 1,2,3, j 1 This definition is supplemented by the value 2:3:2 0! 1 conventionally accorded to zero factorial. K.B. Oldham et al., An Atlas of Functions, Second Edition, 21 DOI 10.1007/978-0-387-48807-3_3, © Springer Science+Business Media, LLC 2009 22 THE FACTORIAL FUNCTION n!2:4 The exponential function [Chapter 26] is a generating function [Section 0:3] for the reciprocal of the factorial function f 1 2:3:3 exp(tt ) ¦ n n 0 n! 2:4 SPECIAL CASES There are none.
    [Show full text]
  • Logarithms of Integers Are Irrational
    Logarithms of Integers are Irrational J¨orgFeldvoss∗ Department of Mathematics and Statistics University of South Alabama Mobile, AL 36688{0002, USA May 19, 2008 Abstract In this short note we prove that the natural logarithm of every integer ≥ 2 is an irrational number and that the decimal logarithm of any integer is irrational unless it is a power of 10. 2000 Mathematics Subject Classification: 11R04 In this short note we prove that logarithms of most integers are irrational. Theorem 1: The natural logarithm of every integer n ≥ 2 is an irrational number. a Proof: Suppose that ln n = b is a rational number for some integers a and b. Wlog we can assume that a; b > 0. Using the third logarithmic identity we obtain that the above equation is equivalent to nb = ea. Since a and b both are positive integers, it follows that e is the root of a polynomial with integer coefficients (and leading coefficient 1), namely, the polynomial xa − nb. Hence e is an algebraic number (even an algebraic integer) which is a contradiction. 2 Remark 1: It follows from the proof that for any base b which is a transcendental number the logarithm logb n of every integer n ≥ 2 is an irrational number. (It is not alwaysp true that logb n is already irrational for every integer n ≥ 2 if b is irrational as the example b = 2 and n = 2 shows!) Question: Is it always true that logb n is already transcendental for every integer n ≥ 2 if b is transcendental? The following well-known result will be needed in [1, p.
    [Show full text]
  • Glossary of Transportation Construction Quality Assurance Terms
    TRANSPORTATION RESEARCH Number E-C235 August 2018 Glossary of Transportation Construction Quality Assurance Terms Seventh Edition TRANSPORTATION RESEARCH BOARD 2018 EXECUTIVE COMMITTEE OFFICERS Chair: Katherine F. Turnbull, Executive Associate Director and Research Scientist, Texas A&M Transportation Institute, College Station Vice Chair: Victoria A. Arroyo, Executive Director, Georgetown Climate Center; Assistant Dean, Centers and Institutes; and Professor and Director, Environmental Law Program, Georgetown University Law Center, Washington, D.C. Division Chair for NRC Oversight: Susan Hanson, Distinguished University Professor Emerita, School of Geography, Clark University, Worcester, Massachusetts Executive Director: Neil J. Pedersen, Transportation Research Board TRANSPORTATION RESEARCH BOARD 2017–2018 TECHNICAL ACTIVITIES COUNCIL Chair: Hyun-A C. Park, President, Spy Pond Partners, LLC, Arlington, Massachusetts Technical Activities Director: Ann M. Brach, Transportation Research Board David Ballard, Senior Economist, Gellman Research Associates, Inc., Jenkintown, Pennsylvania, Aviation Group Chair Coco Briseno, Deputy Director, Planning and Modal Programs, California Department of Transportation, Sacramento, State DOT Representative Anne Goodchild, Associate Professor, University of Washington, Seattle, Freight Systems Group Chair George Grimes, CEO Advisor, Patriot Rail Company, Denver, Colorado, Rail Group Chair David Harkey, Director, Highway Safety Research Center, University of North Carolina, Chapel Hill, Safety and Systems
    [Show full text]
  • Section 3.2. the Natural Logarithm Function
    3.2. THE NATURAL LOGARITHM FUNCTION 137 3.2 The natural logarithm function We further examine some exponential growth/decay contexts considered in Section 3.1, and de- velop some tools to solve certain kinds of problems that arise in those contexts. Solving the equation ea = b In Section 3.1, we solved exponential growth and decay problems problems of the “how large/how much” variety. That is: using formulas like kt kt P = P0e and R = R0e− , (3.2.1) we were able to answer some questions like “how large is this population after that many years,” or “how much of this radioactive substance is left after that many hours?” Answers to such problems entail simply putting the appropriate value of t into the appropriate formula (3.2.1) for the exponentially growing/decaying substance. What we have not yet considered are answers to “how long” questions, in exponential growth/decay situations. That is, how do we solve equations like (3.2.1) for t,givenvaluesoftheothervariables and constants involved? For example, consider the following. Example 3.2.1. Suppose a population, initially comprising 100,000 persons, is growing at the per capita rate of k = 3birthsperthousandpersonsperyear. (a) Write down an initial value problem modeling this situation. (b) How large will this population be 37 years from now? (c) How long will it take the population to double? Solution. (a) Denoting time in months by t,andpopulationinindividualsbyP (t),wehavethe initial value problem P 0(t)=0.003P (t); P (0) = 100,000. (b) Using the results of Section 3.1, we know that the solution to the problem is the exponential function P (t)=100,000 e0.003t.
    [Show full text]