We present algorithms for the computation of extreme binary Humbert forms in real quadratic number fields. With these algorithms we are able to compute extreme Humbert forms for the number fields $\mathbb{Q}\left(\sqrt{13}\right)$ and $\mathbb{Q}\left(\sqrt{17}\right)$. Finally we compute the Hermite-Humbert constant for the number field $\mathbb{Q}\left(\sqrt{13}\right)$.

We describe an algorithm due to Gauss, Shanks and Lagarias that, given a non-square integer $D\equiv 0,1$ mod $4$ and the factorization of $D$, computes the structure of the $2$-Sylow subgroup of the class group of the quadratic order of discriminant $D$ in random polynomial time in $log\left|D\right|$.

In this paper, we find all integer solutions $(x,y,n,a,b,c)$ of the equation in the title for non-negative integers $a,b$ and $c$ under the condition that the integers $x$ and $y$ are relatively prime and $n\ge 3$. The proof depends on the famous primitive divisor theorem due to Bilu, Hanrot and Voutier and the computational techniques on some elliptic curves.

In this paper, we find all solutions of the Diophantine equation $x^2+2^{\alpha }{5}^{\beta }{17}^{\gamma }=y^n$ in positive integers $x,y\ge 1$, $\alpha ,\beta ,\gamma ,n\ge 3$ with $gcd(x,y)=1$.

In this article the discrete logarithm problem in degree 0 class groups of curves over finite fields given by plane models is studied. It is proven that the discrete logarithm problem for non-hyperelliptic curves of genus 3 (given by plane models of degree 4) can be solved in an expected time of $\tilde{O}\left(q\right)$, where $q$ is the cardinality of the ground field. Moreover, it is proven that for every fixed natural number $d\ge 4$ the following holds: We consider the discrete logarithm problem for curves given by plane models...

The function ${\sum }_{p\le x}1/p-loglog\left(x\right)-M$ is known to change sign infinitely often, but so far all calculated values are positive. In this paper we prove that the first sign change occurs well before exp(495.702833165).

We completely solve the Diophantine equations $x²+2^a{q}^b=yⁿ$ (for q = 17, 29, 41). We also determine all $C=p{₁}^{a₁}\cdots p_k^{a_k}$ and $C=2^{a₀}p{₁}^{a₁}\cdots p_k^{a_k}$, where $p₁,...,p_k$ are fixed primes satisfying certain conditions. The corresponding Diophantine equations x² + C = yⁿ may be studied by the method used by Abu Muriefah et al. (2008) and Luca and Togbé (2009).

We prove that the sums $S_k$ of independent random vectors satisfy $P(ma{x}_{1\le k\le n}\parallel S_k\parallel >3t)\le 2ma{x}_{1\le k\le n}P(\parallel S_k\parallel >t)$, t ≥ 0.