Python | sympy.antidivisor_count() method

Python | sympy.divisor_count() method

Last Updated : 28 Aug, 2019

With the help of sympy.divisor_count() method, we can count the number of divisors of the given integer.

Syntax: divisor_count(n, modulus=1) Parameter: n - It denotes an integer. modulus - It is set to 1 by default. If modulus is not 1 then only those that are divisible by modulus are counted. Returns: Returns the count of divisors of the given number.

Example #1:

Python3

# import divisor_count() method from sympy
from sympy import divisor_count

n = 84

# Use divisor_count() method 
divisor_count_n = divisor_count(n) 
    
print("The number of divisors of {} : {}".format(n, divisor_count_n))

Output:

The number of divisors of 84 : 12

Example #2:

Python3

# import divisor_count() method from sympy
from sympy import divisor_count

n = 12

# Use divisor_count() method 
divisor_count_n = divisor_count(n, modulus = 2) 
    
print("The number of divisors of {} : {}".format(n, divisor_count_n))

Output:

The number of divisors of 12 : 4

Python | sympy.antidivisor_count() method

rupesh_rao

Improve

Article Tags :

Python
SymPy

Practice Tags :

python

Similar Reads

Python | sympy.divisors() method

With the help of sympy.divisors() method, we can find all the divisors of a given number in sorted order by default. Syntax: divisors(n, generator=False) Parameter: n - It denotes an integer. generator - If generator is True an unordered generator object is returned, otherwise it returns a sorted li

Python | sympy.count() method

Using the count() method in the sympy module, we can count the number of variables used in the mathematical function. count() method returns the number of variables used in the mathematical function. Syntax : sympy.count(x) Return : the count of variables. Code #1: With the help of the below example

Python | sympy.antidivisor_count() method

With the help of sympy.antidivisor_count() method, we can find the count of anti-divisors of a given integer. Syntax: antidivisor_count(n) Parameter: n - It denotes an integer. Returns: Returns the count of anti-divisors of the given integer. Example #1: Python3 # import antidivisor_count() method f

Python | sympy.divisor_sigma() method

With the help of sympy.divisor_sigma() method, we can find the divisor function \sigma_k(n) for positive integer n. divisor_sigma(n, k) is equal to the sum of all the divisors of n raised to the power of k or sum([x**k for x in divisors(n)]). Syntax: divisor_sigma(n, k) Parameter: n - It denotes an

Python | sympy.count_ops() method

Using the count_ops() method in simpy module, we can count the number of operations used in the mathematical function. count_ops() method returns the number of operations used in the mathematical function. Syntax : sympy.count_ops() Return : the count of operations. Code #1: With the help of below e

Python | sympy.core() method

With the help of sympy.core() method, we can calculate the core_t(n) of a positive integer n. core(n, t) calculates the t-th power free part of n. If nâ€™s prime factorization is : n = \prod_{i=1}^\omega p_i^{m_i} then core_t(n) = \prod_{i=1}^\omega p_i^{m_i \mod t} Syntax: core(n, t=2) Parameter: n -

Python | sympy.gcd() method

The function gcd() provides the direct way to compute Greatest Common Divisor for polynomials.That is, for polynomials f and g, it computes GCD. Syntax: sympy.gcd(f, g) Return: GCD of given polynomials Example #1: Python3 1== # import sympy from sympy import * f = (12 * x + 12)*x g = 32 * x**2 # Usi

Python | sympy.gcd() method

With the help of sympy.gcd() method, we can find the greatest common divisor of two numbers that is passed as a parameter in the sympy.gcd() method. Syntax : sympy.gcd(var1, var2) Return : Return value of greatest common divisor. Example #1 : In this example we can see that by using sympy.gcd() meth

Python List count() method

The count() method is used to find the number of times a specific element occurs in a list. It is very useful in scenarios where we need to perform frequency analysis on the data.Let's look at a basic example of the count() method.Pythona = [1, 2, 3, 1, 2, 1, 4] c = a.count(1) print(c)Output3 Explan

Python | sympy.factorint() method

With the help of sympy.factorint() method, we can find the factors and their corresponding multiplicities of a given integer. For input less than 2, factorint() behaves as follows: factorint(1) - returns the empty factorization {}. factorint(0) - returns {0:1}. factorint(-n) - adds -1:1 to the facto