Skip to main content

All Questions

Filter by
Sorted by
Tagged with
2 votes
0 answers
161 views

Compute generators for group of totally positive units of a number field?

Given a number field $K$, I would like to compute (in Sage) generators for the group of totally positive units of $K$. Update: I've tried some code (details below), which I've received some help on in ...
1 vote
0 answers
136 views

Can PARI compute class numbers without factoring the discriminant?

When calculating properties of algebraic number fields, one of the hardest steps is factorizing the discriminant of a defining polynomial. This is necessary in the Pohst-Zassenhaus algorithm for ...
2 votes
1 answer
196 views

Software for $S$-unit equation

Is there any implementation available of an algorithm which solves in full generality the $S$-unit equation $x+y=1$ in a number field? It seems that Magma solves $ax+by=c$ but only in the algebraic ...
12 votes
0 answers
1k views

Euler's totient function and Riemann hypothesis

I am looking for an upper-bound of the Euler's totient function $\varphi$ which would be equivalent to the Riemann hypothesis (RH). There is the following Nicolas' criterion about primorial numbers $...
9 votes
6 answers
4k views

Computation of a minimal polynomial

It is relatively easy (but sometimes quite cumbersome) to compute the minimal polynomial of an algebraic number $\alpha$ when $\alpha$ is expressible in radicals. For example, the simple query "...