Ask Your Question

captain's profile - activity

2020-03-02 12:58:56 +0200 asked a question How to find partial sums of dedekind zeta function of any number field?

I searched for my question through internet but could not find a clear way to do it. So, how can I find partial sums of the value of the Dedekind zeta function of any number field?

2019-09-27 10:06:34 +0200 commented answer How to calculate the value of polynomials with large coefficients

Thank you! Now, I want to define a function as the following:

 f(k,x) = sum( (x+i)^k for i in (1..k))

How can I do that?

2019-09-25 23:18:29 +0200 asked a question How to calculate the value of polynomials with large coefficients
R = ZZ['x'] 
x = R.gen()

Under this setup, I define a function like f(x) = 122313*x^23 + 445*x^12 + 2013*x + 2345 of high degree with large coefficients. Then, I define

def h(x):  
return diff(f(x),x)

Then, Sage cannot compute the value of h, like h(5),h(10) etc. It returns 0 somehow. How can I fix this problem and get the values of the function h?

2019-09-19 09:20:36 +0200 commented answer How sage checks the irreducibility of a polynomial?

I think I forgot to add " [] " because it works now, my bad.

2019-09-18 21:41:20 +0200 commented answer How sage checks the irreducibility of a polynomial?

When I replace QQ with GF(p) I am getting "Object P.is_irreducible not found." error. What is the problem?

2019-09-18 13:59:54 +0200 commented question How sage checks the irreducibility of a polynomial?

A univariate polynomial over the integers

2019-09-18 11:03:04 +0200 received badge  Student (source)
2019-09-18 10:48:57 +0200 asked a question How sage checks the irreducibility of a polynomial?

Hi, given a polynomial we can check whether its irreducibility via .is_irreducible() command. I wonder how sage checks it so fast even though the polynomial has large degree with large coefficients?