{'fraction_non_alphanumeric': 0.007692307692307693, 'fraction_numerical': 0.0, 'mean_word_length': 5.432098765432099, '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}}
An Interesting Construction Problem

Abstract We present a collection of simple construction problems and determine conditions for which the construction can be carried out with compass and straightedge. Since the problems reduce to finding the roots of quartic polynomials, it is not sufficient to show that the polynomials are irreducible to conclude that the roots are not constructible. Some interesting results appear as we discover general conditions that determine when the solutions are or are not constructible.