About the Project

Voronoi congruence

AdvancedHelp

(0.001 seconds)

1—10 of 16 matching pages

1: 24.10 Arithmetic Properties
Here and elsewhere two rational numbers are congruent if the modulus divides the numerator of their difference.
§24.10(ii) Kummer Congruences
§24.10(iii) Voronoi’s Congruence
2: Bibliography P
  • S. Porubský (1998) Voronoi type congruences for Bernoulli numbers. In Voronoi’s Impact on Modern Science. Book I, P. Engel and H. Syta (Eds.),
  • 3: 27.17 Other Applications
    Congruences are used in constructing perpetual calendars, splicing telephone cables, scheduling round-robin tournaments, devising systematic methods for storing computer files, and generating pseudorandom numbers. …Apostol and Zuckerman (1951) uses congruences to construct magic squares. …
    4: 27.20 Methods of Computation: Other Number-Theoretic Functions
    A recursion formula obtained by differentiating (27.14.18) can be used to calculate Ramanujan’s function τ ( n ) , and the values can be checked by the congruence (27.14.20). …
    5: Morris Newman
    Department of Commerce Gold Medal in 1966 for his work on algorithms for solving integral linear systems exactly by using congruence techniques. …
    6: 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. …
    7: 27.9 Quadratic Characters
    If p does not divide n , then ( n | p ) has the value 1 when the quadratic congruence x 2 n ( mod p ) has a solution, and the value 1 when this congruence has no solution. …
    8: 24.19 Methods of Computation
  • Tanner and Wagstaff (1987) derives a congruence ( mod p ) for Bernoulli numbers in terms of sums of powers. See also §24.10(iii).

  • 9: 27.14 Unrestricted Partitions
    §27.14(v) Divisibility Properties
    After decades of nearly fruitless searching for further congruences of this type, it was believed that no others existed, until it was shown in Ono (2000) that there are infinitely many. … Lehmer (1947) conjectures that τ ( n ) is never 0 and verifies this for all n < 21 49286 39999 by studying various congruences satisfied by τ ( n ) , for example: …
    10: Bibliography
  • A. Adelberg (1996) Congruences of p -adic integer order Bernoulli numbers. J. Number Theory 59 (2), pp. 374–388.
  • G. E. Andrews and D. Foata (1980) Congruences for the q -secant numbers. European J. Combin. 1 (4), pp. 283–287.