OpenLogicProject / OpenLogicProject/OpenLogic
Add proof of fundamental theorem of arithmetic
Nobody has claimed this yet.
- Dominant language
- TeX
- Stars
- 1.4k
- Forks
- 288
- PR merge metrics
- No merged PRs in 30d
Description
computability/recursive-functions/sequences.tex uses the fundamental theorem of arithmetic to code sequences. Should add a proof of this. Since both existence and uniqueness proofs use strong induction, it might fit as an example in methods/induction/strong-induction.tex
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start with computability/recursive-functions/sequences.tex to review how the fundamental theorem of arithmetic is used to code sequences, then read methods/induction/strong-induction.tex to assess the proposed placement. Add both the existence and uniqueness proofs, with strong induction as appropriate, and confirm the textbook build succeeds.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- tex
- Domain
- documentation
- Issue type
- Documentation
- Difficulty
- 3/5
- Estimated time
- 1-2 days
- Activity status
- Stale
- Clarity
- Clearly specified
- Newbie friendliness
- 45/100