Values of the Euler phi function not divisible by a prescribed odd prime

Values of the Euler phi-function not divisible by a given odd prime, and the distribution of Euler-Kronecker constants for cyclotomic fields

For a fixed odd prime q we investigate the first and second order terms of the asymptotic series expansion for the number of n\le x such that q does not divide phi(n). Part of the analysis involves a careful study of the Euler-Kronecker constants for cyclotomic fields. In particular, we show that the prime k-tuples conjecture and a conjecture of Ihara about the distribution of these Euler-Kronecker constants cannot be both true.

Tamagawa numbers of elliptic curves with prescribed torsion subgroup or isogeny

We study Tamagawa numbers of elliptic curves with torsion $\mathbb{Z}/2\mathbb{Z}\oplus \mathbb{Z}/14\mathbb{Z}$ over cubic fields and of elliptic curves with an $n-$isogeny over $\mathbb{Q}$, for $n\in\{6,8,10,12,14,16,17,18,19,37,43,67,163\}$. Bruin and Najman proved that every elliptic curve with torsion $\mathbb{Z}/2\mathbb{Z}\oplus \mathbb{Z}/14\mathbb{Z}$ over a cubic field is a base change of an elliptic curve defined over $\mathbb{Q}$. We find that Tamagawa numbers of elliptic curves defined over $\mathbb{Q}$ with torsion $\mathbb{Z}/2\mathbb{Z}\oplus \mathbb{Z}/14\mathbb{Z}$ over a cu…

On the Divisibility of Class Numbers of Cubic Number Fields with Discriminants in a Prescribed Rational Quadratic Class

Let n be an odd number and F an imaginary quadratic field with odd discriminant. We show that there exists infinitely many cubic fields K such that the class number of K is divisible by n and the Galois closure of K contains F.

Finding elliptic curves with a subgroup of prescribed size

Assuming the Generalized Riemann Hypothesis, we design a deterministic algorithm that, given a prime p and positive integer m=o(sqrt(p)/(log p)^4), outputs an elliptic curve E over the finite field F_p for which the cardinality of E(F_p) is divisible by m. The running time of the algorithm is mp^(1/2+o(1)), and this leads to more efficient constructions of rational functions over F_p whose image is small relative to p. We also give an unconditional version of the algorithm that works for almost all primes p, and give a probabilistic algorithm with subexponential time complexity.

Simultaneous inequalities among values of the Euler phi-function

This paper concerns the values of the Euler phi-function evaluated simultaneously on k arithmetic progressions a_1 n + b_1, a_2 n + b_2, ..., a_k n + b_k. Assuming the necessary condition that no two of the polynomials a_i x + b_i are constant multiples of each other, we show that there are infinitely many integers n for which phi(a_1 n + b_1) > phi(a_2 n + b_2) > ... > phi(a_k n + b_k). In particular, there exist infinitely many strings of k consecutive integers whose phi-values are arranged from largest to smallest in any prescribed manner. Also, under the necessary condition ad \ne bc, any …

关于长度为4的弱素数可加数

On the Weakly Prime-Additive Numbers with Length 4

本文在广义黎曼假设下证明了对任意正整数m，存在无穷多个能被m整除的长度为4的弱素数可加数，并给出了一个与长度为3情形类似的相关结果。