The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Let F denote the finite field of q elements. O. Ahmadi and A. Menezes have recently considered the question about the possible number of elements with zero trace in polynomial bases of F over F. Here we show that the Weil bound implies that there is such a basis with n + O(log n) zero-trace elements.
For a prime p > 2, an integer a with gcd(a,p) = 1 and real 1 ≤ X,Y < p, we consider the set of points on the modular hyperbola
.
We give asymptotic formulas for the average values
and
with the Euler function φ(k) on the differences between the components of points of .
For positive integers m, U and V, we obtain an asymptotic formula for the number of integer points (u,v) ∈ [1,U] × [1,V] which belong to the modular hyperbola uv ≡ 1 (mod m) and also have gcd(u,v) =1, which are also known as primitive points. Such points have a nice geometric interpretation as points on the modular hyperbola which are "visible" from the origin.
For positive integers m and N, we estimate the rational exponential sums with denominator m over the reductions modulo m of elements of the set
ℱ(N) = {s/r : r,s ∈ ℤ, gcd(r,s) = 1, N ≥ r > s ≥ 1}
of Farey fractions of order N (only fractions s/r with gcd(r,m) = 1 are considered).
We obtain a conditional, under the Generalized Riemann Hypothesis, lower bound on the number of distinct elliptic curves over a prime finite field of elements, such that the discriminant of the quadratic number field containing the endomorphism ring of over is small. For almost all primes we also obtain a similar unconditional bound. These lower bounds complement an upper bound of F. Luca and I. E. Shparlinski (2007).
We consider function field analogues of the conjecture of Győry, Sárközy and Stewart (1996) on the greatest prime divisor of the product for distinct positive integers , and . In particular, we show that, under some natural conditions on rational functions , the number of distinct zeros and poles of the shifted products and grows linearly with if . We also obtain a version of this result for rational functions over a finite field.
For an integer we denote by the largest prime factor of . We obtain several upper bounds on the number of solutions of congruences of the form and use these bounds to show that
A study of certain Hamiltonian systems has led Y. Long to conjecture the existence of infinitely many primes which are not 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 implies that this conjecture holds in a much more precise asymptotic form. Motivated by this observation, we give an asymptotic...
We give asymptotic formulas for some average values of the Euler function on shifted smooth numbers. The result is based on various estimates on the distribution of smooth numbers in arithmetic progressions which are due to A. Granville and É. Fouvry & G. Tenenbaum.
We show that if a > 1 is any fixed integer, then for a sufficiently large x>1, the nth Cullen number Cₙ = n2ⁿ +1 is a base a pseudoprime only for at most O(x log log x/log x) positive integers n ≤ x. This complements a result of E. Heppner which asserts that Cₙ is prime for at most O(x/log x) of positive integers n ≤ x. We also prove a similar result concerning the pseudoprimality to base a of the Woodall numbers given by Wₙ = n2ⁿ - 1 for all n ≥ 1.
We obtain an asymptotic formula for the number of visible points (x,y), that is, with gcd(x,y) = 1, which lie in the box [1,U] × [1,V] and also belong to the exponential modular curves . Among other tools, some recent results of additive combinatorics due to J. Bourgain and M. Z. Garaev play a crucial role in our argument.
We obtain new results concerning the Lang-Trotter conjectures on Frobenius traces and Frobenius fields over single and double parametric families of elliptic curves. We also obtain similar results with respect to the Sato-Tate conjecture. In particular, we improve a result of A. C. Cojocaru and the second author (2008) towards the Lang-Trotter conjecture on average for polynomially parameterised families of elliptic curves when the parameter runs through a set of rational numbers of bounded height....
We estimate the number of possible degree patterns of k-lacunary polynomials of degree t < p which split completely modulo p. The result is based on a combination of a bound on the number of zeros of lacunary polynomials with some graph theory arguments.
Download Results (CSV)