racket/collects/math/private/number-theory/fibonacci.rkt
Neil Toronto f2dc2027f6 Initial math library commit. The history for these changes is preserved
in the original GitHub fork:

  https://github.com/ntoronto/racket

Some things about this are known to be broken (most egregious is that the
array tests DO NOT RUN because of a problem in typed/rackunit), about half
has no coverage in the tests, and half has no documentation. Fixes and
docs are coming. This is committed now to allow others to find errors and
inconsistency in the things that appear to be working, and to give the
author a (rather incomplete) sense of closure.
2012-11-16 11:39:51 -07:00

57 lines
1.8 KiB
Racket

#lang typed/racket/base
(provide make-fibonacci
fibonacci
make-fibonacci/mod
fibonacci/mod)
(: generator : Integer Integer Natural Natural Natural -> Integer)
(define (generator a b p q count)
; SICP ex. 1.19
(cond
[(zero? count) b]
[(even? count)
(generator a b
(+ (* p p) (* q q))
(+ (* 2 p q) (* q q))
(quotient count 2))]
[else
(generator (+ (* b q) (* a q) (* a p))
(+ (* b p) (* a q))
p
q
(- count 1))]))
(: make-fibonacci (Integer Integer -> (Integer -> Integer)))
(define ((make-fibonacci a b) n)
(cond [(n . < . 0) (raise-argument-error 'fibonacci "Natural" n)]
[else (generator b a 0 1 n)]))
(define fibonacci (make-fibonacci 0 1))
(: generator/mod : Integer Integer Natural Natural Natural Positive-Integer -> Integer)
(define (generator/mod a b p q count mod)
(cond
[(zero? count) (modulo b mod)]
[(even? count)
(generator/mod a b
(modulo (+ (* p p) (* q q)) mod)
(modulo (+ (* 2 p q) (* q q)) mod)
(quotient count 2)
mod)]
[else
(generator/mod (modulo (+ (* b q) (* a q) (* a p)) mod)
(modulo (+ (* b p) (* a q)) mod)
p
q
(- count 1)
mod)]))
(: make-fibonacci/mod (Integer Integer -> (Integer Integer -> Integer)))
(define ((make-fibonacci/mod a b) n mod)
(cond [(n . < . 0) (raise-argument-error 'fibonacci "Natural" 0 n mod)]
[(mod . <= . 0) (raise-argument-error 'fibonacci "Positive-Integer" 1 n mod)]
[else (generator/mod b a 0 1 n mod)]))
(define fibonacci/mod (make-fibonacci/mod 0 1))