TODO.md

Final Project for Math 10, Spring 2020 taught by Kevin Carlson

TODO

Recurrence Relations and Dynamic Programming (each of these has a DP implementation)

• Bell numbers
• Catalan numbers
• Fibonacci sequence

Permutations and Combinations

• N choose k
• N pick k
• Permutations with repetition
• Combinations with repetition
• Generate all bit strings of length n
• Generate all permutations of a string

Set operations

• Generate powerset of an n element set
• Generate cartesian product of an n element set

Counting

• Number of relations
• Number of reflexive relations
• Number of symmetric relations
• Number of antisymmetric relations
• Number of transitive relations
• Number of equivalence relations (bell numbers)
• Number of s_0 avoidant strings of length n (See this stack overflow post)
• Number of s_0 inclusive strings of length n

Misc

• Automatically solve recurrence relations with constant coefficients
• Implement GUI