Main Area and Open Discussion > Living Room

If a tree falls (in c#)

<< < (2/3) > >>

Renegade:
Actually, I have always found the length of a piece of string to be N-1 where n is the required length....
And my programming also comes up short :(
-Fred Nerd (May 08, 2011, 09:57 AM)
--- End quote ---

And the solution to the N-1 string length problem is to have N+1 drinks~! :)

Target:
Actually, I have always found the length of a piece of string to be N-1 where n is the required length....
And my programming also comes up short :(
-Fred Nerd (May 08, 2011, 09:57 AM)
--- End quote ---

And the solution to the N-1 string length problem is to have N+1 drinks~! :)
-Renegade (May 08, 2011, 11:18 AM)
--- End quote ---

this is not a solution as the only output is 2X(N-1)

Renegade:
this is not a solution as the only output is 2X(N-1)
-Target (May 08, 2011, 09:05 PM)
--- End quote ---

However, the wonderful side effect when N > 10 is that you just don't care much anymore. :)

Fred Nerd:
If N>10, then you have way too much string.
I think if I have had N+1 drinks I would get entangled in all of it. And then go from falling trees to 'string theory'

Renegade:
If N>10, then you have way too much string.
I think if I have had N+1 drinks I would get entangled in all of it. And then go from falling trees to 'string theory'
-Fred Nerd (May 09, 2011, 06:08 AM)
--- End quote ---

Wait, if whenever you have string, and need N, you have N-1, then would that be N-1>10 or N>10-1? :)

As for string theory? That requires copious amounts of LSD, not alcohol. :P

Speaking of... I hear N[4 or 7] calling me now...

Navigation

[0] Message Index

[#] Next page

[*] Previous page