This week was far more difficult than the last, although proving existence wasn't difficult, proving a claim about a sequence was. The part I was confused about was the piece that wasn't done in class, which was reaching from "Then j >= 2 #since i = 2" to "Then j^2 > 2 #shown somehow". However, I did understand that proving the contra-positive was a technique one could use to prove the same statement (due to equivalence) and should be used in some cases to make situations easier... anyways... back to the issue...
My idea was that since we have to start off at j >= 2, if we squared both sides it would show that j^2 >= 4, which shows that j^2 > 2... but it seems too simple for Danny to not have written it. Hence I'm having doubts.
Unfortunately this week gets a bit worse, since I couldn't make it to the Wednesday lecture, and I'm having problems understanding the "Infinitely Many Primes" slide, I plan to ask one of my peers for help & the CS help center and if it's not enough I will seek help from office hours.
Friday's lecture was quite difficult but it was only a matter of sitting down and slowly stepping through it before I understood it. Although I'm still currently a bit slow in applying the definition of the floor of x, it's just a matter of practice.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment