Python | sympy.divisor_sigma() 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:

# 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:

# 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.divisor_sigma() 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.antidivisors() method

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

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: # import antidivisor_count() method from symp

Python | sympy.divisor_sigma() method

With the help of sympy.divisor_sigma() method, we can find the divisor function [Tex]\sigma_k(n)[/Tex] 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

Python | sympy.div() method

The function div() provides division of polynomials with remainder. That is, for polynomials f and g, it computes q and r, such that f= g*q+r and deg(r) <q. Syntax:sympy.div(f, g, domain='QQ') Return: division of polynomials with remainder Example #1: # import sympy from sympy import * f = 5 * x*

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 [Tex]core_t(n)[/Tex] of a positive integer n. core(n, t) calculates the t-th power free part of n. If nâ€™s prime factorization is : [Tex]n = \prod_{i=1}^\omega p_i^{m_i}[/Tex] then [Tex]core_t(n) = \prod_{i=1}^\omega p_i^{m_i \mod t}[/Tex] Sy

Python | sympy.divmod() method

With the help of sympy.divmod() method, we can find the modulus and quotient of the given values. Syntax: sympy.divmod(val1, val2) Return: (quotient, modulo) Example #1 : # import sympy from sympy import * # Using sympy.divmod() method gfg = divmod(Integer(48), Integer(7)) print(gfg) Output: (6, 6)

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