Panda, is it possible to ban Lee from Computer Tech?
I mean, literally set his permissions so he's not allowed to post there? Or even view that sub-forum?
Panda, is it possible to ban Lee from Computer Tech?
I mean, literally set his permissions so he's not allowed to post there? Or even view that sub-forum?
congratulations
okay next one
Yarr Maties
Five pirates discover a chest full of 100 gold coins. The pirates are ranked by their years of service, Pirate 5 having five years of service, Pirate 4 four years, and so on down to Pirate 1 with only one year of deck scrubbing under his belt. To divide up the loot, they agree on the following:
The most senior pirate will propose a distribution of the booty. All pirates will then vote, including the most senior pirate, and if at least 50% of the pirates on board accept the proposal, the gold is divided as proposed. If not, the most senior pirate is forced to walk the plank and sink to Davy Jones’ locker. Then the process starts over with the next most senior pirate until a plan is approved.
These pirates are not your ordinary swashbucklers. Besides their democratic leanings, they are also perfectly rational and know exactly how the others will vote in every situation. Emotions play no part in their decisions. Their preference is first to remain alive, and next to get as much gold as possible and finally, if given a choice between otherwise equal outcomes, to have fewer pirates on the boat.
The most senior pirate thinks for a moment and then proposes a plan that maximizes his gold, and which he knows the others will accept. How does he divide up the coins? What plan would the most senior pirate propose on a boat full of 15 pirates?
this is a hard one.
woah, i cant quote...
but anyways, did you just figure it out ivolt?
Pirate 15 needs 7 other people to vote for him. He recruits pirates 13, 11, 9, 7, 5, 3 and 1 with one coin each, leaving 93 coins for Pirate 15. Those pirates will all vote for Pirate 15’s plan because if they don’t, they’ll be stuck with Pirate 14’s plan in which they all get nothing.![]()
Pirate five kills all the others, takes the gold for himself.
Alright, I need a shower. I smell like steamed ass.
Well done Jack
but next one
you have 100 doors that are all initially closed. you make 100 passes, starting with the first door every time. first time thru you visit every door and if the door is closed, you open it, if its open, you close it. The second time you only visit every 2nd door. the third time, every 3rd door (door 3, 6, 9), etc, until you only visit the 100th door.
question: what state are the doors in after the last pass? which are open which are closed?
you can figure out that for any given door, say door #42, you will visit it for every divisor it has. so 42 has 1 & 42, 2 & 21, 3 & 14, 6 & 7. so on pass 1 i will open the door, pass 2 i will close it, pass 3 open, pass 6 close, pass 7 open, pass 14 close, pass 21 open, pass 42 close. for every pair of divisors the door will just end up back in its initial state. so you might think that every door will end up closed? well what about door #9. 9 has the divisors 1 & 9, 3 & 3. but 3 is repeated because 9 is a perfect square, so you will only visit door #9, on pass 1, 3, and 9... leaving it open at the end. only perfect square doors will be open at the end.![]()
Jack, what do I use this Slayer's disc for? lol
at the end, they're all open except the last one