• Log InLog In
  • Register
Liquid`
Team Liquid Liquipedia
EDT 03:58
CEST 09:58
KST 16:58
  • 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] Ro4 Preview: Mirror Mirror6[ASL22] Ro8 Preview: Within Reach5[ASL22] Ro8 Preview: In A Tizzy11[ASL22] Ro16 Preview: Holy Diver5[ASL22] Ro16 Preview: Rough Waters10
Community News
Weekly Cups (October 5-11): Farewell to 5.0.162Rollback Netcode in Brood War1005.0.17 Patch Notes - October 7, 202624Weekly Cups Results (Sep 28-Oct 4)0SC4ALL: II SC2 Complete Invited Player Lineup10
StarCraft 2
General
Team Liquid Map Contest #22: Results and Winners SCII needs to put more weight on strategy and tact How do you feel about the mass reverts in the 5.0.17 PTR? Server Blocker Stellar Fest 2 Replay Pack
Tourneys
Master Swan Open (Global Bronze-Master 2) $3,500 WardiTV Not-Summer Championship Stellar Fest TWO the Moon (Dec 16-20) ISSL (IntoTheTV x SOOP SC2 League): Premier RSL 2026 Offline Finals LCQ Sign-Ups
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
The PondCast: SC2 News & Results Mutation # 547 Temple Of Terror Mutation # 546 Catch the Train Mutation # 545 And Drops and Rifts
Brood War
General
BW General Discussion Bot on ladder Rollback Netcode in Brood War Sagi.gg Launcher Released BGH Auto Balance -> http://bghmmr.eu/
Tourneys
2v2v2v2 Tournament Small VOD Thread 2.0 ASL 22 Finals [Women's StarCraft] MonstarZ vs Dreams 2026-10-15
Strategy
Cliff Jump Revisited (1 in a 1000 strategy) Simple Questions, Simple Answers Replay Review Process - What do you do?
Other Games
General Games
Nintendo Switch Thread Stormgate/Frost Giant Megathread Dawn of War IV General RTS Discussion Thread Warcraft III: The Frozen Throne
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
US Politics Mega-thread Russo-Ukrainian War Thread Things Aren’t Peaceful in Palestine Artificial Intelligence Thread Canadian Politics Mega-thread
Fan Clubs
Serral Fan Club
Media & Entertainment
[Manga] One Piece Movie Discussion! Diablo Animated Series on Netflix
Sports
MLB/Baseball 2023 Football (Soccer) Thread TeamLiquid Health and Fitness Initiative For 2023
World Cup 2022
Tech Support
Computer Build, Upgrade & Buying Resource Thread
TL Community
Recent Gifted Posts
Blogs
The Link Between Gaming and …
TrAiDoS
[ASL22] Ro4 Day1 Ticket Giv…
bITt.mAN
38 yo Retired SWE loo…
PurE)Rabbit-SF
Can Bots Beat Pros?? Starcr…
namkraft
[meme] I finally understa…
LUCKY_NOOB
Customize Sidebar...

Website Feedback

Closed Threads



Active: 8802 users

Happy 410th Birthday, Fermat! - Page 2

Blogs > EsX_Raptor
Post a Reply
Prev 1 2 3 Next All
intotheheart
Profile Blog Joined January 2011
Canada33091 Posts
August 17 2011 15:21 GMT
#21
Best blog ever. Just sayin'.
kiss kiss fall in love
EsX_Raptor
Profile Blog Joined February 2008
United States2802 Posts
Last Edited: 2011-08-17 15:40:14
August 17 2011 15:35 GMT
#22
Let's do the good-old MU Puzzle:

Assume that we have the following string:

MI

and that we can perform operations on it based strictly off the following rules:

I. Add a U to the end of any string ending in I. For example: MI to MIU.
II. Double any string after the M (that is, change Mx, to Mxx). For example: MIU to MIUIU.
III. Replace any III with a U. For example: MUIIIU to MUUU.
IV. Remove any UU. For example: MUUU to MU.

Is it possible to obtain MU?

If you find an answer to this, please post it in spoilers. I'm still working on it!

Edit: New page: More decoration:

[image loading]
SecondChance
Profile Joined December 2010
Australia603 Posts
August 17 2011 15:37 GMT
#23
All those who didn't go so well in highshcool and have no fucking idea what is going on in this thread yet wished they understood say "I".



I understand to an extent, but it looks like this:

<|understood|-----lolwut---------------------------------------------------------------------------------------------------------|>
I see the want to in your eyes.
ComaDose
Profile Blog Joined December 2009
Canada10357 Posts
August 17 2011 15:51 GMT
#24
On August 18 2011 00:37 SecondChance wrote:
+ Show Spoiler +

All those who didn't go so well in highshcool and have no fucking idea what is going on in this thread yet wished they understood say "I".



I understand to an extent, but it looks like this:

<|understood|-----lolwut---------------------------------------------------------------------------------------------------------|>


You wont learn this in any high-school I've heard of.
I spoiled myself with a solution to the MI string from google lol
.
I want more decoration!

[image loading][image loading][image loading]
BW pros training sc2 is like kiss making a dub step album.
EtherealDeath
Profile Blog Joined July 2007
United States8366 Posts
Last Edited: 2011-08-17 17:04:17
August 17 2011 16:57 GMT
#25
On August 18 2011 00:35 EsX_Raptor wrote:
Let's do the good-old MU Puzzle:

Assume that we have the following string:

MI

and that we can perform operations on it based strictly off the following rules:

I. Add a U to the end of any string ending in I. For example: MI to MIU.
II. Double any string after the M (that is, change Mx, to Mxx). For example: MIU to MIUIU.
III. Replace any III with a U. For example: MUIIIU to MUUU.
IV. Remove any UU. For example: MUUU to MU.

Is it possible to obtain MU?

If you find an answer to this, please post it in spoilers. I'm still working on it!

Edit: New page: More decoration:

[image loading]


+ Show Spoiler [solution] +

We approach this algebraically.

Suppose we have n Is, and we want to reduce them to a single U. We approach this instead as k+3 I's, since the first 3 I's we can reduce to a U. The question is then, given what k can we completely erase the string. The only way we can remove strings is to remove UU. UU is produced by k=6.

Thus, in order for the string subsequent to M to be reducible to U, it must consist of 3+6n I's, for some n.

At the same time, we can only generate powers of 2 for the number of I's. Thus 3+6n = 2^m for n,m, which is so say we want an m such that 2^m - 3 ≅ 0 mod 6.

2^1 ≅ 1 mod 6
2^2 ≅ 4 mod 6
2^3 ≅ 2 mod 6
2^4 ≅ 4 mod 6
etc we have hit a cycle

Therefore it is impossible to produce MU.

Other cases ignored because it is clearly impossible to reduce them.

edit - Aw fuck it according to wiki I could have just used invariants LOL so much simpler fml.
EsX_Raptor
Profile Blog Joined February 2008
United States2802 Posts
August 17 2011 17:05 GMT
#26
On August 18 2011 01:57 EtherealDeath wrote:
Show nested quote +
On August 18 2011 00:35 EsX_Raptor wrote:
Let's do the good-old MU Puzzle:

Assume that we have the following string:

MI

and that we can perform operations on it based strictly off the following rules:

I. Add a U to the end of any string ending in I. For example: MI to MIU.
II. Double any string after the M (that is, change Mx, to Mxx). For example: MIU to MIUIU.
III. Replace any III with a U. For example: MUIIIU to MUUU.
IV. Remove any UU. For example: MUUU to MU.

Is it possible to obtain MU?

If you find an answer to this, please post it in spoilers. I'm still working on it!

Edit: New page: More decoration:

[image loading]


+ Show Spoiler [solution] +

We approach this algebraically.

Suppose we have n Is, and we want to reduce them to a single U. We approach this instead as k+3 I's, since the first 3 I's we can reduce to a U. The question is then, given what k can we completely erase the string. The only way we can remove strings is to remove UU. UU is produced by k=6.

Thus, in order for the string subsequent to M to be reducible to U, it must consist of 3+6n I's, for some n.

At the same time, we can only generate powers of 2 for the number of I's. Thus 3+6n = 2^m for n,m, which is so say we want an m such that 2^m - 3 ≅ 0 mod 6.

2^1 ≅ 1 mod 6
2^2 ≅ 4 mod 6
2^3 ≅ 2 mod 6
2^4 ≅ 4 mod 6
etc we have hit a cycle

Therefore it is impossible to produce MU.

Other cases ignored because it is clearly impossible to reduce them.

That's what I thought. Whoever made that puzzle made me spend quite some time trying to solve the unsolvable. lol

By the way, it's your turn to ask us a question!
EtherealDeath
Profile Blog Joined July 2007
United States8366 Posts
August 17 2011 17:14 GMT
#27
On August 18 2011 02:05 EsX_Raptor wrote:
Show nested quote +
On August 18 2011 01:57 EtherealDeath wrote:
On August 18 2011 00:35 EsX_Raptor wrote:
Let's do the good-old MU Puzzle:

Assume that we have the following string:

MI

and that we can perform operations on it based strictly off the following rules:

I. Add a U to the end of any string ending in I. For example: MI to MIU.
II. Double any string after the M (that is, change Mx, to Mxx). For example: MIU to MIUIU.
III. Replace any III with a U. For example: MUIIIU to MUUU.
IV. Remove any UU. For example: MUUU to MU.

Is it possible to obtain MU?

If you find an answer to this, please post it in spoilers. I'm still working on it!

Edit: New page: More decoration:

[image loading]


+ Show Spoiler [solution] +

We approach this algebraically.

Suppose we have n Is, and we want to reduce them to a single U. We approach this instead as k+3 I's, since the first 3 I's we can reduce to a U. The question is then, given what k can we completely erase the string. The only way we can remove strings is to remove UU. UU is produced by k=6.

Thus, in order for the string subsequent to M to be reducible to U, it must consist of 3+6n I's, for some n.

At the same time, we can only generate powers of 2 for the number of I's. Thus 3+6n = 2^m for n,m, which is so say we want an m such that 2^m - 3 ≅ 0 mod 6.

2^1 ≅ 1 mod 6
2^2 ≅ 4 mod 6
2^3 ≅ 2 mod 6
2^4 ≅ 4 mod 6
etc we have hit a cycle

Therefore it is impossible to produce MU.

Other cases ignored because it is clearly impossible to reduce them.

That's what I thought. Whoever made that puzzle made me spend quite some time trying to solve the unsolvable. lol

By the way, it's your turn to ask us a question!


Hmm...
Explain why the following scenario is true.

Suppose we have two entangled particles, let's say their state is a|1>|0>+b|0>|1> to be simple, where the values of a and b are not particularly important save that their squares sum to 1, but let's use one of the Bell States, that is a=b=1/sqrt(2). Now we measure one of the particles to determine it's actual state. We know that instantaneously, the state of the other particle is set. However, it is impossible to determine any classical information from this instantaneous effect - i.e., cannot gain any physical information. Why? Or rather, what information do you think you could gain that you didn't have before?
TL AntiHack
Profile Joined May 2011
39 Posts
August 17 2011 17:17 GMT
#28
5/5, you sir deserve applause. Thank you for making my day better.

On August 18 2011 00:21 IntoTheheart wrote:
Best blog ever. Just sayin'.
Currently not active
EtherealDeath
Profile Blog Joined July 2007
United States8366 Posts
August 17 2011 17:18 GMT
#29
On August 18 2011 02:17 TL AntiHack wrote:
5/5, you sir deserve applause. Thank you for making my day better.

Show nested quote +
On August 18 2011 00:21 IntoTheheart wrote:
Best blog ever. Just sayin'.


hax.
Pengtoss
Profile Blog Joined April 2011
207 Posts
August 17 2011 17:30 GMT
#30
I am stupid
Aletheia27
Profile Blog Joined July 2010
United States267 Posts
Last Edited: 2011-08-17 17:45:06
August 17 2011 17:44 GMT
#31
On August 17 2011 23:49 Iranon wrote:
Show nested quote +
On August 17 2011 23:38 EsX_Raptor wrote:
It is also believed that a proof to the Riemann hypothesis would compromise internet security.

Iranon, you forgot to ask your question!


Oh, right! And it sure would -- for number theoretic reasons. It would allow for a fast factoring algorithm, which compromises RSA.

I'll keep on the topic of fun math that a lot of people know about but relatively few actually follow.

Can you turn a sphere inside out without poking holes in it or making any sharp creases? The sphere's surface can pass through itself, and you can stretch and rotate parts of it as much as you like, but you can't break it and glue it back together. If you know what the terms mean, I'm asking for a diffeomorphism between two spheres that reverses the orientation.


I believe you can although it hinges on the axiom of choice...

EDIT: I don't remember exactly why though... Guess I wasn't meant to be a math major
I am that I am
Primadog
Profile Blog Joined April 2010
United States4411 Posts
August 17 2011 17:50 GMT
#32
Nothing new to add, but here's my favorite geek song:
Thank God and gunrun.
Ruyguy
Profile Blog Joined January 2011
Canada988 Posts
August 17 2011 18:02 GMT
#33
this blog makes me feel so stupid haha.
Kukaracha
Profile Blog Joined February 2011
France1954 Posts
August 17 2011 18:43 GMT
#34
I remember being 15 and stupid and not giving a fuck about math classes. I would litterally do nothing because I had refused to buy a scientific calculator that could support functions. To my defense, our techer was a clown, the year before that we had a great one and I had some of the best grades in the class.

But then I grew up and found out that I missing out a whole beautiful world... I don't know if I'll ever dedicate myself to it but I'd like to give a try oince more, by myself this time.
Le long pour l'un pour l'autre est court (le mot-à-mot du mot "amour").
ComaDose
Profile Blog Joined December 2009
Canada10357 Posts
August 17 2011 19:06 GMT
#35
EtherealDeath's question was too hard!
I only took first year chemistry and promptly forgot everything involved.
I only mention chemistry becuase i only vaguely recognize the syntax involved in "a|1>|0>+b|0>|1>" as from that class
moar math and physics!

I propose a new question: "whoes 410th birthday is it and what is he famous for?"
should be easy enough.
BW pros training sc2 is like kiss making a dub step album.
Aletheia27
Profile Blog Joined July 2010
United States267 Posts
August 17 2011 19:13 GMT
#36
On August 18 2011 04:06 ComaDose wrote:
EtherealDeath's question was too hard!
I only took first year chemistry and promptly forgot everything involved.
I only mention chemistry becuase i only vaguely recognize the syntax involved in "a|1>|0>+b|0>|1>" as from that class
moar math and physics!

I propose a new question: "whoes 410th birthday is it and what is he famous for?"
should be easy enough.


It's a quantum physics problem actually.... but i don't want to answer this cause I don't havea good question
I am that I am
EsX_Raptor
Profile Blog Joined February 2008
United States2802 Posts
August 17 2011 19:22 GMT
#37
I, too, was perplexed by EtherealDeath's problem. However, I would gladly work it through if he were to give us a few hints as to how to approach it (I know next to nil about quantum physics).

By the way, I have been practicing writing trivial proofs and decided to give proving the MU puzzle a try:

[image loading]

I most likely (and as per-usual) left out something critical.
ComaDose
Profile Blog Joined December 2009
Canada10357 Posts
Last Edited: 2011-08-17 19:41:54
August 17 2011 19:23 GMT
#38
On August 18 2011 04:13 Aletheia27 wrote:
Show nested quote +
On August 18 2011 04:06 ComaDose wrote:
EtherealDeath's question was too hard!
I only took first year chemistry and promptly forgot everything involved.
I only mention chemistry becuase i only vaguely recognize the syntax involved in "a|1>|0>+b|0>|1>" as from that class
moar math and physics!

I propose a new question: "whoes 410th birthday is it and what is he famous for?"
should be easy enough.


It's a quantum physics problem actually.... but i don't want to answer this cause I don't havea good question

You should answer and give a lame question then.... now I'm googling cause I feel ignorant.
Its pretty much your calling to continue this thread.

EDIT: Your proof is true but a little.... shallow, like i mean just missing some whys and therefore... pretty much exactly like a professional would do it good job ;p

randall from xkcd helped me understand it better ;p linky

EDIT: can your question be rewritten as this?
+ Show Spoiler +

Suppose we have two entangled particles. Now we measure one of the particles to determine it's actual state. We know that instantaneously, the state of the other particle is set. However, it is impossible to determine any classical information from this instantaneous effect - i.e., cannot gain any physical information. Why? Or rather, what information do you think you could gain that you didn't have before?

i.e. is the answer your looking for true for all entangled particles?
BW pros training sc2 is like kiss making a dub step album.
EsX_Raptor
Profile Blog Joined February 2008
United States2802 Posts
August 17 2011 19:44 GMT
#39
Thanks for the link!

From now on, I will try a mathematical approach to every puzzle I encounter to save myself the potential time-loss of trying one with no solution. ;p

[image loading]
M.C. Escher

And someone still needs to answer ComaDose's question!

On August 18 2011 04:06 ComaDose wrote:
I propose a new question: "whoes 410th birthday is it and what is he famous for?"

EtherealDeath
Profile Blog Joined July 2007
United States8366 Posts
August 17 2011 22:49 GMT
#40
Well let's reword it.

You know that if one measures Particle A to be in state 1, then B is in 0. If A is measured to be in state 2, then B is in 1, and conversely if you measure B, then A is immediately set if it has not already been set by measurement.

Some have thought this could be used for FTL (faster than light) communication, since the "information transfer" is instantaneous.

However, this is not the case.

In short, what does measuring your particle tell you that you didn't already know?
Prev 1 2 3 Next All
Please log in or register to reply.
Live Events Refresh
OSC
08:00
OSC Elite Rising Star #21
Liquipedia
[ Submit Event ]
Live Streams
Refresh
StarCraft: Brood War
Rain 2724
Zeus 728
Killer 427
Larva 215
Dewaltoss 154
soO 116
HiyA 97
Pusan 27
Shinee 22
Bale 21
[ Show more ]
ZergMaN 16
ajuk12(nOOB) 15
Noble 9
Counter-Strike
shoxiejesuss218
Other Games
gofns30283
summit1g6172
Coldzera 763
olofmeister572
WinterStarcraft496
Happy301
Organizations
StarCraft: Brood War
UltimateBattle 25
[ Show 11 non-featured ]
StarCraft 2
• AfreecaTV YouTube
• intothetv
• Kozan
• IndyKCrew
• Migwel
StarCraft: Brood War
• BSLYoutube
• STPLYoutube
• ZZZeroYoutube
Dota 2
• lizZardDota2202
League of Legends
• Stunt555
Other Games
• Shiphtur709
Upcoming Events
Online Event
3h 2m
Korean StarCraft League
19h 2m
Afreeca Starleague
22h 2m
Rush vs Soulkey
CranKy Ducklings
1d 2h
AI Arena Tournament
1d 8h
BSL Open Qualifier
1d 11h
Sparkling Tuna Cup
2 days
OSC
2 days
IPSL
2 days
BSL Open Qualifier
2 days
[ Show More ]
WardiTV Weekly
3 days
IntoTheTV X SOOP
4 days
PiGosaur Cup
4 days
The PondCast
5 days
Kung Fu Cup
5 days
IntoTheTV X SOOP
6 days
Liquipedia Results

Completed

Super Anchor Qualifying S3
Blizzard Classic Cup 2026
Copium Cup

Ongoing

ASL Season 22
Acropolis #5
HCC Season 3
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

Acropolis #5 - GSC
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
1win Private Club #2
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.