Bitcoin Forum
May 11, 2024, 08:42:20 AM *
News: Latest Bitcoin Core release: 27.0 [Torrent]
 
   Home   Help Search Login Register More  
Pages: « 1 [2]  All
  Print  
Author Topic: 0.30 btc bounty: maths help (statistics)  (Read 14158 times)
lemonginger
Full Member
***
Offline Offline

Activity: 210
Merit: 100


firstbits: 121vnq


View Profile
June 08, 2011, 08:45:49 PM
 #21

hours to work out? Come on people this is a permutations 101 question.

1715416940
Hero Member
*
Offline Offline

Posts: 1715416940

View Profile Personal Message (Offline)

Ignore
1715416940
Reply with quote  #2

1715416940
Report to moderator
1715416940
Hero Member
*
Offline Offline

Posts: 1715416940

View Profile Personal Message (Offline)

Ignore
1715416940
Reply with quote  #2

1715416940
Report to moderator
1715416940
Hero Member
*
Offline Offline

Posts: 1715416940

View Profile Personal Message (Offline)

Ignore
1715416940
Reply with quote  #2

1715416940
Report to moderator
The forum was founded in 2009 by Satoshi and Sirius. It replaced a SourceForge forum.
Advertised sites are not endorsed by the Bitcoin Forum. They may be unsafe, untrustworthy, or illegal in your jurisdiction.
1715416940
Hero Member
*
Offline Offline

Posts: 1715416940

View Profile Personal Message (Offline)

Ignore
1715416940
Reply with quote  #2

1715416940
Report to moderator
ByteCoin
Sr. Member
****
Offline Offline

Activity: 416
Merit: 277


View Profile
June 08, 2011, 10:39:32 PM
 #22

You can check your solution against these exact answers:

0_      738035/120932352
1_      586435/10077696
2_      4301435/20155392
3_      33057475/90699264
4_      33616325/120932352
5_      1145495/15116544
6_      737353/181398528

I don't think it's a particularly easy problem.
An exact formula for the probability of no matches is

6^-12 * Sum_{k=1..6}(6-k)^6 * C(6,k) * Sum_{j=0..k} (-1)^(k-j) * C(k,j) * j^n

where C(a,b)=a!/(b!*(a-b)!)

but this is a simpler case than the other numbers of matches.

Possibly proper mathematicians have more powerful tools to bring to bear on such problems.

Explaining even this simple formula would take quite a lot of work but if you're willing to crack open a maths book then "Stirling numbers of the second kind" would be a good place to start.

ByteCoin
untitlednotepad (OP)
Newbie
*
Offline Offline

Activity: 10
Merit: 0


View Profile
June 09, 2011, 05:44:41 AM
 #23

sorry i thought someone who is familiar with this kind of thing might be able to do it easily. i certainly didn't expect it to take 5 hours for the right person (although i admit it might take me 5 weeks to work it out).
kjj
Legendary
*
Offline Offline

Activity: 1302
Merit: 1025



View Profile
November 02, 2012, 06:55:44 PM
 #24

Sorry for resurrecting this ancient thread, but I figure it is already in obsolete, so no one will care.

For some reason, I started thinking about this again.  I had forgotten the part about the Stirling numbers, but I had the "well, duh!" moment when I realized that 6^12 is only about 2 billion, and I might maybe be able to find some sort of computing device capable of iterating all of the combinations.

Code:
  2176782336			Random	Diff		Stirling	Diff
0   13284630 0.6103% 0.61% -0.0016% 0.6103% 0.0000%
1  126669960 5.8191% 5.82% -0.0028% 5.8191% 0.0000%
2  464554980 21.3414% 21.33% 0.0081% 21.3414% 0.0000%
3  793379400 36.4473% 36.43% 0.0213% 36.4473% 0.0000%
4  605093850 27.7976% 27.80% 0.0010% 27.7976% 0.0000%
5  164951280 7.5778% 7.60% -0.0232% 7.5778% 0.0000%
6    8848236 0.4065% 0.41% -0.0028% 0.4065% 0.0000%

17Np17BSrpnHCZ2pgtiMNnhjnsWJ2TMqq8
I routinely ignore posters with paid advertising in their sigs.  You should too.
Pages: « 1 [2]  All
  Print  
 
Jump to:  

Powered by MySQL Powered by PHP Powered by SMF 1.1.19 | SMF © 2006-2009, Simple Machines Valid XHTML 1.0! Valid CSS!