"This course covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods. Topics include formal logic notation, proof methods; induction, well-ordering; sets, relations; elementary graph theory; integer congruences; asymptotic notation and growth of functions; permutations and combinations, counting principles; discrete probability. Further selected topics may also be covered, such as recursive definition and structural induction; state machines and invariants; recurrences; generating functions.:
I think you would really benefit from working with a designer. It seems like there is a lot of great features... but suffers from information overload.
It really depends on your product, what you are doing, etc. pzxc is right, do prematurely optimize. You also need to decide if you have any serious liability. Is it just you are do you have any partners...
