3 ms·

Try http://www.khanacademy.org http://www.khanacademy.org (free), their math series starts from basic arithmetic and walks all the way through to undergrad-leve

Try http://www.khanacademy.org http://www.khanacademy.org (free), their math series starts from basic arithmetic and walks all the way through to undergrad-level mathematics. I personally preferred khanacademy to my math teaching at school and it's been handy during my degree. For more advanced stuff i've found Stanford's online courses (https://www.youtube.com/user/StanfordUniversity/playlists https://www.youtube.com/user/StanfordUniversity/playlists) and MIT OpenCourseWare (http://ocw.mit.edu/index.htm http://ocw.mit.edu/index.htm) to have the best material for Physics

kellros 12y ago
I second this and would strongly advise this approach. The courses available on Khan Academy help you visualize the math and gain a better understanding on the 'why' (reasoning) while also teaching you the 'how' (application). There's sufficient math courses available to teach you everything from pre/primary school arithmetic to first year university/college level calculus/linear algebra.
- tjl 12y ago
  I hope that their math section is better than some of their engineering courses. See the critique at, http://www.leancrew.com/all-this/2012/12/khan/ http://www.leancrew.com/all-this/2012/12/khan/ I've also been involved in teaching similar material as Dr. Drang and agree completely with his critique. I've come across students who've had similar sloppy teaching and had to re-teach material so they could unlearn what they'd learnt and get a proper foundation for moving forward. Consistently, they would have very poor assignments for the first few weeks until they had that foundation.
actraub 12y ago
"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.: http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-042j-mathematics-for-computer-science-fall-2010/readings/ http://ocw.mit.edu/courses/electrical-engineering-and-comput...

kellros 12y ago

I second this and would strongly advise this approach. The courses available on Khan Academy help you visualize the math and gain a better understanding on the 'why' (reasoning) while also teaching you the 'how' (application). There's sufficient math courses available to teach you everything from pre/primary school arithmetic to first year university/college level calculus/linear algebra.

tjl 12y ago
I hope that their math section is better than some of their engineering courses. See the critique at, http://www.leancrew.com/all-this/2012/12/khan/ http://www.leancrew.com/all-this/2012/12/khan/ I've also been involved in teaching similar material as Dr. Drang and agree completely with his critique. I've come across students who've had similar sloppy teaching and had to re-teach material so they could unlearn what they'd learnt and get a proper foundation for moving forward. Consistently, they would have very poor assignments for the first few weeks until they had that foundation.

actraub 12y ago

"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.: http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-042j-mathematics-for-computer-science-fall-2010/readings/ http://ocw.mit.edu/courses/electrical-engineering-and-comput...