Coverage for /usr/lib/python3/dist-packages/sympy/ntheory/__init__.py: 100%

1""" 

2Number theory module (primes, etc) 

3""" 

4 

5from .generate import nextprime, prevprime, prime, primepi, primerange, \ 

6 randprime, Sieve, sieve, primorial, cycle_length, composite, compositepi 

7from .primetest import isprime, is_gaussian_prime 

8from .factor_ import divisors, proper_divisors, factorint, multiplicity, \ 

9 multiplicity_in_factorial, perfect_power, pollard_pm1, pollard_rho, \ 

10 primefactors, totient, trailing, \ 

11 divisor_count, proper_divisor_count, divisor_sigma, factorrat, \ 

12 reduced_totient, primenu, primeomega, mersenne_prime_exponent, \ 

13 is_perfect, is_mersenne_prime, is_abundant, is_deficient, is_amicable, \ 

14 abundance, dra, drm 

15 

16from .partitions_ import npartitions 

17from .residue_ntheory import is_primitive_root, is_quad_residue, \ 

18 legendre_symbol, jacobi_symbol, n_order, sqrt_mod, quadratic_residues, \ 

19 primitive_root, nthroot_mod, is_nthpow_residue, sqrt_mod_iter, mobius, \ 

20 discrete_log, quadratic_congruence, polynomial_congruence 

21from .multinomial import binomial_coefficients, binomial_coefficients_list, \ 

22 multinomial_coefficients 

23from .continued_fraction import continued_fraction_periodic, \ 

24 continued_fraction_iterator, continued_fraction_reduce, \ 

25 continued_fraction_convergents, continued_fraction 

26from .digits import count_digits, digits, is_palindromic 

27from .egyptian_fraction import egyptian_fraction 

28from .ecm import ecm 

29from .qs import qs 

30__all__ = [ 

31 'nextprime', 'prevprime', 'prime', 'primepi', 'primerange', 'randprime', 

32 'Sieve', 'sieve', 'primorial', 'cycle_length', 'composite', 'compositepi', 

33 

34 'isprime', 'is_gaussian_prime', 

35 

36 

37 'divisors', 'proper_divisors', 'factorint', 'multiplicity', 'perfect_power', 

38 'pollard_pm1', 'pollard_rho', 'primefactors', 'totient', 'trailing', 

39 'divisor_count', 'proper_divisor_count', 'divisor_sigma', 'factorrat', 

40 'reduced_totient', 'primenu', 'primeomega', 'mersenne_prime_exponent', 

41 'is_perfect', 'is_mersenne_prime', 'is_abundant', 'is_deficient', 'is_amicable', 

42 'abundance', 'dra', 'drm', 'multiplicity_in_factorial', 

43 

44 'npartitions', 

45 

46 'is_primitive_root', 'is_quad_residue', 'legendre_symbol', 

47 'jacobi_symbol', 'n_order', 'sqrt_mod', 'quadratic_residues', 

48 'primitive_root', 'nthroot_mod', 'is_nthpow_residue', 'sqrt_mod_iter', 

49 'mobius', 'discrete_log', 'quadratic_congruence', 'polynomial_congruence', 

50 

51 'binomial_coefficients', 'binomial_coefficients_list', 

52 'multinomial_coefficients', 

53 

54 'continued_fraction_periodic', 'continued_fraction_iterator', 

55 'continued_fraction_reduce', 'continued_fraction_convergents', 

56 'continued_fraction', 

57 

58 'digits', 

59 'count_digits', 

60 'is_palindromic', 

61 

62 'egyptian_fraction', 

63 

64 'ecm', 

65 

66 'qs', 

67]