• Log InLog In
  • Register
Liquid`
Team Liquid Liquipedia
EST 15:25
CET 21:25
KST 05:25
  • 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
Team Liquid Map Contest #2312[ASL22] Finals Preview: Sweet Victory!12[ASL22] Ro4 Preview: Mirror Mirror6[ASL22] Ro8 Preview: Within Reach5[ASL22] Ro8 Preview: In A Tizzy11
Community News
Weekly Cups (Nov 9-15): Clem and herO take over5Dark completes military service, returns to SC217[BSL23] RO16 Group Stage20Weekly Cups (Nov 2-8): herO back on top?2Weekly Cups (Oct 26 - Nov 1): MaxPax, herO, Solar win0
StarCraft 2
General
SC4ALL: II Indiegogo Campaign Announcement No more SC2 streamers on team liquid? Team Liquid Map Contest #23 StarCraft open world shooter announced at BlizzCon Weekly Cups (Nov 9-15): Clem and herO take over
Tourneys
RSL goes to London! 2026 Offline Finals Nov 21-22 soO & FanTaSy return! SC2 Kevin Scrim 4v4 (Nov 16) Sparkling Tuna Cup - Weekly Open Tournament Sea Duckling Open (Global, Bronze-Diamond) Dark returns! GSL CK #7 4v4 Team Battle (Nov 19)
Strategy
[H] ZvP Mid-Late Game: Stalkers Collossi HT
Custom Maps
[G] How to playtest arcade maps Starcraft 2 Advance [D] the control group Simple Questions/Answers
External Content
Mutation # 552 Secret Storm The PondCast: SC2 News & Results Mutation # 551 Robotic Revival Mutation # 550 Graveyard Shift
Brood War
General
List of top players active on ShieldBattery SC4ALL: II Indiegogo Campaign Announcement Light introduces ShieldBattery on his YouTube Practice Partners (Official) BW General Discussion
Tourneys
2v2v2v2 Tournament Stage 2: Players KCM Race Survival 2026 Season 4 SC1 Kevin Scrim hosted by SOOP (Nov 18-19) [Megathread] Daily Proleagues
Strategy
Pluto's TvP 5Marine 2Medic Push Simple Questions, Simple Answers Infested Terran strategies in 2026 Nuke strategy worked in K-League 2026-11-09
Other Games
General Games
Stormgate/Frost Giant Megathread Nintendo Switch Thread The PlayStation 5 Warcraft III: The Frozen Throne Free Space RTS Game, optimised f. Phone/Tablet etc
Dota 2
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
Artificial Intelligence Thread US Politics Mega-thread Russo-Ukrainian War Thread The Big Programming Thread Trading/Investing Thread
Fan Clubs
Fan Club Resource Thread Reynor Fan Club The Flash Fan Club
Media & Entertainment
Movie Discussion! Anime Discussion Thread [Manga] One Piece
Sports
Football (Soccer) Thread TeamLiquid Health and Fitness Initiative For 2023
World Cup 2022
Tech Support
Computer Build, Upgrade & Buying Resource Thread
TL Community
The Automated Ban List Recent Gifted Posts
Blogs
The time I organised my…
AssyrianKing
Why I built Repalyzer (1.1.…
BlueStar
Innovate or Game Over?
TrAiDoS
ShieldBattery on Mac
Kraekkling
Can Bots Beat Pros?? Starcr…
namkraft
James Bond movies ranking - pa…
Topin
StarCraft improvement
iopq
Customize Sidebar...

Website Feedback

Closed Threads



Active: 16282 users

Yet Another Math Puzzle - Page 4

Blogs > Muirhead
Post a Reply
Prev 1 2 3 4 All
jtan
Profile Blog Joined April 2003
Sweden5891 Posts
May 14 2009 17:33 GMT
#61
On May 15 2009 01:58 qrs wrote:
Show nested quote +
On May 14 2009 23:16 jtan wrote:
On May 14 2009 qrs wrote:
On May 14 2009 22:04 jtan wrote:
For some positive integer N, uncountably many spiders have width at least 1/N

Is this really true though? Couldn't it be that the spiders remain countable until you allow for infinitely small legs?

I wondered that as well, at first glance, but no, it couldn't be. If for all positive integers N the spiders with width at least 1/N were countable, you could count all the spiders by listing the spiders of width at least 1, then the spiders of width at least 1/2 (that haven't been counted yet), and so on. Any given spider must have some finite width, and for any finite number some 1/N is smaller than it, so you will count that spider when you get to the requisite N.

Yep, you are right.

actually, not quite right, on second thought. The method I gave for counting them all doesn't work (because you may never finish counting the first set of spiders), but they are still countable by other methods, e.g. count 1 from the first set, then 2 each from the first two sets, then 3 each from the first three sets, etc. It's the countable union of countable sets, like ninjafetus said.

Yeah, that's the standard way of counting a countable union of countable sets, I thought that was what you meant in the first place
Enter a Uh
jtan
Profile Blog Joined April 2003
Sweden5891 Posts
Last Edited: 2009-05-14 17:35:48
May 14 2009 17:35 GMT
#62
On May 15 2009 02:08 -orb- wrote:
If it's an infinite plane why can't you just line them up going out to infinity....

The problem is not to just place infinietly many spiders in the plane, but uncountably many, that's a big difference http://en.wikipedia.org/wiki/Countable_set
Enter a Uh
qrs
Profile Blog Joined December 2007
United States3637 Posts
May 14 2009 17:42 GMT
#63
On May 15 2009 02:33 jtan wrote:
Show nested quote +
On May 15 2009 01:58 qrs wrote:
On May 14 2009 23:16 jtan wrote:
On May 14 2009 qrs wrote:
On May 14 2009 22:04 jtan wrote:
For some positive integer N, uncountably many spiders have width at least 1/N

Is this really true though? Couldn't it be that the spiders remain countable until you allow for infinitely small legs?

I wondered that as well, at first glance, but no, it couldn't be. If for all positive integers N the spiders with width at least 1/N were countable, you could count all the spiders by listing the spiders of width at least 1, then the spiders of width at least 1/2 (that haven't been counted yet), and so on. Any given spider must have some finite width, and for any finite number some 1/N is smaller than it, so you will count that spider when you get to the requisite N.

Yep, you are right.

actually, not quite right, on second thought. The method I gave for counting them all doesn't work (because you may never finish counting the first set of spiders), but they are still countable by other methods, e.g. count 1 from the first set, then 2 each from the first two sets, then 3 each from the first three sets, etc. It's the countable union of countable sets, like ninjafetus said.

Yeah, that's the standard way of counting a countable union of countable sets, I thought that was what you meant in the first place

Right, I know it's the standard way, but I wasn't thinking, and I didn't phrase it that way the first time.
'As per the American Heart Association, the beat of the Bee Gees song "Stayin' Alive" provides an ideal rhythm in terms of beats per minute to use for hands-only CPR. One can also hum Queen's "Another One Bites The Dust".' —Wikipedia
ninjafetus
Profile Joined December 2008
United States231 Posts
May 15 2009 05:19 GMT
#64
On May 14 2009 14:53 Muirhead wrote:
Congratulations cascade and qrs! I hope it was entertaining and enlightening even if it took all your time.

Here's my solution from when I first solved the problem:

+ Show Spoiler +
Suppose, for the sake of contradiction, that there are uncountably many spiders in the plane.
Let the width of a spider be the minimum distance from its center to one of its three endpoints.
For some positive integer N, uncountably many spiders have width at least 1/N. Erase all the spiders with width less than 1/N
Cover the plane with countably many disks of diameter 1/N. At least one such disk has uncountably many centers of spiders. Erase all spiders with centers not in the disk.
Each spider divides the disk into three distinct regions. Associate a triplet of rational points to the spider, one point in each region.


I don't know if the last part works. You haven't said anything about the spiders not intersecting. For example, if I had an ε-disk at the origin, and I took an uncountable set of spiders centered along the y- axis between (-ε/2, ε/2), each of which with legs going to the same three points, I could find a single rational triplet which could be associated with all of them. So I have uncountable spiders, but only countably many (in fact, only 1) rational triplet, and therefore no contradiction yet.

Now, this construction clearly won't be possible for the original problem (since their legs intersect), but your solution has nothing to prevent th construction I mentioned. I would think a complete solution would need to show how intersections being impossible implies that the uncountable rational triplets can be chosen distinctly.... which would then be the contradiction you need.
jtan
Profile Blog Joined April 2003
Sweden5891 Posts
May 15 2009 12:33 GMT
#65
On May 15 2009 14:19 ninjafetus wrote:
Show nested quote +
On May 14 2009 14:53 Muirhead wrote:
Congratulations cascade and qrs! I hope it was entertaining and enlightening even if it took all your time.

Here's my solution from when I first solved the problem:

+ Show Spoiler +
Suppose, for the sake of contradiction, that there are uncountably many spiders in the plane.
Let the width of a spider be the minimum distance from its center to one of its three endpoints.
For some positive integer N, uncountably many spiders have width at least 1/N. Erase all the spiders with width less than 1/N
Cover the plane with countably many disks of diameter 1/N. At least one such disk has uncountably many centers of spiders. Erase all spiders with centers not in the disk.
Each spider divides the disk into three distinct regions. Associate a triplet of rational points to the spider, one point in each region.


I don't know if the last part works. You haven't said anything about the spiders not intersecting. For example, if I had an ε-disk at the origin, and I took an uncountable set of spiders centered along the y- axis between (-ε/2, ε/2), each of which with legs going to the same three points, I could find a single rational triplet which could be associated with all of them. So I have uncountable spiders, but only countably many (in fact, only 1) rational triplet, and therefore no contradiction yet.

Now, this construction clearly won't be possible for the original problem (since their legs intersect), but your solution has nothing to prevent th construction I mentioned. I would think a complete solution would need to show how intersections being impossible implies that the uncountable rational triplets can be chosen distinctly.... which would then be the contradiction you need.

No intersections implies different triplets.Take any two spiders in the disc. The first spider divides the disc in three zones, and the second must have it's center node in one of these zones. Since they cannot intersect the second spider will have at least two points of its triplet inside this same zone, hence different triplets.
Enter a Uh
ninjafetus
Profile Joined December 2008
United States231 Posts
May 15 2009 13:31 GMT
#66
By that logic, couldn't I take the irrationals in [0,1], state that each irrational splits [0,1] into two distinct regions, associate a pair of rationals to each irrational, and therefore irrationals are countable since they have a correspondence to QxQ? Which we know doesn't work?
jtan
Profile Blog Joined April 2003
Sweden5891 Posts
May 15 2009 13:37 GMT
#67
On May 15 2009 22:31 ninjafetus wrote:
By that logic, couldn't I take the irrationals in [0,1], state that each irrational splits [0,1] into two distinct regions, associate a pair of rationals to each irrational, and therefore irrationals are countable since they have a correspondence to QxQ? Which we know doesn't work?

No, because nothing in your construction prevents two irrationals from being mapped to the same element of QxQ
Enter a Uh
ninjafetus
Profile Joined December 2008
United States231 Posts
May 15 2009 17:07 GMT
#68
That was my point. But I see how it works now, it is because of no intersections of the legs... it's just that the phrase "Each spider divides the disk into three distinct regions. Associate a triplet of rational points to the spider, one point in each region" leaves a bit of the solution off, and I have a bad habit of posting what I'm thinking before I've spent enough time on it =p

Actually, by the way Muirhead defined 'width' of a spider, all three points of a second spider would be contained in a single region of the first, since all three legs would reach the edge of the disk.
jtan
Profile Blog Joined April 2003
Sweden5891 Posts
May 15 2009 17:47 GMT
#69
On May 16 2009 02:07 ninjafetus wrote:
Actually, by the way Muirhead defined 'width' of a spider, all three points of a second spider would be contained in a single region of the first

Not nessessarily if you think about it, but atleast two of them would

no big deal though
Enter a Uh
qrs
Profile Blog Joined December 2007
United States3637 Posts
May 15 2009 19:25 GMT
#70
On May 16 2009 02:47 jtan wrote:
Show nested quote +
On May 16 2009 02:07 ninjafetus wrote:
Actually, by the way Muirhead defined 'width' of a spider, all three points of a second spider would be contained in a single region of the first

Not nessessarily if you think about it
no? Looks to me like they would: the center of the spider is in one of the 3 regions; for any of its endpoints to be in a different region, that leg would have to cross the line bounding that region.
'As per the American Heart Association, the beat of the Bee Gees song "Stayin' Alive" provides an ideal rhythm in terms of beats per minute to use for hands-only CPR. One can also hum Queen's "Another One Bites The Dust".' —Wikipedia
jtan
Profile Blog Joined April 2003
Sweden5891 Posts
May 15 2009 19:29 GMT
#71
On May 16 2009 04:25 qrs wrote:
Show nested quote +
On May 16 2009 02:47 jtan wrote:
On May 16 2009 02:07 ninjafetus wrote:
Actually, by the way Muirhead defined 'width' of a spider, all three points of a second spider would be contained in a single region of the first

Not nessessarily if you think about it
no? Looks to me like they would: the center of the spider is in one of the 3 regions; for any of its endpoints to be in a different region, that leg would have to cross the line bounding that region.

Ah, I wasn't talking about leg-points, but the points of the rational triplet of that spider
Enter a Uh
ninjafetus
Profile Joined December 2008
United States231 Posts
May 15 2009 19:33 GMT
#72
Oh, I see what you mean. Yeah, you could choose a rational point for the second spider in a completely different sector of the first. My intuition wants the coordinates for the points to not cross any boundaries, either, though :p
Prev 1 2 3 4 All
Please log in or register to reply.
Live Events Refresh
Next event in 14h 35m
[ Submit Event ]
Live Streams
Refresh
StarCraft 2
ProTech134
EmSc Tv 20
StarCraft: Brood War
Britney 12540
Shuttle 508
Dewaltoss 132
910 8
Dota 2
XaKoH 422
BananaSlamJamma419
Heroes of the Storm
Liquid`Hasu460
Other Games
tarik_tv4063
Grubby2676
FrodaN1218
ScreaM777
RotterdaM604
Beastyqt539
mouzStarbuck402
ArmadaUGS124
QueenE64
Trikslyr57
ZombieGrub20
Organizations
Other Games
BasetradeTV139
StarCraft 2
EmSc Tv 20
[ Show 16 non-featured ]
StarCraft 2
• AfreecaTV YouTube
• intothetv
• Kozan
• IndyKCrew
• Migwel
StarCraft: Brood War
• Azhi_Dahaki21
• 80smullet 16
• FirePhoenix3
• Michael_bg 3
• BSLYoutube
• STPLYoutube
• ZZZeroYoutube
Dota 2
• masondota2934
• WagamamaTV752
Other Games
• imaqtpie712
• Shiphtur562
Upcoming Events
RSL Revival
14h 35m
AI Arena Tournament
20h 35m
BSL
23h 35m
eOnzErG vs StRyKeR
Cross vs JDConan
RSL Revival
1d 15h
IPSL
1d 20h
Ret vs ggnore13
nOmaD vs Aether
BSL
1d 23h
Bonyth vs Doodle
Kyrie vs Jimin
Replay Cast
2 days
WardiTV Weekly
2 days
Kung Fu Cup
3 days
Solar vs Classic
ByuN vs SHIN
PiGosaur Cup
4 days
[ Show More ]
The PondCast
5 days
KCM Race Survival
5 days
Liquipedia Results

Completed

Proleague 2026-11-17
Blizzard Classic Cup 2026
HCC Season 3

Ongoing

Acropolis #5
KCM Race Survival 2026 Season 4
International ShieldBattery League
BSL Season 23
IPSL Winter 2026-27
Calamity Cup Div. A Season 8
Underdog Cup 2026 Div 2-3
Stake Ranked Episode 6
BLAST Rivals Fall 2026
IEM Beijing 2026
PGL Masters Bucharest 2026
Stake Ranked Episode 5
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

Upcoming

Sector 591
YSL S4
SC4ALL II: Brood War
CSL 2026 Winter (S23)
NBSL 2026 Xiamen LAN
BSL 23: Non-Korean Championship
HSC XXX
Stellar Fest 2: Lunar Cup
StarCraft2 Weekly Open Tournament 2026 Grand Finals
SC4ALL II: StarCraft II
Kung Fu Cup 2026 Grand Finals
RSL Offline Finals
IEM Kraków 2027
PGL Bucharest 2027
BLAST Bounty Winter 2027
PGL Major Singapore 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.