• Log InLog In
  • Register
Liquid`
Team Liquid Liquipedia
EDT 19:33
CEST 01:33
KST 08:33
  • Home
  • Forum
  • Calendar
  • Streams
  • Liquipedia
  • Features
  • Store
  • EPT
  • TL+
  • StarCraft 2
  • Brood War
  • Smash
  • Heroes
  • Counter-Strike
  • Overwatch
  • Liquibet
  • Fantasy StarCraft
  • TLPD
  • StarCraft 2
  • Brood War
  • Blogs
Forum Sidebar
Events/Features
News
Featured News
[ASL22] Finals Preview: Sweet Victory!9[ASL22] Ro4 Preview: Mirror Mirror6[ASL22] Ro8 Preview: Within Reach5[ASL22] Ro8 Preview: In A Tizzy11[ASL22] Ro16 Preview: Holy Diver5
Community News
[$1250] International ShieldBattery League36Weekly Cups (October 5-11): Farewell to 5.0.164Rollback Netcode in Brood War1375.0.17 Patch Notes - October 7, 202624Weekly Cups Results (Sep 28-Oct 4)0
StarCraft 2
General
Server Blocker No more sc2 streamers on team liquid? SCII needs to put more weight on strategy and tact Stellar Fest 2 Replay Pack Terran AddOns placement
Tourneys
WORTEX Challenger Series — Open SC2 LAN in Budapes RSL goes to London! 2026 Offline Finals Nov 21-22 Sparkling Tuna Cup - Weekly Open Tournament Stellar Fest TWO the Moon (Dec 16-20) Master Swan Open (Global Bronze-Master 2)
Strategy
[H] ZvP Mid-Late Game: Stalkers Collossi HT
Custom Maps
[G] How to playtest arcade maps [A] Nemrods 1/4 players [M] (2) Sweltering Sands [M] (2) Frigid Storage
External Content
Mutation # 548 Shining Bright The PondCast: SC2 News & Results Mutation # 547 Temple Of Terror Mutation # 546 Catch the Train
Brood War
General
Rollback Netcode in Brood War Mineral gathering rate (boosted) for each patch Ziemie's Starcraft 1 Prequel Campaign NaDa's Body BW General Discussion
Tourneys
[ASL22] Grand Finals [$1250] International ShieldBattery League [Megathread] Daily Proleagues 2v2v2v2 Tournament
Strategy
Cliff Jump Revisited (1 in a 1000 strategy) Simple Questions, Simple Answers Replay Review Process - What do you do?
Other Games
General Games
Stormgate/Frost Giant Megathread Nintendo Switch Thread Dawn of War IV Warcraft III: The Frozen Throne General RTS Discussion Thread
Dota 2
Dota 2 Champions League Season 3 Begins April 25!
League of Legends
[TL LoL EUW IHs] Teemo shall perish
Heroes of the Storm
Heroes of the Storm 2.0
Hearthstone
Deck construction bug
TL Mafia
TL Mafia Community Thread
Community
General
Things Aren’t Peaceful in Palestine US Politics Mega-thread Artificial Intelligence Thread European Politico-economics QA Mega-thread Russo-Ukrainian War Thread
Fan Clubs
Serral Fan Club
Media & Entertainment
Movie Discussion! [Manga] One Piece
Sports
TeamLiquid Health and Fitness Initiative For 2023 MLB/Baseball 2023 Football (Soccer) Thread
World Cup 2022
Tech Support
Computer Build, Upgrade & Buying Resource Thread
TL Community
Recent Gifted Posts
Blogs
How Much Genes Contribute to…
TrAiDoS
ShieldBattery on Mac
Kraekkling
[ASL22] Ro4 Day1 Ticket Giv…
bITt.mAN
38 yo Retired SWE loo…
PurE)Rabbit-SF
Customize Sidebar...

Website Feedback

Closed Threads



Active: 10513 users

Math Problem - Page 4

Forum Index > General Forum
Post a Reply
Prev 1 2 3 4 5 6 7 Next All
RzzE
Profile Joined August 2007
Germany20 Posts
January 22 2008 20:40 GMT
#61
On January 23 2008 05:34 LossLeader wrote:
Show nested quote +
On January 23 2008 04:35 RzzE wrote:
If that was correct (or even if it wasn't ) I'd like to propose the following puzzle:

Four people are on one side of a bridge in the dark. The bridge can only support 2 people at a time. There is only one torch among the four of them and the torch needs to be carried along with the pair crossing the bridge.

The people take different times to cross the bridge:It takes them 10 mins, 5 mins, 2 mins and 1 min respectively. A pair crossing the bridge walks at the speed of the slowest of the two of them.

What is the minimum time for all of them to have crossed the bridge?

Answer:
+ Show Spoiler +

17 mins



I guess I must still be in 6th grade, but it seems that this is a bit of a trick question.



Sorry about the wording. I mean what is the minimum time to unite all the four people on the opposite shore.
BlackJack
Profile Blog Joined June 2003
United States10574 Posts
January 22 2008 21:01 GMT
#62
On January 23 2008 05:31 Muirhead wrote:
Problem/Paradox:
There are countably infinite many prisoners sitting in a row
(i.e. the prisoners are numbered 1,2,3,4,5,... on to infinity)

One day a judge comes and says to them:
Tomorrow you will each be given either a black or a white hat. You will be able to see the hats of those prisoners with a higher number than yours, but not the hats of those prisoners with a lower number than yours. You will not be able to see your own hat. You will then each simultaneously write down a guess of either black or white on a piece of paper. If you guess your own hat color correctly, you will be set free. Otherwise you will be executed.

The prisoners discuss all night what they will do. One suddenly realizes that, with a proper strategy, they can ensure that almost 100% of them will survive. What is that strategy?


+ Show Spoiler +
they each ask the guy below them what color their hat is. then that guy tells them and that's what they right down. everyone lives except for the first guy.
Muirhead
Profile Blog Joined October 2007
United States557 Posts
January 22 2008 21:16 GMT
#63
Haha... sorry they can't speak with or see anyone below them...
starleague.mit.edu
LTT
Profile Blog Joined March 2003
Shakuras1095 Posts
January 23 2008 01:01 GMT
#64
The most common posing of this problem has the prisoners guess audibly their hat in sequence. This allows them to use parity to save prisoner 2 and up 100% of the time and prisoner 1 50% of the time.

Requiring the guesses to be simultaneous and written, while not allowing them to communicate in any way, removes this option.

I don't see how they can get anywhere near 100% unless it is something silly like each prisoner writes down his guess and signs it as the prisoner in front of him.
toopham
Profile Blog Joined December 2005
United States551 Posts
January 23 2008 01:30 GMT
#65
On January 22 2008 23:31 dybydx wrote:
Show nested quote +
John says: "If I don't know the date, then Mike can't either"

means knowing day or the month number alone is not sufficient to determine which 1 is correct

thus it can not be 6/7 and can not be 12/2. Thus John knows it can not be 6/X or 12/X

Show nested quote +
Mike says: "I didn't know it before, but now I know it"

Mike realizes that it can only be 3/X or 9/X
Now Mike knows the number.

Show nested quote +
John says: "Now I know it too."

John realizes his statement allow Mike get the month, thus it can not be 3/5 or 9/5
This leaves 3/4, 3/8 and 9/1
Now John has the answer. Because the number he has is 9

ANSWER: 9/1

Meander got it first. GJ


I think your explanation is kinda confusing so I will try to rephase it. I hope it'll make more sense to other ppl.

John says: "If I don't know the date, then Mike can't either"

Mike says: "I didn't know it at first, but now I know it"

John says: "Now I know it too."


John is given the Month
Mike is given the Date.
John's 1st statement mean you cant figure it out just by month or date..
X/7 and X/2 is the only 2 date in there that doesnt have any other dates in diff month.
Thus the date can't be 7 or 2.
Now Mike know that date can't be 7 or 2 but he know the real date. So it can't be 6/X since if he know 6/7 is impossible then 6/4 is left. It can't be 12/X since if it is in 12/X then John's 1st statement wouldn't be true. It would be a contradiction.

Mike realize now it can only be 3/X or 9/X
possible choices: 3/4 , 3/5, 3/8 , 9/1, 9/5

Mike now say he didnt know it at first but now he know it. Thus it can't be 3/5 or 9/5 since mike know the date he doesnt know the month thus if it was the 5th, Mike would still dont know if it's 3/5 or 9/5.
Possible choices: 3/4, 3/8, 9/1
John know the Month thus now knowing that Mike figure out the date means that the month must be 9/1.
DIE!!!
dybydx
Profile Blog Joined December 2007
Canada1764 Posts
Last Edited: 2008-01-23 02:09:23
January 23 2008 01:45 GMT
#66
On January 23 2008 06:16 Muirhead wrote:
Haha... sorry they can't speak with or see anyone below them...

By this stmt i am assuming you are telling us they CAN speak with ppl ABOVE them.
How about the first prisoner purpose speakout the color of the hat of the person immediately "above" him. (the first person can write anything down, he dies 50% of the time anyways.) this way, the 2nd person knows what to right down. repeat the process and ~100% of em will live.

btw that 12 coin question suggests there may be a better solution to the simple logarithmic answer to the 1000 coin question. ^^
although personally i would accept the logarithm solution

For those interested in some raw math questions...
Which is greater, e^pi or pi^e? Provide proof.
(obviously "my calculator say so" is not a proof)

[edit o god the typos :<
...from the land of imba
Muirhead
Profile Blog Joined October 2007
United States557 Posts
Last Edited: 2008-01-23 02:20:07
January 23 2008 02:15 GMT
#67
On January 23 2008 10:45 dybydx wrote:
Show nested quote +
On January 23 2008 06:16 Muirhead wrote:
Haha... sorry they can't speak with or see anyone below them...

By this stmt i am assuming you are telling us they CAN speak with ppl ABOVE them.
How about the first prisoner purpose speakout the color of the hat of the person immediately "above" him. (the first person can write anything down, he dies 50% of the time anyways.) this way, the 2nd person knows what to right down. repeat the process and ~100% of em will live.


For those interested in some raw math questions...
Which is greater, e^pi or pi^e? Provide proof.
(obviously "my calculator say so" is not a proof)



On January 23 2008 10:01 LTT wrote:
The most common posing of this problem has the prisoners guess audibly their hat in sequence. This allows them to use parity to save prisoner 2 and up 100% of the time and prisoner 1 50% of the time.

Requiring the guesses to be simultaneous and written, while not allowing them to communicate in any way, removes this option.

I don't see how they can get anywhere near 100% unless it is something silly like each prisoner writes down his guess and signs it as the prisoner in front of him.


Ok you guys there is no trick... they can't speak to one another at all. As a hint, remember that there are infinitely many prisoners. That is very important, and the reason the paradox works. By the way, the paradox is a probabilistic interpretation of the existence of nonmeasurable sets.

As for the e^pi vs. pi^e question... taking logs we want to know if ln(e)/e or ln(pi)/pi is bigger. But ln(x)/x is decreasing on the range [e,pi], as can be seen by taking the derivative. Thus, ln(e)/e>ln(pi)/pi, which implies e^pi>pi^e
starleague.mit.edu
BottleAbuser
Profile Blog Joined December 2007
Korea (South)1888 Posts
Last Edited: 2008-01-23 02:23:42
January 23 2008 02:16 GMT
#68
To LossLeader on the bridge problem:
+ Show Spoiler +

4 people are on, say, the left side of the bridge, and we want to bring all of them over to the right side.
They take 10, 5, 2, 1 minutes to cross, and only 1 or 2 can cross at once, and they need to carry the torch.

Person 1 and Person 2 cross to right side. +2 minutes have elapsed.

Person 1 crosses back to left side. +1 minutes cost.

Person 1 hands the torch over to Person 10 and Person 5, who cross the bridge together. +10 minutes cost.

Person 5 hands the torch over to Person 2, who crosses the bridge again (to the left). +2 minute cost.

Person 2 and Person 1 cross the bridge together to the right. +2 minute cost.

Adding them gives us 17 minutes.
Compilers are like boyfriends, you miss a period and they go crazy on you.
BottleAbuser
Profile Blog Joined December 2007
Korea (South)1888 Posts
January 23 2008 02:22 GMT
#69
Muirhead's hat problem:

We don't know what relationship one's own hat has with the hats other people have. We don't even know if 1/2 of the hats are black or white (that is, everyone's hat might be black but yours, or whatever). I don't think there's enough information to guarantee (statistically) ANY number of survivors.
Compilers are like boyfriends, you miss a period and they go crazy on you.
dybydx
Profile Blog Joined December 2007
Canada1764 Posts
Last Edited: 2008-01-23 02:24:44
January 23 2008 02:23 GMT
#70
Murihead,

i dont think ur solution is correct... on that pi^e thing
http://www.google.com/search?hl=en&safe=off&client=firefox-a&rls=org.mozilla:en-US:official&hs=WHV&q=pi^e - e^pi&btnG=Search

i think muri has to explain his questions a lil more. we are all making some assumptions only to be denied the assumption can not be made.

we need to know what is allowed and what isnt.
...from the land of imba
BottleAbuser
Profile Blog Joined December 2007
Korea (South)1888 Posts
January 23 2008 02:25 GMT
#71
On January 23 2008 11:23 dybydx wrote:
Murihead,

i dont think ur solution is correct... on that pi^e thing
http://www.google.com/search?hl=en&safe=off&client=firefox-a&rls=org.mozilla:en-US:official&hs=WHV&q=pi^e - e^pi&btnG=Search


I didn't bother going through the reasoning, but the result is correct. If pi^e - e^pi < 0, that implies that e^pi > pi^e, which was his result.
Compilers are like boyfriends, you miss a period and they go crazy on you.
NonY
Profile Blog Joined June 2007
8751 Posts
January 23 2008 02:27 GMT
#72
I think that e^pi is greater than pi^e. Throughout the histories of many cultures, there have been a number of discoveries that have startled the peoples of the nations inhabited thereby. One of those such discoveries is that of pi^e whichof when it has been transliterated becomes a number so-called "raised" to another number, both of which of these numbers hitherto referred is another number onto which many special, even "magical" properties subside. Firstly, is the property futurely noted as The Log Property for which the e number and its subsidiaries are so famously recognized by the nations inhabited thereby. Not to be confused with the pi, nor almost equally sometimes confused previously mentioned the number for which it has been "raised" unceremoniously called The Circle Property for which many mysterious mysteries have been conducted by leading investigators of our scientific fields (BBC, 1998). The following sentences are making a transition for a place in a further along beyond "elementary" and so accordingly those of you whom have been satisfactorily understanding so far may no longer "ride the boat" so to speak as the waves tumble and crumble into an advanced setting. Rigorously speaking in mathematically hard terminologies, bolstered by the affections of the sciences of the computers, and so unceremoniously provided by the peoples of the nations inhabited thereby, it is reasonable enough to put forward, in precedent of QED, that pi^e is sometimes considered greater than e^pi, but this is a grave error. Microscopic examinations, and no closer, will reveal that in sample sizes that shallforth staunchly forhold no numbers that should, in any circumstances (and should they, Teamliquid.net © 2002-2008 All Rights Reserved shall not be held responsible) children under the age of 14 should be exercising caution, shall not in whatever cases, as aforementioned peoples should agree, will without question be below 5. In conclusion, Ungoro Crater is a 0.
"Fucking up is part of it. If you can't fail, you have to always win. And I don't think you can always win." Elliott Smith ---------- Yet no sudden rage darkened his face, and his eyes were calm as they studied her. Then he smiled. 'Witness.'
dybydx
Profile Blog Joined December 2007
Canada1764 Posts
January 23 2008 02:30 GMT
#73

I didn't bother going through the reasoning, but the result is correct. If pi^e - e^pi < 0, that implies that e^pi > pi^e, which was his result.

dat dude edited his answer :< not fair :'(

besides his proof isnt complete anyways
...from the land of imba
Muirhead
Profile Blog Joined October 2007
United States557 Posts
Last Edited: 2008-01-23 02:45:14
January 23 2008 02:30 GMT
#74
I don't understand what is wrong with my proof that e^pi>pi^e... Yes I edited the answer after I made a stupid mistake the first time .

In complete rigor:

ln(x)/x has derivative (x*1/x-ln(x)*1)/(x^2)=(1-ln(x))/(x^2) which is negative in the range (e,pi).

Thus, ln(pi)/pi<ln(e)/e, so e*ln(pi)<pi*ln(e), so ln(pi^e)<ln(e^pi)

Hence, as ln is an increasing function, pi^e<e^pi



My problem really is a paradox... it is in fact true that each prisoner "has a 50%" chance of dying, but overall 100% of them are guaranteed to survive. There is no relationship amongst the hats. You may assume if you like that the judge overheard the prisoners strategy and chooses his assignment of hats in a way to kill as many prisoners as possible. Please ask if you need any specific clarifications. Of course, assume the axiom of choice. There are countably infinite many prisoners, so this is not a "real-life" situation. The sequence of hats could be any infinite sequence like black,white,black,black,black,white,white,black,... It is also possible for all hats to be black.
starleague.mit.edu
Rev0lution
Profile Blog Joined August 2007
United States1805 Posts
January 23 2008 02:31 GMT
#75
On January 23 2008 06:01 BlackJack wrote:
Show nested quote +
On January 23 2008 05:31 Muirhead wrote:
Problem/Paradox:
There are countably infinite many prisoners sitting in a row
(i.e. the prisoners are numbered 1,2,3,4,5,... on to infinity)

One day a judge comes and says to them:
Tomorrow you will each be given either a black or a white hat. You will be able to see the hats of those prisoners with a higher number than yours, but not the hats of those prisoners with a lower number than yours. You will not be able to see your own hat. You will then each simultaneously write down a guess of either black or white on a piece of paper. If you guess your own hat color correctly, you will be set free. Otherwise you will be executed.

The prisoners discuss all night what they will do. One suddenly realizes that, with a proper strategy, they can ensure that almost 100% of them will survive. What is that strategy?


+ Show Spoiler +
they each ask the guy below them what color their hat is. then that guy tells them and that's what they right down. everyone lives except for the first guy.


I thought of the same lol, the first prisoner would say what hat color he sees and then go on and on until all prisoners are done, all save but the first guy.

EDIT: I will try to solve it in a later post...
My dealer is my best friend, and we don't even chill.
dybydx
Profile Blog Joined December 2007
Canada1764 Posts
January 23 2008 02:43 GMT
#76
On January 23 2008 11:30 Muirhead wrote:
In complete rigor:

ln(x)/x has derivative (x*1/x-ln(x)*1)/(x^2)=(1-ln(x))/(x^2) which is negative in the range (e,pi).

Thus, ln(pi)/pi<ln(e)/e, so e*ln(pi)<pi*ln(e), so ln(pi^e)<ln(e^pi)

Hence, as ln is an increasing function, pi^e<e^pi


accepted ^^ GJ
...from the land of imba
BottleAbuser
Profile Blog Joined December 2007
Korea (South)1888 Posts
January 23 2008 02:47 GMT
#77
Muirhead, I'm stumped. PM me the resolution or something pls.

Okay, for each prisoner, he has 50% chance of correctly guessing his own hat if he randomizes his decision. This will imply that an infinite number of prisoners (N/2) will survive, which seems nice, but that still approaches 50%, not 100%. Probably not the correct approach.
Compilers are like boyfriends, you miss a period and they go crazy on you.
dybydx
Profile Blog Joined December 2007
Canada1764 Posts
January 23 2008 02:51 GMT
#78
it has to do with the fact that u can see prisoners above you.

but we need info on what kind of interaction you are allowed to have with other prisoners.
muri, are we allowed to interact in any way? other than just seeing ones above you.
...from the land of imba
Muirhead
Profile Blog Joined October 2007
United States557 Posts
January 23 2008 02:56 GMT
#79
No, there is no interaction whatsoever allowed. I PMed the answer to you, BottleAbuser
starleague.mit.edu
ShOoTiNg_SpElLs
Profile Joined July 2003
Korea (South)690 Posts
January 23 2008 03:00 GMT
#80
If we assume the axiom of choice, then I'm assuming we should be considering equivalence classes of the sequences of black/white hats?
Prev 1 2 3 4 5 6 7 Next All
Please log in or register to reply.
Live Events Refresh
Next event in 11h 27m
[ Submit Event ]
Live Streams
Refresh
StarCraft 2
Nina 184
Nathanias 93
SpeCial 69
StarCraft: Brood War
Artosis 551
ProTech127
Dota 2
NeuroSwarm168
League of Legends
Doublelift5643
Counter-Strike
Fnx 1261
Other Games
summit1g7231
gofns6800
FrodaN622
shahzam550
PiGStarcraft350
C9.Mang0312
Maynarde72
Organizations
Other Games
gamesdonequick620
[ Show 14 non-featured ]
StarCraft 2
• Hupsaiya 91
• AfreecaTV YouTube
• intothetv
• Kozan
• IndyKCrew
• Migwel
StarCraft: Brood War
• HerbMon 40
• Eskiya23 30
• BSLYoutube
• STPLYoutube
• ZZZeroYoutube
League of Legends
• Scarra825
Other Games
• imaqtpie1009
• Shiphtur761
Upcoming Events
IntoTheTV X SOOP
11h 27m
PiGosaur Cup
1d
The PondCast
1d 10h
Kung Fu Cup
1d 11h
IntoTheTV X SOOP
2 days
FEL
4 days
Patches Events
4 days
FEL
5 days
Sparkling Tuna Cup
5 days
Replay Cast
5 days
[ Show More ]
WardiTV Weekly
6 days
Liquipedia Results

Completed

ASL Season 22
Blizzard Classic Cup 2026
HCC Season 3

Ongoing

Acropolis #5
IPSL Winter 2026-27
KCM Race Survival 2026 Season 4
Acropolis #5 - GSC
1win Private Club #2
Thunderpick World Champ. '26
ESL Pro League Season 24
Stake Ranked Episode 4
1win Private Club #1
Logitech G Play Connect 2026
SL StarSeries Fall 2026
FISSURE Playground #3
BLAST Open Fall 2026
Esports World Cup 2026

Upcoming

BSL Season 23
SC4ALL II: Brood War
BSL 23: Non-Korean Championship
HSC XXX
Stellar Fest 2: Lunar Cup
SC4ALL II: StarCraft II
Kung Fu Cup 2026 Grand Finals
RSL Offline Finals
eXTREMESLAND 2026
PGL Major Singapore 2026
Stake Ranked Episode 6
BLAST Rivals Fall 2026
IEM Beijing 2026
Stake Ranked Episode 5
PGL Masters Bucharest 2026
TLPD

1. ByuN
2. TY
3. Dark
4. Solar
5. Stats
6. Nerchio
7. sOs
8. soO
9. INnoVation
10. Elazer
1. Rain
2. Flash
3. EffOrt
4. Last
5. Bisu
6. Soulkey
7. Mini
8. Sharp
Sidebar Settings...

Advertising | Privacy Policy | Terms Of Use | Contact Us

Original banner artwork: Jim Warren
The contents of this webpage are copyright © 2026 TLnet. All Rights Reserved.