All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Probability
Never 0 mod 3 (Posted on 2016-03-17) Difficulty: 3 of 5
Let k be a positive integer. Suppose that the integers 1, 2, 3, ...3k, 3k + 1 are written down in random order.

What is the probability that at no time during this process, the sum of the integers that have been written up to that time is divisible by 3?

Source: Putnam competition

No Solution Yet Submitted by Ady TZIDON    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
re: Solution | Comment 3 of 7 |
(In reply to Solution by Brian Smith)

These are the values I get using Brian's formula:

       1                      0.250000000                                       
       2                      0.035714286                                       
       3                      0.003333333                                       
       4                      0.000228938                                       
       5                      0.000012401                                       

for the first five values of k, which disagrees with the direct trials of all possibilities mod 3 in my previous post.     

I repeated the case of k=2, using "1234567" instead of "1231231" and got the same results as before: 0.0714286.                       

  Posted by Charlie on 2016-03-17 14:47:17
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2020 by Animus Pactum Consulting. All rights reserved. Privacy Information