Lucas numbers
♦
5 matching pages ♦
(0.001 seconds)
5 matching pages
1: 24.15 Related Sequences of Numbers
…
►
§24.15(iv) Fibonacci and Lucas Numbers
… ►The Lucas numbers are defined by , , and , . ►
24.15.11
►
24.15.12
…
2: 27.22 Software
…
►
•
…
Mathematica. PrimeQ combines strong pseudoprime tests for the bases 2 and 3 and a Lucas pseudoprime test. No known composite numbers pass these three tests, and Bleichenbacher (1996) has shown that this combination of tests proves primality for integers below . Provable PrimeQ uses the Atkin–Goldwasser–Kilian–Morain Elliptic Curve Method to prove primality. FactorInteger tries Brent–Pollard rho, Pollard , and then cfrac after trial division. See §27.19. ecm is available also, and the Multiple Polynomial Quadratic sieve is expected in a future release.
For additional Mathematica routines for factorization and primality testing, including several different pseudoprime tests, see Bressoud and Wagon (2000).
3: 24.1 Special Notation
4: Bibliography L
…
►
An asymptotic estimate for the Bernoulli and Euler numbers.
Canad. Math. Bull. 20 (1), pp. 109–111.
…
►
Quasiconformal Mappings in the Plane.
2nd edition, Springer-Verlag, New York.
…
►
Théorie des nombres. Tome I: Le calcul des nombres entiers, le calcul des nombres rationnels, la divisibilité arithmétique.
Gauthier-Villars, Paris (French).
►
Evaluating infinite integrals involving Bessel functions of arbitrary order.
J. Comput. Appl. Math. 64 (3), pp. 217–231.
►
Evaluating infinite integrals involving products of Bessel functions of arbitrary order.
J. Comput. Appl. Math. 64 (3), pp. 269–282.
…
5: Bibliography R
…
►
Topics in Analytic Number Theory.
Springer-Verlag, New York.
…
►
Some properties of Bernoulli’s numbers (J. Indian Math. Soc. 3 (1911), 219–234.).
In Collected Papers,
…
►
Algorithm 935: IIPBF, a MATLAB toolbox for infinite integral of products of two Bessel functions.
ACM Trans. Math. Softw. 40 (2), pp. 14:1–14:12.
…
►
Elementary Number Theory and its Applications.
5th edition, Addison-Wesley, Reading, MA.
…