Wolfram Language Paclet Repository
Community-contributed installable additions to the Wolfram Language
Combinatorics functions for subsets, tuples, and permutations
Contributed by: Peter Cullen Burbery
This paclet is for Project Euler problems and other applications of combinatorics.
To install this paclet in your Wolfram Language environment,
evaluate this code:
PacletInstall["PeterBurbery/CombinatoricsPaclet"]
To load the code after installation, evaluate this code:
Needs["PeterBurbery`CombinatoricsPaclet`"]
Find the millionth permutation with 10 items:
In[1]:= | ![]() |
Out[1]= | ![]() |
To solve the challenge Lexicographic permutations at Project Euler, subtract 1 and join the digits with FromDigits:
In[2]:= | ![]() |
Out[2]= | ![]() |
The googolth 111-tuple:
In[3]:= | ![]() |
Out[3]= | ![]() |
Find some binomial representations for the number 403:
In[4]:= | ![]() |
Out[4]= | ![]() |
Solve Project Euler's challenge Even Fibonacci numbers by finding even Fibonacci numbers not exceeding 4 million and summing:
In[5]:= | ![]() |
Out[5]= | ![]() |
In[6]:= | ![]() |
Out[6]= | ![]() |
Find the first number whose Fibonacci number contains 1000 digits to solve Project Euler 1000-digit Fibonacci number:
In[7]:= | ![]() |
Out[7]= | ![]() |
Find the longest repetend cycle length up to but not including 1000 to solve Project Euler puzzle Reciprocal cycles:
In[8]:= | ![]() |
Out[8]= | ![]() |
Wolfram Language Version 13.1