About the Formalization of Some Results by Chebyshev in Number Theory
Authors:
- 1 January 2009
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 19-31
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- A formally verified proof of the prime number theoremACM Transactions on Computational Logic, 2007
- Pocklington's Theorem and Bertrand's PostulateFormalized Mathematics, 2006
- The Prime Number Theorem2003
- Proving Pearl: Knuth’s Algorithm for Prime NumbersLecture Notes in Computer Science, 2003
- The Prime Numbers and Their Distribution2000