-
Notifications
You must be signed in to change notification settings - Fork 298
[Merged by Bors] - feat(number_theory/prime_counting): The prime counting function #9080
Conversation
Co-authored-by: Johan Commelin <johan@commelin.net>
… BoltonBailey/prime-counting
… BoltonBailey/prime-counting
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
It looks good to me. I just noticed a few places that commonly might be implicit arguments.
Co-authored-by: Kyle Miller <kmill31415@gmail.com>
Co-authored-by: Kyle Miller <kmill31415@gmail.com>
…ommunity/mathlib into BoltonBailey/prime-counting
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
For the documentation, if you give fully qualified names, they'll turn into links on the website.
Once that's done, I think it's fair to say it's ready to merge (hopefully I'm doing this right 😅)
bors d=BoltonBailey
✌️ BoltonBailey can now approve this pull request. To approve and merge a pull request, simply reply with |
Co-authored-by: Kyle Miller <kmill31415@gmail.com>
bors r+ |
With an eye to implementing [this proof](https://leanprover.zulipchat.com/#narrow/stream/144837-PR-reviews/topic/.238002/near/251178921), I am adding a file to define the prime counting function and prove a simple upper bound on it. Co-authored-by: Vladimir Goryachev <gor050299@gmail.com> Co-authored-by: Scott Morrison <scott@tqft.net> Co-authored-by: YaelDillies <yael.dillies@gmail.com> Co-authored-by: Kyle Miller <kmill31415@gmail.com> Co-authored-by: Eric <ericrboidi@gmail.com>
Pull request successfully merged into master. Build succeeded: |
With an eye to implementing this proof, I am adding a file to define the prime counting function and prove a simple upper bound on it.