We are releasing the MacOS version for the new “Chebyshev’s Bias Visualizer”. The new version has an improved user interface as well as a number of additional features like chart scrolling and zooming. For your convenience, the executable is released in .app as well as in .dmg versions.
For my Probability and Statistics classes I wrote a small application that solves a famous Coupon Collector’s Problem: “A breakfast cereal manufacturer offers a coupon hidden in each package of cereal, and there are K kinds of coupons altogether. The collector wants to have a complete collection of all K coupons. What is the probability P(N,K) that exactly N boxes of cereal will have to be purchased in order to obtain, for the first time, a complete collection of at least one of each of the K kinds of coupons?”
You can download our application here (Windows 64-bit only). The application uses bignum arithmetic and works for any K and N . The solution was also separately confirmed by numerical simulation. Enjoy!
For my Probability and Statistics classes I wrote a small application that simulates a famous Banach Matchbox Problem: “Suppose a mathematician carries two matchboxes at all times: one in his left pocket and one in his right. Each time he needs a match, he is equally likely to take it from either pocket. Suppose he reaches into his pocket and discovers for the first time that the box picked is empty. If it is assumed that each of the matchboxes originally contained N matches, what is the probability that there are exactly K matches in the other box?”You can download our application for Windows, Linux and MacOS 64-bit only. Enjoy!
For my Probability and Statistics classes I wrote a small application that simulates a modified Birthday Paradox: “Given N people in the room, what is the probability that K days will be shared as birthdays (meaning each day is shared by 1, 2, 3, 4 or more pairs)?”
You can download our application here (Windows, Linux and MacOS 64-bit only). Enjoy!
For my Probability and Statistics classes I wrote a small application that solves an old and well-known problem: “What is the probability that no runs of K consecutive tails will occur in N coin tosses?”
We started to develop a new version of our “4000 Chebyshev’s Bias Tester” that uses OpenMP for multi-threading.
Initial tests indicated that the test speed could be increased 4-5 times on a 4-core 8-thread processor that launches 8 copies of primesieve as a real-time prime number generator.
With the advent of affordable multi-core processors such as 32-core 64-thread AMD Ryzen™ Threadripper™ 2990WX Processor, the ranges beyond 1016 become possible in reasonable time without supercomputers and massively parallel processing (MPP).