Assuming the Generalized Riemann Hypothesis (GRH), we show that the norm-Euclidean Galois cubic fields are exactly those with discriminant $$\Delta =7^2,9^2,{13}^2,{19}^2,{31}^2,{37}^2,{43}^2,{61}^2,{67}^2,{103}^2,{109}^2,{127}^2,{157}^2.$$ A large part of the proof is in establishing the following more general result: Let $K$ be a Galois number field of odd prime degree $\ell$ and conductor $f$. Assume the GRH for ${\zeta }_K\left(s\right)$. If $$38{(\ell -1)}^2{(logf)}^{6}loglogf\<f,$$ then $K$ is not norm-Euclidean.

Let $f\in \mathbb{Z}\left[x\right]$ be a polynomial of degree $d\ge 3$ without roots of multiplicity $d$ or $(d-1)$. Erdős conjectured that, if $f$ satisfies the necessary local conditions, then $f\left(p\right)$ is free of $(d-1)$th powers for infinitely many primes $p$. This is proved here for all $f$ with sufficiently high entropy. The proof serves to demonstrate two innovations: a strong repulsion principle for integer points on curves of positive genus, and a number-theoretical analogue of Sanov’s theorem from the theory of large deviations. ...

Let ${𝔖}_n$ denote the symmetric group with $n$ letters, and $g\left(n\right)$ the maximal order of an element of ${𝔖}_n$. If the standard factorization of $M$ into primes is $M=q_1^{{\alpha }_1}{q}_2^{{\alpha }_2}...q_k^{{\alpha }_k}$, we define $\ell \left(M\right)$ to be $q_1^{{\alpha }_1}+q_2^{{\alpha }_2}+...+q_k^{{\alpha }_k}$; one century ago, E. Landau proved that $g\left(n\right)={max}_{\ell \left(M\right)\le n}M$ and that, when $n$ goes to infinity, $logg\left(n\right)\sim \sqrt{nlog\left(n\right)}$. There exists a basic algorithm to compute $g\left(n\right)$ for $1\le n\le N$; its running time is $𝒪\left(N^{3/2}/\sqrt{logN}\right)$ and the needed memory is $𝒪\left(N\right)$; it allows computing $g\left(n\right)$ up to, say, one million. We describe an algorithm to calculate $g\left(n\right)$ for $n$ up to ${10}^{15}$. The main idea is to use the...

Let $E$ be an elliptic curve given by $y^2=x^3-nx$ with a positive integer $n$. Duquesne in 2007 showed that if $n=(2k^2-2k+1)(18k^2+30k+17)$ is square-free with an integer $k$, then certain two rational points of infinite order can always be in a system of generators for the Mordell-Weil group of $E$. In this paper, we generalize this result and show that the same is true for infinitely many binary forms $n=n(k,l)$ in $\mathbb{Z}[k,l]$.

We investigate the average order of the divisor function at values of binary cubic forms that are reducible over $\mathbb{Q}$ and discuss some applications.