About the Project

reduced residue system

AdvancedHelp

(0.003 seconds)

1—10 of 160 matching pages

1: 27.2 Functions
Such a set is a reduced residue system modulo n . …
2: 13.28 Physical Applications
§13.28(i) Exact Solutions of the Wave Equation
The reduced wave equation 2 w = k 2 w in paraboloidal coordinates, x = 2 ξ η cos ϕ , y = 2 ξ η sin ϕ , z = ξ η , can be solved via separation of variables w = f 1 ( ξ ) f 2 ( η ) e i p ϕ , where …
§13.28(iii) Other Applications
For dynamics of many-body systems see Meden and Schönhammer (1992); for tomography see D’Ariano et al. (1994); for generalized coherent states see Barut and Girardello (1971); for relativistic cosmology see Crisóstomo et al. (2004).
3: 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. … By the Chinese remainder theorem each integer in the data can be uniquely represented by its residues (mod m 1 ), (mod m 2 ), (mod m 3 ), and (mod m 4 ), respectively. Because each residue has no more than five digits, the arithmetic can be performed efficiently on these residues with respect to each of the moduli, yielding answers a 1 ( mod m 1 ) , a 2 ( mod m 2 ) , a 3 ( mod m 3 ) , and a 4 ( mod m 4 ) , where each a j has no more than five digits. …
4: Bibliography H
  • P. I. Hadži (1978) Sums with cylindrical functions that reduce to the probability function and to related functions. Bul. Akad. Shtiintse RSS Moldoven. 1978 (3), pp. 80–84, 95 (Russian).
  • M. Heil (1995) Numerical Tools for the Study of Finite Gap Solutions of Integrable Systems. Ph.D. Thesis, Technischen Universität Berlin.
  • I. Huang and S. Huang (1999) Bernoulli numbers and polynomials via residues. J. Number Theory 76 (2), pp. 178–193.
  • 5: 28.32 Mathematical Applications
    §28.32(i) Elliptical Coordinates and an Integral Relationship
    §28.32(ii) Paraboloidal Coordinates
    The general paraboloidal coordinate system is linked with Cartesian coordinates via …is separated in this system, each of the separated equations can be reduced to the Whittaker–Hill equation (28.31.1), in which A , B are separation constants. …
    6: 1.10 Functions of a Complex Variable
    Analytic continuation is a powerful aid in establishing transformations or functional equations for complex variables, because it enables the problem to be reduced to: (a) deriving the transformation (or functional equation) with real variables; followed by (b) finding the domain on which the transformed function is analytic. … The coefficient a 1 of ( z z 0 ) 1 in the Laurent series for f ( z ) is called the residue of f ( z ) at z 0 , and denoted by res z = z 0 [ f ( z ) ] , res z = z 0 [ f ( z ) ] , or (when there is no ambiguity) res [ f ( z ) ] . …
    §1.10(iv) Residue Theorem
    Suppose that …
    7: 28.33 Physical Applications
    with W ( x , y , t ) = e i ω t V ( x , y ) , reduces to (28.32.2) with k 2 = ω 2 ρ / τ . …
  • McLachlan (1947, Chapters XVI–XIX) for applications of the wave equation to vibrational systems, electrical and thermal diffusion, electromagnetic wave guides, elliptical cylinders in viscous fluids, and diffraction of sound and electromagnetic waves.

  • Daymond (1955) for vibrating systems.

  • If the parameters of a physical system vary periodically with time, then the question of stability arises, for example, a mathematical pendulum whose length varies as cos ( 2 ω t ) . …
  • McLachlan (1947, Chapter XV) for amplitude distortion in moving-coil loud-speakers, frequency modulation, dynamical systems, and vibration of stretched strings.

  • 8: Bibliography R
  • REDUCE (free interactive system)
  • S. O. Rice (1954) Diffraction of plane radio waves by a parabolic cylinder. Calculation of shadows behind hills. Bell System Tech. J. 33, pp. 417–504.
  • H. Rosengren (2004) Elliptic hypergeometric series on root systems. Adv. Math. 181 (2), pp. 417–447.
  • 9: 15.13 Zeros
    If a , b , c , c a , or c b { 0 , 1 , 2 , } , then F ( a , b ; c ; z ) is not defined, or reduces to a polynomial, or reduces to ( 1 z ) c a b times a polynomial. …
    10: 27.16 Cryptography
    To code a piece x , raise x to the power r and reduce x r modulo n to obtain an integer y (the coded form of x ) between 1 and n . … In other words, to recover x from y we simply raise y to the power s and reduce modulo n . …