Related papers: Using the smoothness of p-1 for computing roots mo…

We prove that the roots of a definable $C^\infty$ curve of monic hyperbolic polynomials admit a definable $C^\infty$ parameterization, where `definable' refers to any fixed o-minimal structure on $(\mathbb R,+,\cdot)$. Moreover, we provide…

For a fixed quadratic irreducible polynomial $f$ with no fixed prime factors at prime arguments, we prove that there exist infinitely many primes $p$ such that $f(p)$ has at most 4 prime factors, improving a classical result of Richert who…

We consider a modification of the classical number theoretic question about the gaps between consecutive primitive roots modulo a prime $p$, which by the well-known result of Burgess are known to be at most $p^{1/4+o(1)}$. Here we measure…

In this paper we introduce elementary and completely explicit formulas for the derivative of any order of any function of the type 1/p, where p is a polynomial with known zeros.

Let $p$ be a prime, and let $f(x)$ be an integer-valued polynomial. By a combinatorial approach, we obtain a nontrivial lower bound of the $p$-adic order of the sum $$\sum_{k=r(mod p^{\beta})}\binom{n}{k}(-1)^k f([(k-r)/p^{\alpha}]),$$…

In a previous paper, we have shown that any Boolean formula can be encoded as a linear programming problem in the framework of Bayesian probability theory. When applied to NP-complete algorithms, this leads to the fundamental conclusion…

For a prime $p$, the OM algorithm finds the $p$-adic factorization of an irreducible polynomial $f\in\mathbb{Z}[x]$ in polynomial time. This may be applied to construct $p$-integral bases in the number field $K$ defined by $f$. In this…

Let $p$ be a prime. If an integer $g$ generates a subgroup of index $t$ in $(\mathbb Z/p\mathbb Z)^*,$ then we say that $g$ is a $t$-near primitive root modulo $p$. We point out the easy result that each primitive residue class contains a…

The dynatomic modular curves parametrize polynomial maps together with a point of period $n$. It is known that the dynatomic curves $Y_1(n)$ are smooth and irreducible in characteristic 0 for families of polynomial maps of the form $f_c(z)…

We investigate the problem of computing tensor product multiplicities for complex semisimple Lie algebras. Even though computing these numbers is #P-hard in general, we show that if the rank of the Lie algebra is assumed fixed, then there…

Let $\theta $ be a Salem number and $P(x)$ a polynomial with integer coefficients. It is well-known that the sequence $(\theta^n)$ modulo 1 is dense but not uniformly distributed. In this article we discuss the sequence $(P(\theta^n))$…

We show that for primes $N, p \geq 5$ with $N \equiv -1 \bmod p$, the class number of $\mathbb{Q}(N^{1/p})$ is divisible by $p$. Our methods are via congruences between Eisenstein series and cusp forms. In particular, we show that when $N…

The classical division algorithm for polynomials requires $O(n^2)$ operations for inputs of size $n$. Using reversal technique and Newton iteration, it can be improved to $O({M}(n))$, where ${M}$ is a multiplication time. But the method…

Let $F$ be a local field over $\mathbf{Q}_p$ or $\mathbf{F}_p((t))$, and let $D$ be a central simple division algebra over $F$ of degree $d$. In the $p$-adic case, we assume $p>de+1$ where $e$ is the ramification degree over $\mathbf{Q}_p$;…

Let $\omega^*(n) = \{d|n: d=p-1, \mbox{$p$ is a prime}\}$. We show that, for each integer $k\geq2$, $$ \sum_{n\leq x}\omega^*(n)^k \asymp x(\log x)^{2^k-k-1}, $$ where the implied constant may depend on $k$ only. This confirms a recent…

We demonstrate that a modification of the classical index calculus algorithm can be used to factor integers. More generally, we reduce the factoring problem to finding an overdetermined system of multiplicative relations in any factor base…

We construct $p$-adic $L$-functions associated with $p$-refined cohomological cuspidal Hilbert modular forms over any totally real field under a mild hypothesis. Our construction is canonical, varies naturally in $p$-adic families, and does…

For an odd prime $p$, we say a polynomial $f\in \mathbb F_p[X]$ computes square roots if $f(a)^2=a$ for all nonzero, perfect squares $a\in \mathbb F_p$. When $p\equiv 3 \mod 4$, it is easy to see that $f(X)=X^{\frac{p+1}{4}}$ is the…

When $A$ is a matrix with all eigenvalues in the disk $|z-1|<1$, the principal $p$th root of $A$ can be computed by Schr\"oder's method, among many other methods. In this paper we present a further study of Schr\"oder's method for the…

We give a family of congruences for the binomial coefficients ${kp-1\choose p-1}$ in terms of multiple harmonic sums, a generalization of the harmonic numbers. Each congruence in this family (which depends on an additional parameter $n$)…