arXiv subjects

Igor E. Shparlinski

Publications and source records attributed to Igor E. Shparlinski.

232 records · Page 13Linked to original sources

arXiv2007

On the Convex Closure of the Graph of Modular Inversions

In this paper we give upper and lower bounds as well as a heuristic estimate on the number of vertices of the convex closure of the set $$ G_n=\left\{(a,b) : a,b\in \Z, ab \equiv 1 \pmod{n}, 1\leq a,b\leq n-1\right\}. $$ The heuristic is based on an asymptotic formula of Rényi and Sulanke. After describing two algorithms to determine the convex closure, we compare the numeric results with the heuristic estimate. The numeric results do not agree with the heuristic estimate -- there are some interesting peculiarities for which we provide a heuristic explanation. We then describe some numerical work on the convex closure of the graph of random quadratic and cubic polynomials over $\mathbb{Z}_n$. In this case the numeric results are in much closer agreement with the heuristic, which strongly suggests that the the curve $xy=1\pmod{n}$ is ``atypical''.

math.NT↗

arXiv2007

Sato--Tate, cyclicity, and divisibility statistics on average for elliptic curves of small height

We obtain asymptotic formulae for the number of primes $p\le x$ for which the reduction modulo $p$ of the elliptic curve $$ \E_{a,b} : Y^2 = X^3 + aX + b $$ satisfies certain ``natural'' properties, on average over integers $a$ and $b$ with $|a|\le A$ and $|b| \le B$, where $A$ and $B$ are small relative to $x$. Specifically, we investigate behavior with respect to the Sato--Tate conjecture, cyclicity, and divisibility of the number of points by a fixed integer $m$.

math.NT↗

arXiv2007

Arithmetic and Geometric Progressions in Productsets over Finite Fields

Given two sets $\cA, \cB \subseteq \F_q$ of elements of the finite field $\F_q$ of $q$ elements, we show that the productset $$ \cA\cB = \{ab | a \in \cA, b \in\cB\} $$ contains an arithmetic progression of length $k \ge 3$ provided that $k<p$, where $p$ is the characteristic of $\F_q$, and $# \cA # \cB \ge 3q^{2d-2/k}$. We also consider geometric progressions in a shifted productset $\cA\cB +h$, for $f \in \F_q$, and obtain a similar result.

math.NT↗

arXiv2007

On RSA Moduli with Almost Half of the Bits Prescribed

We show that using character sum estimates due to H. Iwaniec leads to an improvement of recent results about the distribution and finding RSA moduli $M=pl$, where $p$ and $l$ are primes, with prescribed bit patterns. We are now able to specify about $n$ bits instead of about $n/2$ bits as in the previous work. We also show that the same result of H. Iwaniec can be used to obtain an unconditional version of a combinatorial result of W. de Launey and D. Gordon that was originally derived under the Extended Riemann Hypothesis.

math.NT↗

arXiv2007

On The Solvability of Bilinear Equations in Finite Fields

We consider the equation $$ ab + cd = λ, \qquad a\in A, b \in B, c\in C, d \in D, $$ over a finite field $F_q$ of $q$ elements, with variables from arbitrary sets $ A, B, C, D \subseteq F_q$. The question of solvability of such and more general equations has recently been considered by D. Hart and A. Iosevich, who, in particular, proved that if $$ #A #B #C #D \gg q^3, $$ then above equation has a solution for any $λ\in F_q^*$. Here we show that using bounds of multiplicative character sums allows us to extend the class of sets which satisfy this property.

math.NT↗

arXiv2007

Products in Residue Classes

We consider a problem of P. Erdos, A. M. Odlyzko and A. Sarkozy about the representation of residue classes modulo m by products of two not too large primes. While it seems that even the Extended Riemann Hypothesis is not powerful enough to achieve the expected results, here we obtain some unconditional results ``on average'' over moduli m and residue classes modulo m and somewhat stronger results when the average is restricted to prime moduli m = p. We also consider the analogous question wherein the primes are replaced by easier sequences so, quite naturally, we obtain much stronger results.

math.NT↗

arXiv2007

Prime numbers with Beatty sequences

A study of certain Hamiltonian systems has lead Y. Long to conjecture the existence of infinitely many primes of the form $p=2[αn]+1$, where $1<α<2$ is a fixed irrational number. An argument of P. Ribenboim coupled with classical results about the distribution of fractional parts of irrational multiples of primes in an arithmetic progression immediately imply that this conjecture holds in a much more precise asymptotic form. Motivated by this observation, we give an asymptotic formula for the number of primes $p=q[αn+β]+a$ with $n\le N$, where $α,β$ are real numbers such that $α$ is positive and irrational of finite type (which is true for almost all $α$) and $a,q$ are integers with $0\le a 0$ depends only on $α$. We also prove a similar result for primes $p=[αn+β]$ such that $p\equiv a\pmod q$.

math.NT↗

arXiv2007

Multiplicative Order of Gauss Periods

We obtain a lower bound on the multiplicative order of Gauss periods which generate normal bases over finite fields. This bound improves the previous bound of J. von zur Gathen and I. E. Shparlinski.

math.NT↗

arXiv2007

Approximation by Several Rationals

Following T. H. Chan, we consider the problem of approximation of a given rational fraction a/q by sums of several rational fractions a_1/q_1, ..., a_n/q_n with smaller denominators. We show that in the special cases of n=3 and n=4 and certain admissible ranges for the denominators q_1,..., q_n, one can improve a result of T. H. Chan by using a different approach.

math.NT↗

arXiv2007

On the largest prime factor of the Mersenne numbers

Let P(k) be the largest prime factor of the positive integer k. In this paper, we prove that the series $\sum_{n\ge 1}\frac{(\log n)^a}{P(2^n-1)}$ is convergent for each constant a<1/2, which gives a more precise form of a result of C. L. Stewart from 1977.

math.NT↗

arXiv2007

On Some Dynamical Systems in Finite Fields and Residue Rings

We use character sums to confirm several recent conjectures of V. I. Arnold on the uniformity of distribution properties of a certain dynamical system in a finite field. On the other hand, we show that some conjectures are wrong. We also analyze several other conjectures of V. I. Arnold related to the orbit length of similar dynamical systems in residue rings and outline possible ways to prove them. We also show that some of them require further tuning.

math.NT↗

arXiv2006

Character sums with Beatty sequences on Burgess-type intervals

We estimate multiplicative character sums taken on the values of a non-homogeneous Beatty sequence $\{[αn + β] : n =1,2,... \}$, where $α,β\in\R$, and $α$ is irrational. Our bounds are nontrivial over the same short intervals for which the classical character sum estimates of Burgess have been established.

math.NT↗

arXiv2006

Integers with a large smooth divisor

We study the function $Θ(x,y,z)$ that counts the number of positive integers $n\le x$ which have a divisor $d>z$ with the property that $p\le y$ for every prime $p$ dividing $d$. We also indicate some cryptographic applications of our results.

math.NT↗

arXiv2005

Uniform Distribution of Fractional Parts Related to Pseudoprimes

We estimate exponential sums with the Fermat-like quotients $$ f_g(n) = \frac{g^{n-1} - 1}{n} \mand h_g(n)=\frac{g^{n-1}-1}{P(n)}, $$ where $g$ and $n$ are positive integers, $n$ is composite, and P(n) is the largest prime factor of $n$. Clearly, both $f_g(n)$ and $h_g(n)$ are integers if $n$ is a Fermat pseudoprime to base $g$, and if $n$ is a Carmichael number this is true for all $g$ coprime to $n$. Nevertheless, our bounds imply that the fractional parts $\{f_g(n)\}$ and $\{h_g(n)\}$ are uniformly distributed, on average over $g$ for $f_g(n)$, and individually for $h_g(n)$. We also obtain similar results with the functions ${\widetilde f}_g(n) = gf_g(n)$ and ${\widetilde h}_g(n) = gh_g(n)$.

math.NT↗

arXiv2004

Character Sums and Congruences with n!

We estimate character sums with n!, on average, and individually. These bounds are used to derive new results about various congruences modulo a prime p and obtain new information about the spacings between quadratic nonresidues modulo p. In particular, we show that there exists a positive integer $n\ll p^{1/2+ε}, such that n! is a primitive root modulo p. We also show that every nonzero congruence class a \not \equiv 0 \pmod p can be represented as a product of 7 factorials, a \equiv n_1! ... n_7! \pmod p, where $\max \{n_i | i=1,... 7\}=O(p^{11/12+ε}), and we find the asymptotic formula for the number of such representations. Finally, we show that products of 4 factorials $n_1!n_2!n_3!n_4!, with \max\{n_1, n_2, n_3, n_4\}=O(p^{6/7+ε})$ represent ``almost all''residue classes modulo p, and that products of 3 factorials n_1!n_2!n_3! with \max\{n_1, n_2, n_3\}=O(p^{5/6+ε})$ are uniformly distributed modulo p.

math.NT↗

arXiv2004

Exponential Sums and Congruences with Factorials

We estimate the number of solutions of certain diagonal congruences involving factorials. We use these results to bound exponential sums with products of two factorials $n!m!$ and also derive asymptotic formulas for the number of solutions of various congruences with factorials. For example, we prove that the products of two factorials $n!m!$ with $\max\{n,m\} ..., n_{49}\} < p^{8775/8794+ ε}$.

math.NT↗