{'fraction_non_alphanumeric': 0.01893095768374165, 'fraction_numerical': 0.0, 'mean_word_length': 5.375886524822695, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Automated Conjecturing of Frobenius Numbers via Grammatical Evolution

Abstract Conjecturing formulas and other symbolic relations occurs frequently in number theory and combinatorics. If we could automate conjecturing, we could benefit not only from faster conjecturing but also from finding conjectures previously out of our grasp. Grammatical evolution (GE), a genetic programming technique, can be used for automated conjecturing in mathematics. Concretely, this work describes how one can interpret the Frobenius problem as a symbolic regression problem, and then apply GE to it. In this manner, a few formulas for Frobenius numbers of specific quadruples were found automatically. The sketch of the proof of one conjectured formula, using lattice point enumeration method, is provided as well. The same method can easily be used on other problems to speed up and enhance the research process.