Sun Feb 10 15:10:05 2002
Sun Feb 10 15:31:37 2002
Sun Feb 10 15:40:18 2002
Or I shall simply continue spamming to build up my post count.
Sun Feb 10 16:59:42 2002
Sun Feb 10 17:41:37 2002
How many licks does it take to get to the toosie-roll center of a tootsie pop?
Is it true that for any given X such that X is a whole number greater than 2 and evenly divisible by two, that X is the sum of two primes? If so what is the proof?
Consider a two-dimentional plane X such that X is divided into any number of sections. Consider that each section of plane X is to be filled in by a certain color. What is the minimum amount of colors you will need such that no two adjacent sections of X will be filled in with the same color?
How about for a 3-dimentional X?
If you have 7 distinct pieces of candy with which to hand out to 3 distinct children, how many combinations are possible in handing out said candy assuming that each child gets at least one piece?
Sun Feb 10 22:00:10 2002
Sun Feb 10 23:03:16 2002
Still more fun than BF though.
Sun Feb 10 23:24:59 2002
So I'm crap here.
bollocks! utter bollocks!
It's not everyone's place to smam. Wit counts for as much in OSY as well as pure trolling nonsense. :)
Mon Feb 11 02:50:01 2002
It's not everyone's place to smam. Wit counts for as much in OSY as well as pure trolling nonsense. :)
Still more fun than BF though.
Mon Feb 11 03:11:17 2002
Can anyone answer my questions?
eh? I can't hear you.
Mon Feb 11 10:50:15 2002
What is your name?
Imitation Gruel
What is your quest?
Admiralty and beyond.
What is the airspeed velocity of an unladen swallow?
What breed of swallow?
How much wood can a wood chuck chuck if a wood chuck could chuck wood?
That depends on the motivation of said woodchuck.
Is it true that for any given X such that X is a whole number greater than 2 and evenly divisible by two, that X is the sum of two primes? If so what is the proof?
It is for at least the even numbers through 20.
Consider a two-dimentional plane X such that X is divided into any number of sections. Consider that each section of plane X is to be filled in by a certain color. What is the minimum amount of colors you will need such that no two adjacent sections of X will be filled in with the same color?
How many sections is the plane cut into? For a two-section plane you need two colors; for a 3-section you also need two -- one on each side and one in the middle.
How about for a 3-dimentional X?
How many sections?
If you have 7 distinct pieces of candy with which to hand out to 3 distinct children, how many combinations are possible in handing out said candy assuming that each child gets at least one piece?
7x6x5x4x3x2 = 5280. 7 different possibilities for Candy 1 to Kid 1; 6 for Candy 1 to Kid 2; 5 for Candy 1 to Kid 3; 4 for Candy 2 to Kid 1; 3 for Candy 2 to Kid 2; 2 for Candy 2 to Kid 3, and the last piece of Candy to myself!
The information does not necessarily have to be correct.
Where were you on the night of the 14th?
Which month and year are you referring to?
Who's the dame you've been seen with?
No dames lately. :(
What did you do with the body?
Disposed of it properly, so no one will ever find it.
(Edited by Imitation Gruel at 2:52 am on Feb. 11, 2002)
Mon Feb 11 15:29:33 2002
Is it true that for any given X such that X is a whole number greater than 2 and evenly divisible by two, that X is the sum of two primes? If so what is the proof?
Consider a two-dimentional plane X such that X is divided into any number of sections. Consider that each section of plane X is to be filled in by a certain color. What is the minimum amount of colors you will need such that no two adjacent sections of X will be filled in with the same color?
It doesn't matter how the plane is divided up, the most colors you will ever need for this is 4.
How about for a 3-dimentional X?
I think the number is 7.
If you have 7 distinct pieces of candy with which to hand out to 3 distinct children, how many combinations are possible in handing out said candy assuming that each child gets at least one piece?
Your answer is close, but no soup for you!
The answer is 7 * 6 * 5 * (4!/2!) I think
This is thought to be true for all such numbers, though no mathmatical proof exists. This particular problem is called the 'Goldbox' conjecture. If you solve it, you get a million dollars.
Consider a two-dimentional plane X such that X is divided into any number of sections. Consider that each section of plane X is to be filled in by a certain color. What is the minimum amount of colors you will need such that no two adjacent sections of X will be filled in with the same color?
How about for a 3-dimentional X?
If you have 7 distinct pieces of candy with which to hand out to 3 distinct children, how many combinations are possible in handing out said candy assuming that each child gets at least one piece?