Search results

How about a program that plays PLAYSCHOOOL!!!

woah...you can't use display? or you can't use print? aaannd what other words or things aren't BOS approved, for algorithms?

(k+1)3<= 2(k+1)2 k3 + 3k2 + 3k + 1 <= 2k2+ 4k + 2 k3 + 3k2 <= 2k2+ k + 1 I dont get how you got the second line from the first line (above). Now is 3k2 <= k + 1 for all integer k>0 Test k=1 3<=2 false Are you allowed to sub in numbers like that in the 3rd step of a proof that...

lol but now im stuck on methodology of induction Prove the below equation holds/does not hold for all integers ( n>0 ) (n^3) <= 2(n^2) could someone solve this by induction please?

Okay, by induction, how would you un-prove this one (n^3) <= 2(n^2) because it works for n = 1 1<2 pretend n = k so it works for one instance of k and it works for one instance of k+1 (i.e. 2) 8 = 8 But fuks up after. I guess now its about the methodology, how do you...

lol yeaaa you see that's da kinda explanation i was looking for! lol but i still got questions. sorta. so you're saying that for this sorta proof, it's about assuming something works, and then proving it doesnt, and if you can't prove it doesnt, then it does...which makes sense. Well, at...

That wasn't what I meant by I don't get it. The method I know. The reasoning behind the method is just...not right though. You shouldn't be able to have a proof that has the inclusion of an assumption in it. That screws up the proof.

woah....you all must really wanna be priests or something huh...

Statement is true for n = 1. Let k = 1 so that k + 1 = 2. Let k = 2 so that k + 1 = 3. Let k = 3 so that k + 1 = 4 and so on. By this process, you can let k = ANY integer --> please note this before i continue the argument of my inability to understand induction logic. Because you...

See, I just want to know if anyone else has the same problem accepting the reasoning behind the inductive process. I'll use the domino theory soulsearcher highlighted for me. 1. The first domino will fall. 2. Whenever a domino falls, its next neighbor will also fall. then you can conclude...

Hey i posted this because i seriously don't understand how induction works logically. I mean the first step is alright, prove n = 1 works, that's all well and good. But then the second step seems a bit...weird to me. Induction is meant to be proving an equation thingy works for all integers...

:santa: Mathematics 2 unit::) Mathematics 3 unit: :burn: Sesaaaaaaaaaaaaame street!

Muse sucks? Steve Vai sucks? What. The. Fuck.

It doesnt matter what topic you choose. As long as you can write good about it. Teachers don't like reading cheesy stuff, they don't like reading stuff that sounds semi-smart. They want to read stuff that seems like a reaal book. Liek a reaaal author would have written. Everything else just gets...

hey, gore and action caaan work ya noe. Anything works, as long as you're a good writer. Otherwise, if it sounds cheap or not well written THEN, you're McScrewed. =)

hey btw can ya tell me what the actual assignment's meant to be? Liek the assignment question? Just outta curiousity. =)

They can't mark ya down for it. Do what ya like.

You kids gotta start reading the REAL books. J.R.R Tolkien C.S Lewis Orson Scott Card Michael Crichton John Grisham Brian Herbert Robert Jordan Tolkien ESPECIALLY. now HE was a truuuueee genius. NOBODY compares to Tolkien. NOBODY!! =)

Not if you're doing the arabic beginners course

Hey sorry to post here, but I was just wondering when you had to do preliminary (this is why i'm not posting there, they prob wouldnt know) composition for ensembles, what did you have to do? What were the rules? Did it have a limit to the length? THANKS!