Milestone map
Milestone map
2 milestones
Do the course work in public
7–13 weeks (5 hrs/week)
Take Mathematics for Computer Science for free and do written proofs for the problem sets (induction, graphs, counting, probability). Keep everything in one public repo or notebook as you go.
Proof required
Link your public repo or notebook with written proofs for the problem sets (induction, graphs, counting, probability), and a screenshot or log showing the self-check passed.
What gets checked
- Each proof states what it proves and every step follows.
- Counting answers are checked by a small program on small cases.
- Errors found against the solutions are fixed, not hidden.
Common mistakes
- Copying posted answers: verifiers read the history.
- Skipping the self-check, then asking for review too early.
Powstik Guide
A public repo or notebook with written proofs for the problem sets (induction, graphs, counting, probability).
Steps
- Make a public repo or notebook first.
- Do one unit at a time and commit after each.
- Run the self-check: Do each problem set, then mark it against the posted solutions.
- Write a short README: what is here and how to run it.
- Ask three people who know the topic to check it.
Template
README Course: Mathematics for Computer Science (MIT OpenCourseWare) What is here: How to run it: Self-check result: What was hardest:
What gets sent back
- No history, just one big upload.
- Self-check not shown.
- Code that does not run from the README.
Resources
Foundationstart here
Depthgo deeper
What a verifier looks for
- Each proof states what it proves and every step follows.
- Counting answers are checked by a small program on small cases.
- Errors found against the solutions are fixed, not hidden.
- Ask one question about a choice in the code; the answer should be clear.
You'll sign in first, then come straight back here.
Prove something about your own code
1–3 weeks (5–8 hrs/week)
Use what you learned. Make a short proof that one of your programs is correct or runs in a given time, with a test that matches the claim. Keep it small enough to finish in about two weeks.
Proof required
Link a short proof that one of your programs is correct or runs in a given time, with a test that matches the claim, with a README that says how to run or read it.
What gets checked
- The claim is clear.
- The proof holds.
- The test agrees with the proof.
Common mistakes
- A project too big to finish.
- A demo that only works on your machine.
Powstik Guide
A short proof that one of your programs is correct or runs in a given time, with a test that matches the claim.
Steps
- Write one line: what it does and for whom.
- Build the smallest version that works.
- Test it on someone else's machine or with someone else reading it.
- Write the README.
- Ask three people to check it.
Template
README What it does: Who it is for: How to run it: What I would do next:
What gets sent back
- Does not run from the README.
- Not clearly the person's own work.
- Claims more than it does.
Resources
Foundationstart here
Depthgo deeper
What a verifier looks for
- The claim is clear.
- The proof holds.
- The test agrees with the proof.
- Check that the work is the person's own.
You'll sign in first, then come straight back here.
Part of