Thomas Lumley • 9/6/2016

On permuting all the things

Read Original

The article details a computational approach in R to list all unique permutations of the digits 2,2,5,5,9,9. It analyzes the resulting numbers to determine how many are multiples of 11 and how many are prime, highlighting the efficiency of random sampling and duplicate removal for small combinatorial problems.

0 comments
#statistics #combinatorics #prime numbers
On permuting all the things

Comments

No comments yet

Be the first to share your thoughts!

Browser Extension

Get instant access to AllDevBlogs from your browser

Top of the Week

1
React, useEffect, and Stale Closures: How to Avoid Them with Dependencies and useRef
Jivbcoop • 4 votes
2
Better react-hook-form Smart Form Components
Maarten Hus • 2 votes
3
AGI, ASI, A*I – Do we have all we need to get there?
John D. Cook • 1 votes
4
Quoting Thariq Shihipar
Simon Willison • 1 votes
5
Dew Drop – January 15, 2026 (#4583)
Alvin Ashcraft • 1 votes
6
Using Browser Apis In React Practical Guide
Jivbcoop • 1 votes