<commit_before># Python code for math compute.
To compute a sequence of numbers not divisible by 2 or 3 or 5 or 7
####1. compute1.py :
    Brute force.
####2. compute2.py :
    Find factor which are prime number.
####3. compute3.py :
    Brute force, another version.
####4. compute2.py :
    Find factor which are prime number,another version.
<commit_msg>Revert "modify Readme.md"<commit_after># Python code for math compute.
To compute a sequence of numbers not divisible by 2 or 3 or 5 or 7
1. compute1.py :
    Brute force.
2. compute2.py :
    Find factor which are prime number.
3. compute3.py :
    Brute force, another version.
4. compute2.py :
    Find factor which are prime number,another version.

{'fraction_non_alphanumeric': 0.09154929577464789, 'fraction_numerical': 0.03380281690140845, 'mean_word_length': 3.232142857142857, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, '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}}
{'dir': 'git-commits-cleaned', 'id': '4681623', 'n_tokens_mistral': 229, 'n_tokens_neox': 218, 'n_words': 100}