# python_combinatorics

python_combinatorics, a Python code which considers a variety of problems in combinatorics involving counting, combinations, permutations, and so on.

### Related Data and codes:

change_diophantine, a Python code which sets up a Diophantine equation to solve the change making problem, which counts the number of ways a given sum can be formed using coins of various denominations.

change_dynamic, a Python code which uses dynamic programming to solve the change making problem, which counts the number of ways a given sum can be formed using coins of various denominations.

change_greedy, a Python code which uses the greedy method to seek a solution to the change making problem, which tries to match a given amount by selecting coins of various denominations.

change_polynomial, a Python code which uses a polynomial multiplication algorithm to count the ways of making various sums using a given number of coins.

combo, a Python code which includes many combinatorial routines.

diophantine_nd, a Python code which is given a Diophantine equation in N variables, and returns all strictly positive solutions, or all nonnegative solutions.

football_dynamic, a Python code which uses dynamic programming to count the ways of achieving a given score in football.

football2_diophantine, a Python code which uses diophantine analysis to count the ways of achieving a given score in football, ignoring the ordering of events.

football2_dynamic, a Python code which uses dynamic programming to count the ways of achieving a given score in football, respecting the order of events.

knapsack_01_brute, a Python code which uses brute force to solve small versions of the 0/1 knapsack problem;

knapsack_dynamic, a Python code which uses dynamic programming to solve a knapsack problem.

knapsack_greedy, a Python code which uses a greedy algorithm to estimate a solution of the knapsack problem;

mcnuggets, a Python code which counts M(N), the number of ways a given number N of Chicken McNuggets can be assembled, given that they are only available in packages of 6, 9, and 20.

mcnuggets_diophantine, a Python code which uses Diophantine methods to find the ways a given number N of Chicken McNuggets can be assembled, given that they are only available in packages of 6, 9, and 20.

partition_brute, a Python code which uses brute force to seek solutions of the partition problem, splitting a set of integers into two subsets with equal sum.

partition_greedy, a Python code which uses a greedy algorithm to seek a solution of the partition problem, in which a given set of integers is to be split into two groups whose sums are as close as possible.

satisfy_brute, a Python code which uses brute force to find all assignments of values to a set of logical variables which make a complicated logical statement true.

subset, a Python code which enumerates, generates, ranks and unranks combinatorial objects including combinations, partitions, subsets, index sets, and trees.

subset_sum, a Python code which seeks solutions of the subset sum problem, in which it is desired to find a subset of a set of integers which has a given sum.

subset_sum_backtrack, a Python code which uses backtracking to solve the subset sum problem, to find a subset of a set of integers which has a given sum.

subset_sum_brute, a Python code which uses brute force to solve the subset sum problem, to find a subset of a set of integers which has a given sum.

tsp_brute, a Python code which is given a city-to-city distance map, and solves the traveling salesperson problem (TSP), using brute force.

tsp_descent, a Python code which is given a city-to-city distance map, chooses an initial tour at random, and then tries a number of simple variations, seeking to quickly find a tour of lower cost.

tsp_greedy, a Python code which is given a city-to-city distance map, picks a starting city, and then successively visits the nearest unvisited city.

tsp_random, a Python code which is given a city-to-city distance map, and then randomly samples a number of possible tours, to quickly seek a tour of lower length.

Last revised on 07 February 2023.
{"ft_lang_label":"__label__en","ft_lang_prob":0.8780824,"math_prob":0.9358579,"size":4049,"snap":"2023-40-2023-50","text_gpt3_token_len":872,"char_repetition_ratio":0.20049444,"word_repetition_ratio":0.35429448,"special_character_ratio":0.19683872,"punctuation_ratio":0.11788079,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9979815,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-10-03T00:02:21Z\",\"WARC-Record-ID\":\"<urn:uuid:a49a8acc-32b1-4902-a05c-d157d1700976>\",\"Content-Length\":\"7718\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:5663baab-8e33-4465-9d5b-76351c3a76d0>\",\"WARC-Concurrent-To\":\"<urn:uuid:0ab4d5a6-ee26-45c8-ae8a-e2ba31e5c9a2>\",\"WARC-IP-Address\":\"144.174.0.22\",\"WARC-Target-URI\":\"https://people.sc.fsu.edu/~jburkardt/py_src/python_combinatorics/python_combinatorics.html\",\"WARC-Payload-Digest\":\"sha1:6BXNTQI3TFJUHTEZKU6F2REHYNSP7TDH\",\"WARC-Block-Digest\":\"sha1:7IE35J4CUX6GYEQZL3L2DQV44GU74EVI\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-40/CC-MAIN-2023-40_segments_1695233511023.76_warc_CC-MAIN-20231002232712-20231003022712-00419.warc.gz\"}"}