About the Project

Euler%E2%80%93Fermat%20theorem

AdvancedHelp

(0.003 seconds)

1—10 of 503 matching pages

1: 24.1 Special Notation
Euler Numbers and Polynomials
Its coefficients were first studied in Euler (1755); they were called Euler numbers by Raabe in 1851. The notations E n , E n ( x ) , as defined in §24.2(ii), were used in Lucas (1891) and Nörlund (1924). …
2: 27.2 Functions
This is the number of positive integers n that are relatively prime to n ; ϕ ( n ) is Euler’s totient. If ( a , n ) = 1 , then the EulerFermat theorem states that …The ϕ ( n ) numbers a , a 2 , , a ϕ ( n ) are relatively prime to n and distinct (mod n ). …Note that J 1 ( n ) = ϕ ( n ) . … Table 27.2.2 tabulates the Euler totient function ϕ ( n ) , the divisor function d ( n ) ( = σ 0 ( n ) ), and the sum of the divisors σ ( n ) ( = σ 1 ( n ) ), for n = 1 ( 1 ) 52 . …
3: 27.16 Cryptography
Thus, y x r ( mod n ) and 1 y < n . … To do this, let s denote the reciprocal of r modulo ϕ ( n ) , so that r s = 1 + t ϕ ( n ) for some integer t . (Here ϕ ( n ) is Euler’s totient (§27.2).) By the EulerFermat theorem (27.2.8), x ϕ ( n ) 1 ( mod n ) ; hence x t ϕ ( n ) 1 ( mod n ) . But y s x r s x 1 + t ϕ ( n ) x ( mod n ) , so y s is the same as x modulo n . …
4: 24.17 Mathematical Applications
Euler–Maclaurin Summation Formula
Euler Splines
are called Euler splines of degree n . …
§24.17(iii) Number Theory
Bernoulli and Euler numbers and polynomials occur in: number theory via (24.4.7), (24.4.8), and other identities involving sums of powers; the Riemann zeta function and L -series (§25.15, Apostol (1976), and Ireland and Rosen (1990)); arithmetic of cyclotomic fields and the classical theory of Fermat’s last theorem (Ribenboim (1979) and Washington (1997)); p -adic analysis (Koblitz (1984, Chapter 2)). …
5: Bibliography
  • A. Abramov (1960) Tables of ln Γ ( z ) for Complex Argument. Pergamon Press, New York.
  • W. A. Al-Salam and L. Carlitz (1959) Some determinants of Bernoulli, Euler and related numbers. Portugal. Math. 18, pp. 91–99.
  • D. E. Amos (1990) Algorithm 683: A portable FORTRAN subroutine for exponential integrals of a complex argument. ACM Trans. Math. Software 16 (2), pp. 178–182.
  • T. M. Apostol (1983) A proof that Euler missed: Evaluating ζ ( 2 ) the easy way. Math. Intelligencer 5 (3), pp. 59–60.
  • H. Appel (1968) Numerical Tables for Angular Correlation Computations in α -, β - and γ -Spectroscopy: 3 j -, 6 j -, 9 j -Symbols, F- and Γ -Coefficients. Landolt-Börnstein Numerical Data and Functional Relationships in Science and Technology, Springer-Verlag.
  • 6: 24.4 Basic Properties
    §24.4(i) Difference Equations
    §24.4(ii) Symmetry
    §24.4(iii) Sums of Powers
    §24.4(iv) Finite Expansions
    Next, …
    7: 5.22 Tables
    Abramowitz and Stegun (1964, Chapter 6) tabulates Γ ( x ) , ln Γ ( x ) , ψ ( x ) , and ψ ( x ) for x = 1 ( .005 ) 2 to 10D; ψ ′′ ( x ) and ψ ( 3 ) ( x ) for x = 1 ( .01 ) 2 to 10D; Γ ( n ) , 1 / Γ ( n ) , Γ ( n + 1 2 ) , ψ ( n ) , log 10 Γ ( n ) , log 10 Γ ( n + 1 3 ) , log 10 Γ ( n + 1 2 ) , and log 10 Γ ( n + 2 3 ) for n = 1 ( 1 ) 101 to 8–11S; Γ ( n + 1 ) for n = 100 ( 100 ) 1000 to 20S. Zhang and Jin (1996, pp. 67–69 and 72) tabulates Γ ( x ) , 1 / Γ ( x ) , Γ ( x ) , ln Γ ( x ) , ψ ( x ) , ψ ( x ) , ψ ( x ) , and ψ ( x ) for x = 0 ( .1 ) 5 to 8D or 8S; Γ ( n + 1 ) for n = 0 ( 1 ) 100 ( 10 ) 250 ( 50 ) 500 ( 100 ) 3000 to 51S. … Abramov (1960) tabulates ln Γ ( x + i y ) for x = 1 ( .01 ) 2 , y = 0 ( .01 ) 4 to 6D. Abramowitz and Stegun (1964, Chapter 6) tabulates ln Γ ( x + i y ) for x = 1 ( .1 ) 2 , y = 0 ( .1 ) 10 to 12D. …Zhang and Jin (1996, pp. 70, 71, and 73) tabulates the real and imaginary parts of Γ ( x + i y ) , ln Γ ( x + i y ) , and ψ ( x + i y ) for x = 0.5 , 1 , 5 , 10 , y = 0 ( .5 ) 10 to 8S.
    8: 24.2 Definitions and Generating Functions
    §24.2(ii) Euler Numbers and Polynomials
    §24.2(iii) Periodic Bernoulli and Euler Functions
    Table 24.2.1: Bernoulli and Euler numbers.
    n B n E n
    Table 24.2.2: Bernoulli and Euler polynomials.
    n B n ( x ) E n ( x )
    9: Bibliography D
  • H. Delange (1988) On the real roots of Euler polynomials. Monatsh. Math. 106 (2), pp. 115–138.
  • K. Dilcher (1987a) Asymptotic behaviour of Bernoulli, Euler, and generalized Bernoulli polynomials. J. Approx. Theory 49 (4), pp. 321–330.
  • K. Dilcher (1987b) Irreducibility of certain generalized Bernoulli polynomials belonging to quadratic residue class characters. J. Number Theory 25 (1), pp. 72–80.
  • K. Dilcher (1988) Zeros of Bernoulli, generalized Bernoulli and Euler polynomials. Mem. Amer. Math. Soc. 73 (386), pp. iv+94.
  • T. M. Dunster (1997) Error analysis in a uniform asymptotic expansion for the generalised exponential integral. J. Comput. Appl. Math. 80 (1), pp. 127–161.
  • 10: 10.31 Power Series
    where ψ ( x ) = Γ ( x ) / Γ ( x ) 5.2(i)). …
    10.31.2 K 0 ( z ) = ( ln ( 1 2 z ) + γ ) I 0 ( z ) + 1 4 z 2 ( 1 ! ) 2 + ( 1 + 1 2 ) ( 1 4 z 2 ) 2 ( 2 ! ) 2 + ( 1 + 1 2 + 1 3 ) ( 1 4 z 2 ) 3 ( 3 ! ) 2 + .
    10.31.3 I ν ( z ) I μ ( z ) = ( 1 2 z ) ν + μ k = 0 ( ν + μ + k + 1 ) k ( 1 4 z 2 ) k k ! Γ ( ν + k + 1 ) Γ ( μ + k + 1 ) .