suzanne.soy/racket
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Fixed next-prime and prev-prime problem

Browse Source
This commit is contained in:
Jens Axel Søgaard 2012-11-17 21:31:41 +01:00 committed by Neil Toronto
parent 7e89adece4
commit db500e8b58
2 changed files with 11 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
collects/math/number-theory.rkt
View File

@ -3,7 +3,7 @@
(require typed/untyped-utils
"private/number-theory/divisibility.rkt"
"private/number-theory/modular-arithmetic.rkt"
"private/number-theory/number-theory.rkt"
(except-in "private/number-theory/number-theory.rkt" prev-prime next-prime)
(except-in "private/number-theory/factorial.rkt" factorial permutations)
"private/number-theory/bernoulli.rkt"
"private/number-theory/eulerian-number.rkt"
@ -25,6 +25,11 @@
"private/number-theory/binomial.rkt"
[binomial (Integer Integer -> Natural)])
(require/untyped-contract
"private/number-theory/number-theory.rkt"
[next-prime (Integer -> Integer)]
[prev-prime (Integer -> Integer)])
(provide (all-from-out
"private/number-theory/divisibility.rkt"
"private/number-theory/modular-arithmetic.rkt"
@ -40,5 +45,6 @@
"private/number-theory/quadratic.rkt"
"private/number-theory/quadratic-residues.rkt"
"private/number-theory/tangent-number.rkt")
next-prime prev-prime
factorial permutations
binomial)

14
collects/math/scribblings/math-number-theory.scrbl
View File

@ -193,22 +193,16 @@ Returns the n'th positive prime.
Returns the first prime larger than @racket[z].
@interaction[#:eval untyped-eval
(untyped-next-prime 4)
(untyped-next-prime 5)]
Note: Use @racket[next-prime] in Typed Racket and
@racket[untyped-next-prime] otherwise.
(next-prime 4)
(next-prime 5)]
}
@defproc[(prev-prime [z Integer]) prime?]{
Returns the first prime smaller than @racket[z].
@interaction[#:eval untyped-eval
(untyped-prev-prime 4)
(untyped-prev-prime 5)]
Note: Use @racket[prev-prime] in Typed Racket and
@racket[untyped-prev-prime] otherwise.
(prev-prime 4)
(prev-prime 5)]
}
@defproc[(next-primes [z Integer] [n Natural]) (Listof prime?)]{