<commit_before><commit_msg>Create cyclic_numbers.md<commit_after># Title

Constructing Cyclic Numbers

# Difficulty

Intermediate

# Description

https://en.wikipedia.org/wiki/Cyclic_number 

A cyclic number is an integer in which cyclic permutations of the digits are successive multiples of the number. 

Cyclic numbers can be constructed using the following steps: 

1. Let b be the number base (10 for decimal)
1. Let p be a prime that does not divide b.
1. Let t = 0.
1. Let r = 1.
1. Let n = 0.
1. loop:

    1. Let t = t + 1
    1. Let x = r * b
    1. Let d = int(x / p)
    1. Let r = x mod p
    1. Let n = n * b + d
    1. If r != 1 then repeat the loop.

1. if t = p − 1 then n is a cyclic number.

Your challenge today is a bit different than a typical challenge. Instead of creating or hunting for an algorith, your challenge is to *implement* the above algorithm and create some cyclic numbers. 
{'fraction_non_alphanumeric': 0.07142857142857142, 'fraction_numerical': 0.023076923076923078, 'mean_word_length': 2.827731092436975, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, 'https://': 1, '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': '1530555', 'n_tokens_mistral': 304, 'n_tokens_neox': 279, 'n_words': 152}