Finished existing ipython solutions to python. Ready to continue in pure python.

python/lib_misc_tests.py

@@ -13,6 +13,7 @@ try:
     from .lib_misc import proper_divisors, sum_proper_divisors
     from .lib_misc import permutations
     from .lib_misc import gcd
+    from .lib_misc import get_digit_count
 except ModuleNotFoundError:
     from lib_misc import is_palindrome_integer
     from lib_misc import is_palindrome_string
@@ -27,6 +28,7 @@ except ModuleNotFoundError:
     from lib_misc import proper_divisors, sum_proper_divisors
     from lib_misc import permutations
     from lib_misc import gcd
+    from lib_misc import get_digit_count
 
 
 class TestPrimeMethods(unittest.TestCase):
@@ -131,6 +133,10 @@ class TestPrimeMethods(unittest.TestCase):
         self.assertEqual(gcd(15, 6), 3)
         self.assertEqual(gcd(6, 15), 3)
 
+    def test_get_digit_count(self):
+        self.assertEqual(get_digit_count(1), 1)
+        self.assertEqual(get_digit_count(1234567890), 10)
+
 
 if __name__ == '__main__':
     unittest.main()