<--- Back to Details
First PageDocument Content
Integer sequences / Lucas pseudoprime / Modular arithmetic / Recurrence relations / Derrick Henry Lehmer / Prime number / Lucas sequence / Lehmer / Primality test / Mathematics / Number theory / Pseudoprimes
Date: 2007-08-14 10:56:58
Integer sequences
Lucas pseudoprime
Modular arithmetic
Recurrence relations
Derrick Henry Lehmer
Prime number
Lucas sequence
Lehmer
Primality test
Mathematics
Number theory
Pseudoprimes

Add to Reading List

Source URL: www.kurims.kyoto-u.ac.jp

Download Document from Source Website

File Size: 95,05 KB

Share Document on Facebook

Similar Documents

Mathematics / Integer sequences / Algebra / Theory of computation / On-Line Encyclopedia of Integer Sequences / Recurrence relations / Sequence / Monday

Open Problems in the OEIS Neil J A Sloane Guest Lecture, Zeilberger Experimental Math Class, May

DocID: 1r9fI - View Document

Logarithms / Asymptotic analysis / Recurrence relations / AkraBazzi method / Arithmetic functions

Algorithms and Data Structures (WS15/16) Example Solutions for Unit 5 Problem 3 We need to prove that f (x) ≥ cxp 1 + Rx

DocID: 1pCUK - View Document

arXiv:cs.SCv2 10 NovA Maple Package for Computing Gr¨obner Bases for Linear Recurrence Relations Vladimir P. Gerdta∗ and Daniel Robertzb† a

DocID: 1ojyE - View Document

TATE-SHAFAREVICH GROUPS OF THE CONGRUENT NUMBER ELLIPTIC CURVES Ken Ono Abstract. Using elliptic modular functions, Kronecker proved a number of recurrence relations for suitable class numbers of positive binary quadrati

DocID: 1ntcl - View Document

Mathematics / Algebra / Abstract algebra / Recurrence relation / Theory of computation / Rational function / Generating function / Factorial / Exponentiation / Polynomial / KochenSpecker theorem

Definability of Combinatorial Functions and Their Linear Recurrence Relations Extended Abstract T. Kotek ⋆

DocID: 1muc5 - View Document