About the Project

large b

AdvancedHelp

(0.004 seconds)

31—40 of 94 matching pages

31: 27.16 Cryptography
Applications to cryptography rely on the disparity in computer time required to find large primes and to factor large integers. For example, a code maker chooses two large primes p and q of about 400 decimal digits each. …For this reason, the codes are considered unbreakable, at least with the current state of knowledge on factoring large numbers. To code a message by this method, we replace each letter by two digits, say A = 01 , B = 02 , , Z = 26 , and divide the message into pieces of convenient length smaller than the public value n = p q . …
32: 10.17 Asymptotic Expansions for Large Argument
10.17.12 H ν ( 2 ) ( z ) i ( 2 π z ) 1 2 e i ω k = 0 ( i ) k b k ( ν ) z k , 2 π + δ ph z π δ .
33: 24.16 Generalizations
For extensions of B n ( ) ( x ) to complex values of x , n , and , and also for uniform asymptotic expansions for large x and large n , see Temme (1995b) and López and Temme (1999b, 2010b). …
34: Preface
Bickel, B. …Eberhardt, B. … B. …Schanzle, B. … B. …
35: 6.18 Methods of Computation
A 0 , B 0 , and C 0 can be computed by Miller’s algorithm (§3.6(iii)), starting with initial values ( A N , B N , C N ) = ( 1 , 0 , 0 ) , say, where N is an arbitrary large integer, and normalizing via C 0 = 1 / z . …
36: 10.41 Asymptotic Expansions for Large Order
§10.41 Asymptotic Expansions for Large Order
§10.41(i) Asymptotic Forms
§10.41(ii) Uniform Expansions for Real Variable
37: 10.74 Methods of Computation
If x or | z | is large compared with | ν | 2 , then the asymptotic expansions of §§10.17(i)10.17(iv) are available. … For large positive real values of ν the uniform asymptotic expansions of §§10.20(i) and 10.20(ii) can be used. Moreover, because of their double asymptotic properties (§10.41(v)) these expansions can also be used for large x or | z | , whether or not ν is large. It should be noted, however, that there is a difficulty in evaluating the coefficients A k ( ζ ) , B k ( ζ ) , C k ( ζ ) , and D k ( ζ ) , from the explicit expressions (10.20.10)–(10.20.13) when z is close to 1 owing to severe cancellation. … And since there are no error terms they could, in theory, be used for all values of z ; however, there may be severe cancellation when | z | is not large compared with n 2 . …
38: 25.11 Hurwitz Zeta Function
25.11.6 ζ ( s , a ) = 1 a s ( 1 2 + a s 1 ) s ( s + 1 ) 2 0 B ~ 2 ( x ) B 2 ( x + a ) s + 2 d x , s 1 , s > 1 , a > 0 .
For B ~ n ( x ) see §24.2(iii). …
25.11.19 ζ ( s , a ) = ln a a s ( 1 2 + a s 1 ) a 1 s ( s 1 ) 2 + s ( s + 1 ) 2 0 ( B ~ 2 ( x ) B 2 ) ln ( x + a ) ( x + a ) s + 2 d x ( 2 s + 1 ) 2 0 B ~ 2 ( x ) B 2 ( x + a ) s + 2 d x , s > 1 , s 1 , a > 0 .
§25.11(xii) a -Asymptotic Behavior
Similarly, as a in the sector | ph a | 1 2 π δ ( < 1 2 π ) , …
39: Staff
  • Adri B. Olde Daalhuis, Mathematics Editor, The University of Edinburgh

  • Ronald F. Boisvert, Editor at Large, NIST

  • Vadim B. Kuznetsov, University of Leeds, Chap. 31

  • Adri B. Olde Daalhuis, University of Edinburgh, Chaps. 13, 15, 16

  • Richard B. Paris, University of Abertay, Chaps. 8, 11

  • 40: 28.35 Tables
  • National Bureau of Standards (1967) includes the eigenvalues a n ( q ) , b n ( q ) for n = 0 ( 1 ) 3 with q = 0 ( .2 ) 20 ( .5 ) 37 ( 1 ) 100 , and n = 4 ( 1 ) 15 with q = 0 ( 2 ) 100 ; Fourier coefficients for ce n ( x , q ) and se n ( x , q ) for n = 0 ( 1 ) 15 , n = 1 ( 1 ) 15 , respectively, and various values of q in the interval [ 0 , 100 ] ; joining factors g e , n ( q ) , f e , n ( q ) for n = 0 ( 1 ) 15 with q = 0 ( .5  to  10 ) 100 (but in a different notation). Also, eigenvalues for large values of q . Precision is generally 8D.