SI
SI
discoversearch

We've detected that you're using an ad content blocking browser plug-in or feature. Ads provide a critical source of revenue to the continued operation of Silicon Investor.  We ask that you disable ad blocking while on Silicon Investor in the best interests of our community.  If you are not using an ad blocker but are still receiving this message, make sure your browser's tracking protection is set to the 'standard' level.
Politics : Formerly About Advanced Micro Devices

 Public ReplyPrvt ReplyMark as Last ReadFilePrevious 10Next 10PreviousNext  
To: Scumbria who wrote (127916)11/10/2000 12:31:25 AM
From: Joe NYC  Read Replies (1) of 1570917
 
Scumbria,

I'm using a very brute force algorithm

I just used a spreadsheet. I converted the number to binary, 1 digit per cell. Then I added the digits.

12 digits 4096 went fine. When I tried to extend it to 16 (Excel's limit of 64K rows) I ran out of memory and lost my spreadsheet.

but I'm sure there is a simple equation.

I am sure there is. And I am pretty sure a few years ago I might have known it <g>

But I think a problem for n coin tosses with 1/4 or less having say tails divided by n should have a numerical result, or at least the limit as n -> infinity should converge to something.

Well, maybe to 0. <g>

Joe
Report TOU ViolationShare This Post
 Public ReplyPrvt ReplyMark as Last ReadFilePrevious 10Next 10PreviousNext