About the Project

binary number system

AdvancedHelp

(0.002 seconds)

1—10 of 273 matching pages

1: 24.1 Special Notation
Bernoulli Numbers and Polynomials
The origin of the notation B n , B n ( x ) , is not clear. …
Euler Numbers and Polynomials
Its coefficients were first studied in Euler (1755); they were called Euler numbers by Raabe in 1851. … Various systems of notation are summarized in Adrian (1959) and D’Ocagne (1904).
2: 27.18 Methods of Computation: Primes
§27.18 Methods of Computation: Primes
An analytic approach using a contour integral of the Riemann zeta function (§25.2(i)) is discussed in Borwein et al. (2000). … An alternative procedure is the binary quadratic sieve of Atkin and Bernstein (Crandall and Pomerance (2005, p. 170)). … These algorithms are used for testing primality of Mersenne numbers, 2 n 1 , and Fermat numbers, 2 2 n + 1 . …
3: 3.1 Arithmetics and Error Measures
§3.1(i) Floating-Point Arithmetic
Computer arithmetic is described for the binary based system with base 2; another system that has been used is the hexadecimal system with base 16. A nonzero normalized binary floating-point machine number x is represented as … In the case of the normalized binary interchange formats, the representation of data for binary32 (previously single precision) ( N = 32 , p = 24 , E min = 126 , E max = 127 ), binary64 (previously double precision) ( N = 64 , p = 53 , E min = 1022 , E max = 1023 ) and binary128 (previously quad precision) ( N = 128 , p = 113 , E min = 16382 , E max = 16383 ) are as in Figure 3.1.1. … Computer algebra systems use exact rational arithmetic with rational numbers p / q , where p and q are multi-length integers. …
4: Bibliography B
  • D. H. Bailey (1995) A Fortran-90 based multiprecision system. ACM Trans. Math. Software 21 (4), pp. 379–387.
  • G. Baxter (1961) Polynomials defined by a difference system. J. Math. Anal. Appl. 2 (2), pp. 223–263.
  • C. Brezinski (1999) Error estimates for the solution of linear systems. SIAM J. Sci. Comput. 21 (2), pp. 764–781.
  • T. W. Burkhardt and T. Xue (1991) Density profiles in confined critical systems and conformal invariance. Phys. Rev. Lett. 66 (7), pp. 895–898.
  • W. S. Burnside and A. W. Panton (1960) The Theory of Equations: With an Introduction to the Theory of Binary Algebraic Forms. Dover Publications, New York.
  • 5: 27.15 Chinese Remainder Theorem
    §27.15 Chinese Remainder Theorem
    The Chinese remainder theorem states that a system of congruences x a 1 ( mod m 1 ) , , x a k ( mod m k ) , always has a solution if the moduli are relatively prime in pairs; the solution is unique (mod m ), where m is the product of the moduli. This theorem is employed to increase efficiency in calculating with large numbers by making use of smaller numbers in most of the calculation. …Their product m has 20 digits, twice the number of digits in the data. …These numbers, in turn, are combined by the Chinese remainder theorem to obtain the final result ( mod m ) , which is correct to 20 digits. …
    6: 27.2 Functions
    where p 1 , p 2 , , p ν ( n ) are the distinct prime factors of n , each exponent a r is positive, and ν ( n ) is the number of distinct primes dividing n . … (See Gauss (1863, Band II, pp. 437–477) and Legendre (1808, p. 394).) … Such a set is a reduced residue system modulo n . …
    §27.2(ii) Tables
    7: 20.12 Mathematical Applications
    §20.12(i) Number Theory
    For applications of Jacobi’s triple product (20.5.9) to Ramanujan’s τ ( n ) function and Euler’s pentagonal numbers see Hardy and Wright (1979, pp. 132–160) and McKean and Moll (1999, pp. 143–145). For an application of a generalization in affine root systems see Macdonald (1972). … The space of complex tori / ( + τ ) (that is, the set of complex numbers z in which two of these numbers z 1 and z 2 are regarded as equivalent if there exist integers m , n such that z 1 z 2 = m + τ n ) is mapped into the projective space P 3 via the identification z ( θ 1 ( 2 z | τ ) , θ 2 ( 2 z | τ ) , θ 3 ( 2 z | τ ) , θ 4 ( 2 z | τ ) ) . …
    8: Mourad E. H. Ismail
     Suslov), Kluwer Academic Publishers, 2001; Symbolic Computation, Number Theory, Special Functions, Physics and Combinatorics (with F. … Ismail serves on several editorial boards including the Cambridge University Press book series Encyclopedia of Mathematics and its Applications, and on the editorial boards of 9 journals including Proceedings of the American Mathematical Society (Integrable Systems and Special Functions Editor); Constructive Approximation; Journal of Approximation Theory; and Integral Transforms and Special Functions. …
    9: Morris Newman
    Department of Commerce Gold Medal in 1966 for his work on algorithms for solving integral linear systems exactly by using congruence techniques. … He served as Associate Editor for Combinatorics and Number Theory for the DLMF project. …
    10: Barry I. Schneider
    Schneider’s current research interests span a broad number of areas of theoretical chemistry, atomic and molecular physics, numerical methods and high performance computing. …Schneider has served as Chair and Co-Chair of the APS Division of Computational Physics and the Topical Group on Few-Body Systems and Multipartical Dynamics and has been the organizer of a number of conferences and invited sessions here and abroad. …