{'fraction_non_alphanumeric': 0.014742014742014743, 'fraction_numerical': 0.0, 'mean_word_length': 5.0, '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}}
A general test for divisibility by primes

Prior to the advent of the calculator, divisibility tests were often studied and utilised. Some of these tests were simple and easily remembered; others, more cumbersome and rarely utilised in either practical or theoretical work. The purpose of this article is to present a simple and general test for divisibility which is of applicable and theoretical interest.