I've noticed the problems getting harder and harder as we go....well that's expected but what i mean is that the questions are progressively getting more detailed....in the sense that the algorithms that are needed to solve the inductive step are getting more complex.....but im sure it will be fine....haha
anyways moving on to the problem sets....i was in math class today and i realized that i did the second question for PS1 wrong....where you have to prove n(n+1) / 2 for any n.....and we did the same question using simple induction in class today.....it acctually made me feel so stupid because i had the right idea but i forgot the simple trick where you replace {1+2+....+n} with n(n+1)/2 and then add n+1.......
with regards to the upcoming assignment i started it a while ago and i was sooooo excited when i figured out the first question....im not sure if we are allowed to talk about course specific material on the slogs so i wont, however to be safe i wont....so without giving away anything i was having alittle bit of trouble figuring out how to get the final step between n and n-1.....
anyways over all a good week though....im finding myself enjoying proofs more now that we dont have the same constraints as CSC165....I've got to say, that its far easier to express proofs using the short form version than it is using ONLY math, however to Danny's point it is easier to misconstrue the meaning though.
----------------
Now playing: Sato Hiromi - Guri Guri
via FoxyTunes
----------------
Now playing: Shakira ft Wyclef Jean - Hips Don't Lie
via FoxyTunes
Subscribe to:
Post Comments (Atom)
1 comment:
You can certainly post course-specific material that doesn't give away solutions to something that hasn't been turned in yet.
Post a Comment