Week 6

wow its been a while(not a good thing)...anyways yeah wow....i was really surprised by our first term test....im not sure if i should be confident however i thought that the actual induction step for the questions were dead give-aways if you had been paying attention to the course material....particularly the second question where you needed to use inequalities to show that F(n) > ?(depending on the test)...however i am finding my understanding of the material is becoming much better as opposed to how it was last year or even earlier this year....and thats a good thing i think?....well anyways to all those reading this HAPPY THANKSGIVING!!!!!

Week 3: simple or complete?

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

Off to a good start

ahhh start of a new year. *sniff*...and more homework :(.

well when i first walked into CSC236 this year, and saw danny standing up there i knew this was gonna be a good course. And my assumptions were proven true as we started off the year doing examples and learning tricks for/of simple induction proofs. I myself have hit a rough spot with some of the math, in that picturing the sets(in the examples) is difficult, when the math gets more complex. i understand the concept that there is a x in a set that can be applied/added to a subset which will yeild all the possible subsets, however finding x is proving alittle more difficult than it should i think. the problem im having is picturing where x is in the set and what should be kept or should be left behing, and then also where that x should be applied to the next set in the series, or next case.

hmmm.......im sure ill figure it out eventually, all in all it was a good first week though.....OMG THE FIRST PROBLEM SET IS ALREADY DUE THIS WEEK*tugs on hair*....wow things are moving fast