• Log InLog In
  • Register
Liquid`
Team Liquid Liquipedia
EST 03:18
CET 09:18
KST 17:18
  • 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
Behind the Blue - Team Liquid History Book2Clem wins HomeStory Cup 287HomeStory Cup 28 - Info & Preview13Rongyi Cup S3 - Preview & Info3herO wins SC2 All-Star Invitational14
Community News
Weekly Cups (Jan 26-Feb 1): herO, Clem, ByuN, Classic win2RSL Season 4 announced for March-April7Weekly Cups (Jan 19-25): Bunny, Trigger, MaxPax win3Weekly Cups (Jan 12-18): herO, MaxPax, Solar win0BSL Season 2025 - Full Overview and Conclusion8
StarCraft 2
General
Behind the Blue - Team Liquid History Book Clem wins HomeStory Cup 28 How do you think the 5.0.15 balance patch (Oct 2025) for StarCraft II has affected the game? HomeStory Cup 28 - Info & Preview Stellar Fest "01" Jersey Charity Auction
Tourneys
HomeStory Cup 28 $5,000 WardiTV Winter Championship 2026 RSL Season 4 announced for March-April PIG STY FESTIVAL 7.0! (19 Feb - 1 Mar) StarCraft Evolution League (SC Evo Biweekly)
Strategy
Custom Maps
[A] Starcraft Sound Mod
External Content
Mutation # 511 Temple of Rebirth The PondCast: SC2 News & Results Mutation # 510 Safety Violation Mutation # 509 Doomsday Report
Brood War
General
Can someone share very abbreviated BW cliffnotes? [ASL21] Potential Map Candidates Gypsy to Korea StarCraft player reflex TE scores 2024 BoxeR's birthday message
Tourneys
[Megathread] Daily Proleagues Escore Tournament StarCraft Season 1 Small VOD Thread 2.0 KCM Race Survival 2026 Season 1
Strategy
Zealot bombing is no longer popular? Simple Questions, Simple Answers Current Meta Soma's 9 hatch build from ASL Game 2
Other Games
General Games
Diablo 2 thread Battle Aces/David Kim RTS Megathread EVE Corporation Nintendo Switch Thread Path of Exile
Dota 2
Official 'what is Dota anymore' discussion
League of Legends
Heroes of the Storm
Simple Questions, Simple Answers Heroes of the Storm 2.0
Hearthstone
Deck construction bug Heroes of StarCraft mini-set
TL Mafia
Mafia Game Mode Feedback/Ideas Vanilla Mini Mafia
Community
General
US Politics Mega-thread Russo-Ukrainian War Thread YouTube Thread The Games Industry And ATVI Things Aren’t Peaceful in Palestine
Fan Clubs
The herO Fan Club! The IdrA Fan Club
Media & Entertainment
[Manga] One Piece Anime Discussion Thread
Sports
2024 - 2026 Football Thread
World Cup 2022
Tech Support
TL Community
The Automated Ban List
Blogs
Play, Watch, Drink: Esports …
TrAiDoS
My 2025 Magic: The Gathering…
DARKING
Life Update and thoughts.
FuDDx
How do archons sleep?
8882
James Bond movies ranking - pa…
Topin
Customize Sidebar...

Website Feedback

Closed Threads



Active: 1352 users

Rapists math problem - Page 2

Blogs > jtan
Post a Reply
Prev 1 2 All
jtan
Profile Blog Joined April 2003
Sweden5891 Posts
February 19 2008 19:35 GMT
#21
Correct~~!

But using that formula asta posted is almost cheating-.,-

Also, the formula doesn't at all require large n since the taylor expansion for 1/e converges amazingly fast. In the problem I said "a large number of rapists". You get 2 correct decimals already at n=5, and with n=20 you get 18 correct decimals.
Enter a Uh
FirstBorn
Profile Blog Joined March 2007
Romania3955 Posts
February 19 2008 21:27 GMT
#22
On February 20 2008 04:25 Cascade wrote:
Show nested quote +
On February 20 2008 02:52 clazziquai wrote:
On February 20 2008 02:42 Cascade wrote:
Solution.

+ Show Spoiler +
Let n be the number of rapists. That random guy can relabel the samples in n! different ways. n choices for where to put hte first label, n-1 for the second label, etc.

-----------------flawed------------
In how many ways can he label them such that he doesnt place the right name on any sample?
For the first label, he has n-1 alternatives. Lets say he places the first label on sample number i. Then the label i can go n-1 samples still, since the only one occupied is his own. So label i goes on sample j. Label j now can go n-2 samples, since i is occupied, and j is both occupied and forbidden. etc. Total number of possible "all innocent" labelings becomes
------------------flawed------------

(n-1)(n-1)(n-2)(n-3)...3*2*1 = n! / n <-- wrong

Now we see that the number of "all innocent" labelings is 1/n times as many as the total number of labels from which we can say that the probability of all the rapists going free is 1/n. Seems to fit with brute force for n=2 and n=3.


EDIT: found a flaw. And a misscalcualtion. sorry, just disregard.


You sound so smart lol. Didn't you solve another really hard math problem earlier? >_>

Is this statistics?


haha, thanks I guess. I've been posting in a few other threads like these yes...


What he means is that he solved all the problems in threads like these.
SonuvBob: Yes, the majority of TL is college-aged, and thus clearly stupid.
gwho
Profile Blog Joined January 2008
United States632 Posts
Last Edited: 2008-02-19 21:33:30
February 19 2008 21:30 GMT
#23
+ Show Spoiler +
0%, because now his fingerprints are all over the samples. they probably set up "connections" for every suspect. and anyone innocent wouldn't touch them.

too easy.

one giveaway is the fact that it's a "large number" of rapists. you should give a number of rapists like 100 or something.
jtan
Profile Blog Joined April 2003
Sweden5891 Posts
February 19 2008 22:21 GMT
#24
........

The fact that the actual number of rapists doesn't matter is what makes it interesting -_-
Enter a Uh
Slithe
Profile Blog Joined February 2007
United States985 Posts
February 19 2008 22:31 GMT
#25
It makes me happy to see that my blog has inspired other people to post up cool math problems. We should create a TL math ring :D
thoraxe
Profile Blog Joined March 2007
United States1449 Posts
February 19 2008 23:55 GMT
#26
man this is waaaaaaay harder than what i thought. I hate these theoretical probablility problems.
Obama singing "Kick Ass" Song: http://www.youtube.com/watch?v=yghFBt-fXmw&feature=player_embedde
imDerek
Profile Blog Joined August 2007
United States1944 Posts
February 20 2008 02:24 GMT
#27
this is called derangement
Least favorite progamers: Leta, Zero, Mind, Shine, free, really <-- newly added
dinmsab
Profile Blog Joined January 2008
Malaysia2246 Posts
February 21 2008 11:54 GMT
#28
Last time it was prisoners, now its rapist...

I like using prisoners moar.
..
jtan
Profile Blog Joined April 2003
Sweden5891 Posts
February 23 2008 17:16 GMT
#29
On February 21 2008 20:54 dinmsab wrote:
Last time it was prisoners, now its rapist...

I like using prisoners moar.

haha, next time slithe and I will construct a prison rape math problem!
Enter a Uh
jtan
Profile Blog Joined April 2003
Sweden5891 Posts
February 23 2008 18:09 GMT
#30
And yeah by request, here is a complete solution, pretty carefully explained. If you are not really into math but would like to know a little-> hit the spoiler buttons!


Ok, let's say there are n rapists, although this won't really matter.

The blood samples are can be labeled in N0:=n! ways.

In how many of these cases does atleast 1 label get the right bloodsample?

N1:=n*(n-1)! = n!

+ Show Spoiler +
first pick 1 of the rapists. Can do that in n ways, Say he got connected with his own bloodsample. Then randomly map the others names into samples in (n-1)! ways


And more generally. In how many cases does atleast i rapists get connected with the right sample?

Ni:=(n over i)*(n-i)!=n!/i!

+ Show Spoiler +
choosing first i from the rapists and giving them the right sample connection. Then randomly distributing the others. So this is the number of ways that could be done.


Now simply by the principle of inclusion/exclusion, N:=number of ways that nobody is connected with his own sample is:

N=N0-N1+N2-N3+...(-1)^i*Ni+...Nn

+ Show Spoiler +
This might be hard to grasp if you havn't seen it before, but it's a fun concept so I'll explain it briefly.

There are totally N0 ways. But then we counted too many, so we remove those cases where 1 guy (or more) got the right sample -> -N1. But then we counted too too few, because we took away some cases twice or more. So we have to add N2 and so on. Well might still be hard to see. Let's have a quick example.
+ Show Spoiler [example] +

25 people on tl.net:
12 plays starcraft
8 plays wc3
9 plays wow

4 plays sc and wc3
3 plays wc3 and wow
3 plays sc and wow

1 plays sc wc3 and wow

So of the 25, how many doesn't play?
One way of calculating this would be 25-(12+8+9)+(4+3+3)-1=5

Simple to understand if you think about it. Or draw venn diagrams.



Ok, if you convinced yourself, let's draw calculate the probability in the original question. p:=probability that no rapist is matched with his own sample=

N/N0=N/n!=1-1+1/2!-1/3!+1/4!-...+(-1)^n *1/n!

If you had kept going forever without stopping at the n:th term you have the taylor expansion for e^-1 exactly.

+ Show Spoiler +
In case you are not familiar with taylor expansions, this is a way to express (almost) any function as a infinite polynomial. This is done by constructing the polynomial so that it's function value and all power-derivatives have the same value for some point.
Taylor expansion for e can be calculated to

e^x=1+x/1!+x^2/2!+...+x^i/i!+...

using the point zero.

(wiki for taylor expansion)

Now take x=-1 to get the exact formula we were stuck with above!


so p=~1/e. The more terms we have in the expansion the closer we will get. Since the sum is alternating with decreasing terms it's simple to show that error=|p-1/x|<1/(n+1)!

So 20 rapists would give a smaller error from 1/e than 1/21!=extremy little.


Wow, this looks a lot more complex then it really is, hope I don't scare away some hs students from math If you take math at university it all comes step by step, and it's not really hard at all.

Cheers!
Enter a Uh
Prev 1 2 All
Please log in or register to reply.
Live Events Refresh
Next event in 2h 42m
[ Submit Event ]
Live Streams
Refresh
StarCraft 2
SortOf 73
StarCraft: Brood War
Hyuk 673
Leta 278
Dewaltoss 126
Shine 70
Shuttle 57
sSak 54
Backho 30
GoRush 28
Dota 2
NeuroSwarm159
febbydoto48
League of Legends
JimRising 768
Super Smash Bros
hungrybox474
Mew2King31
Other Games
Happy435
C9.Mang0297
Livibee63
mouzStarbuck49
Organizations
Other Games
gamesdonequick1142
StarCraft: Brood War
lovetv 31
StarCraft 2
Blizzard YouTube
StarCraft: Brood War
BSLTrovo
sctven
[ Show 13 non-featured ]
StarCraft 2
• Berry_CruncH142
• practicex 52
• AfreecaTV YouTube
• intothetv
• Kozan
• IndyKCrew
• LaughNgamezSOOP
• Migwel
• sooper7s
StarCraft: Brood War
• BSLYoutube
• STPLYoutube
• ZZZeroYoutube
League of Legends
• Jankos847
Upcoming Events
RongYI Cup
2h 42m
herO vs Maru
SC Evo League
4h 42m
Replay Cast
15h 42m
uThermal 2v2 Circuit
1d 3h
WardiTV Winter Champion…
1d 3h
OSC
1d 15h
Replay Cast
2 days
Wardi Open
2 days
Monday Night Weeklies
2 days
Sparkling Tuna Cup
3 days
[ Show More ]
LiuLi Cup
3 days
PiGosaur Monday
3 days
LiuLi Cup
4 days
The PondCast
5 days
KCM Race Survival
5 days
LiuLi Cup
5 days
Online Event
6 days
LiuLi Cup
6 days
Liquipedia Results

Completed

Acropolis #4 - TS4
HSC XXVIII
Underdog Cup #3

Ongoing

CSL 2025 WINTER (S19)
KCM Race Survival 2026 Season 1
Rongyi Cup S3
Nations Cup 2026
IEM Kraków 2026
BLAST Bounty Winter 2026
BLAST Bounty Winter Qual
eXTREMESLAND 2025
SL Budapest Major 2025
ESL Impact League Season 8

Upcoming

Escore Tournament S1: W8
Acropolis #4
IPSL Spring 2026
HSC XXIX
uThermal 2v2 2026 Main Event
Bellum Gens Elite Stara Zagora 2026
RSL Revival: Season 4
WardiTV Winter 2026
LiuLi Cup: 2025 Grand Finals
FISSURE Playground #3
IEM Rio 2026
PGL Bucharest 2026
Stake Ranked Episode 1
BLAST Open Spring 2026
ESL Pro League Season 23
ESL Pro League Season 23
PGL Cluj-Napoca 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.