Author Topic: Whole-tone / Phrygian / Locrian Noodling Addicts Anonymous  (Read 790 times)

0 Members and 1 Guest are viewing this topic.

recursivelyenumerable

  • you might think that; I couldn't possibly comment
  • Senior Member
Whole-tone / Phrygian / Locrian Noodling Addicts Anonymous
« on: October 17, 2010, 10:33:52 PM »
I cannot stop inflicting this on everyone in my apartment building. How ashamed of myself should I be?
QED

Powerslave

  • Senior Member
Re: Whole-tone / Phrygian / Locrian Noodling Addicts Anonymous
« Reply #1 on: October 17, 2010, 10:34:59 PM »
the fuck the fuck the fuck

Diunx

  • Humble motherfucker with a big-ass dick
  • Senior Member
Re: Whole-tone / Phrygian / Locrian Noodling Addicts Anonymous
« Reply #2 on: October 17, 2010, 11:33:55 PM »
smh
Drunk

Bildi

  • AKA Bildo
  • Senior Member
Re: Whole-tone / Phrygian / Locrian Noodling Addicts Anonymous
« Reply #3 on: October 18, 2010, 01:33:05 AM »
ITT music nerds assembing.

Madrun Badrun

  • twin-anused mascot
  • Senior Member
Re: Whole-tone / Phrygian / Locrian Noodling Addicts Anonymous
« Reply #4 on: October 18, 2010, 02:04:46 AM »
Recursive, how do I do an inductive proof for this recurence

T(n) = T(n/2) + n     n > 1
       =  3                 elsewise

where n = 2^k


I think the answer is nlg2n + 3 but I can't figure out the proof and feel dumb  :(

recursivelyenumerable

  • you might think that; I couldn't possibly comment
  • Senior Member
Re: Whole-tone / Phrygian / Locrian Noodling Addicts Anonymous
« Reply #5 on: October 18, 2010, 02:07:22 AM »
I'm going to sleep
QED

Fresh Prince

  • a one-eyed cat peepin' in a seafood store
  • Senior Member
Re: Whole-tone / Phrygian / Locrian Noodling Addicts Anonymous
« Reply #6 on: October 18, 2010, 02:23:18 AM »
bwhhaahhaa
888

Raban

  • Senior Member
Re: Whole-tone / Phrygian / Locrian Noodling Addicts Anonymous
« Reply #7 on: October 18, 2010, 03:28:51 AM »
is the recursive equivalent of a drunk thread?

Madrun Badrun

  • twin-anused mascot
  • Senior Member

Madrun Badrun

  • twin-anused mascot
  • Senior Member
Re: Whole-tone / Phrygian / Locrian Noodling Addicts Anonymous
« Reply #9 on: October 18, 2010, 06:52:41 PM »
Recursive, how do I do an inductive proof for this recurence

T(n) = T(n/2) + n     n > 1
       =  3                 elsewise

where n = 2^k


I think the answer is nlg2n + 3 but I can't figure out the proof and feel dumb  :(

Solved it.  Recursive doesn't  live up to his name!

Tauntaun

  • I'm cute, you should be too.
  • Senior Member
Re: Whole-tone / Phrygian / Locrian Noodling Addicts Anonymous
« Reply #10 on: October 18, 2010, 09:43:26 PM »
Diminished baby!  :rock
:)

Powerslave

  • Senior Member
Re: Whole-tone / Phrygian / Locrian Noodling Addicts Anonymous
« Reply #11 on: October 18, 2010, 10:16:33 PM »
omg that kitty in your avatar I wanna cuddle it to death  :-[ :heart