Schroeder, M. R. Number theory in science and communication. With applications in cryptography, physics, digital information, computing, and self-similarity. 3rd ed. (English) Zbl 0997.11501 Springer Series in Information Sciences. 7. Berlin: Springer. xxii, 362 p. (1997). For a review of the first edition (1984) see Zbl 0542.10001. Cited in 2 ReviewsCited in 5 Documents MSC: 11-01 Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory 68-01 Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science 94-01 Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory 12-01 Introductory exposition (textbooks, tutorial papers, etc.) pertaining to field theory 11Axx Elementary number theory 11A41 Primes 11Dxx Diophantine equations 11R04 Algebraic numbers; rings of algebraic integers 11T22 Cyclotomy 11T55 Arithmetic theory of polynomial rings over finite fields Keywords:cryptography; public-key fast algorithms; error correcting codes; random number generation; sonar; radar; computer speech synthesis; artistic design; self-similarity; fractals; error-free computation Citations:Zbl 0613.10001; Zbl 0542.10001 PDFBibTeX XMLCite \textit{M. R. Schroeder}, Number theory in science and communication. With applications in cryptography, physics, digital information, computing, and self-similarity. 3rd ed. Berlin: Springer (1997; Zbl 0997.11501) Online Encyclopedia of Integer Sequences: Perrin sequence (or Ondrej Such sequence): a(n) = a(n-2) + a(n-3) with a(0) = 3, a(1) = 0, a(2) = 2. Primes of the form 223092870*m + 2236133941 (m>=0).