kyu_6.a_rule_of_divisibility_by_13 package

Submodules

kyu_6.a_rule_of_divisibility_by_13.test_thirt module

Test for -> A Rule of Divisibility by 13.

Created by Egor Kostan. GitHub: https://github.com/ikostan

class kyu_6.a_rule_of_divisibility_by_13.test_thirt.ThirtTestCase(methodName='runTest')

Bases: TestCase

Testing ‘thirt’ function.

_classSetupFailed = False

_class_cleanups = []

test_thirt = None

test_thirt_0(**kw)

Testing ‘thirt’ function with various test data [with n=1234567, expected=87].

Returns:

test_thirt_1(**kw)

Testing ‘thirt’ function with various test data [with n=321, expected=48].

Returns:

test_thirt_2(**kw)

Testing ‘thirt’ function with various test data [with n=8529, expected=79].

Returns:

test_thirt_3(**kw)

Testing ‘thirt’ function with various test data [with n=85299258, expected=31].

Returns:

test_thirt_4(**kw)

Testing ‘thirt’ function with various test data [with n=5634, expected=57].

Returns:

test_thirt_5(**kw)

Testing ‘thirt’ function with various test data [with n=1111111111, expected=71].

Returns:

test_thirt_6(**kw)

Testing ‘thirt’ function with various test data [with n=987654321, expected=30].

Returns:

kyu_6.a_rule_of_divisibility_by_13.thirt module

Solution for -> A Rule of Divisibility by 13.

Created by Egor Kostan. GitHub: https://github.com/ikostan

kyu_6.a_rule_of_divisibility_by_13.thirt.thirt(n: int) → int

Rule of Divisibility by 13.

The function which processes this sequence of operations on an integer n (>=0). thirt will return the stationary number. :param n: int :return: int

Module contents

A Rule of Divisibility by 13.