hexadecimal number system
(0.001 seconds)
1—10 of 274 matching pages
1: 24.1 Special Notation
…
►
Bernoulli Numbers and Polynomials
►The origin of the notation , , 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: 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. … ► … ►Let be any positive number with … ►Computer algebra systems use exact rational arithmetic with rational numbers , where and are multi-length integers. …3: 27.15 Chinese Remainder Theorem
§27.15 Chinese Remainder Theorem
►The Chinese remainder theorem states that a system of congruences , always has a solution if the moduli are relatively prime in pairs; the solution is unique (mod ), where 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 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 , which is correct to 20 digits. …4: 27.2 Functions
…
►where are the distinct prime factors of , each exponent is positive, and is the number of distinct primes dividing .
…
►(See Gauss (1863, Band II, pp. 437–477) and Legendre (1808, p. 394).)
…
►Such a set is a reduced
residue system modulo .
…
►
§27.2(ii) Tables
…5: 20.12 Mathematical Applications
…
►
§20.12(i) Number Theory
… ►For applications of Jacobi’s triple product (20.5.9) to Ramanujan’s 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 in which two of these numbers and are regarded as equivalent if there exist integers such that ) is mapped into the projective space via the identification . …6: 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.
…
7: 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.
…
8: Barry I. Schneider
…
►Schneider’s research interests spanned a broad number of areas of theoretical chemistry, atomic and molecular physics, numerical methods and high performance computing.
…Schneider 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 in the US and abroad.
…
9: 3.2 Linear Algebra
…
►To solve the system
…
►