<--- Back to Details
First PageDocument Content
Finite fields / Modular arithmetic / Integer sequences / Wieferich prime / Algebraic number theory / XTR / Fibonacci number / Prime number / Quadratic residue / Abstract algebra / Mathematics / Number theory
Finite fields
Modular arithmetic
Integer sequences
Wieferich prime
Algebraic number theory
XTR
Fibonacci number
Prime number
Quadratic residue
Abstract algebra
Mathematics
Number theory

Add to Reading List

Source URL: dml.cz

Download Document from Source Website

File Size: 185,86 KB

Share Document on Facebook

Similar Documents

Tuesday Daily Gather: Fibonacci. by Brian Jonah Brian’s brother has a favorite positive integer n, and he wants to find a Fibonacci number Fk such that n | Fk . Obviously, the trivial case F0 = 0 = n · 0 satisfies th

DocID: 1vqGw - View Document

Tuesday Daily Gather: Fibonacci. by Brian Jonah Brian’s brother has a favorite positive integer n, and he wants to find a Fibonacci number Fk such that n | Fk . Obviously, the trivial case F0 = 0 = n · 0 satisfies th

DocID: 1v4RY - View Document

THE NUMBER OF k-DIGIT FIBONACCI NUMBERS JAN-CHRISTOPH PUCHTA Define a(k) to be the number of k-digit Fibonacci numbers. For n > 5, we have 1.6Fn−1 < Fn < 1.7Fn−1 . Thus if Fn is the least k-digit Fibonacci number, we

DocID: 1uaXr - View Document

Software engineering / Computer programming / Computing / Scheduling / Functional languages / Concurrent programming languages / Operations research / Parallel computing / Cilk / Work stealing / Pure / Fibonacci number

Design of Parallel and High-Performance Computing Fall 2014 Lecture: Scheduling Instructor: Torsten Hoefler & Markus Püschel

DocID: 1rfSj - View Document

Mathematics / Elementary mathematics / Integer sequences / On-Line Encyclopedia of Integer Sequences / Sequence / Recurrence relation / Fibonacci number / Integer

The OEIS, Mathematical Discovery, and Insomnia Neil J. A. Sloane The OEIS Foundation and Rutgers University ACMES Conference, May 2016

DocID: 1r6nO - View Document