package coq-bertrand
- Overview
- No Docs
You can search for identifiers within the package.
in-package search v0.2.0
Correctness of Knuth's algorithm for prime numbers
Install
Dune Dependency
Authors
Maintainers
Sources
v8.5.0.tar.gz
md5=d7ed1b44196c96be0b55fc4fb3967d74
Description
A proof of correctness of the algorithm as described in `The Art of Computer Programming: Fundamental Algorithms' by Knuth, pages 147-149
Tags
keyword:knuth's algorithm keyword:prime numbers keyword:bertrand's postulate category:Mathematics/Arithmetic and Number Theory/Number theory category:Computer Science/Decision Procedures and Certified Algorithms/Correctness proofs based on external tools category:Miscellaneous/Extracted Programs/Arithmetic date:2002Published: 07 Jun 2016
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page