About the Project

买个假的约克学院文凭毕业证【仿证 微fuk7778】buhler

AdvancedHelp

Your search matched, but the results seem poor.

The term"fuk7778" was not found.Possible alternative terms: "fukui", "butler".

See Search Help for suggestions.

(0.002 seconds)

3 matching pages

1: 24.19 Methods of Computation
  • Buhler et al. (1992) uses the expansion

    24.19.3 t 2 cosh t 1 = 2 n = 0 ( 2 n 1 ) B 2 n t 2 n ( 2 n ) ! ,

    and computes inverses modulo p of the left-hand side. Multisectioning techniques are applied in implementations. See also Crandall (1996, pp. 116–120).

  • A method related to “Stickelberger codes” is applied in Buhler et al. (2001); in particular, it allows for an efficient search for the irregular pairs ( 2 n , p ) . Discrete Fourier transforms are used in the computations. See also Crandall (1996, pp. 120–124).

  • 2: Bibliography B
  • J. P. Buhler, R. E. Crandall, and R. W. Sompolski (1992) Irregular primes to one million. Math. Comp. 59 (200), pp. 717–722.
  • J. Buhler, R. Crandall, R. Ernvall, T. Metsänkylä, and M. A. Shokrollahi (2001) Irregular primes and cyclotomic invariants to 12 million. J. Symbolic Comput. 31 (1-2), pp. 89–96.
  • 3: Bibliography C
  • H. Cohen (1993) A Course in Computational Algebraic Number Theory. Springer-Verlag, Berlin-New York.