On the distribution of primitive roots that are ( k , r ) -integers

Teerapat Srichan

This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

This work is licensed under Creative Commons Attribution–NonCommercial International License (CC BY-NC 4.0).

Abstract

Let kk and rr be fixed integers with 1<r<k1<r<k. A positive integer is called rr-free if it is not divisible by the rthrth power of any prime. A positive integer nn is called a (k,r)(k,r)-integer if nn is written in the form akbakb where bb is an rr-free integer. Let pp be an odd prime and let x>1x>1 be a real number.

In this paper an asymptotic formula for the number of (k,r)(k,r)-integers which are primitive roots modulo pp and do not exceed xx is obtained.

Author(s)

Table of Contents

On the distribution of primitive roots that are ( k , r ) -integers

Abstract

Author(s)

Table of Contents

Related Articles

ON UNIQUENESS OF HOLOMORPHIC AND BOUNDED OUTSIDE THE CLOSED LOGARITHMIC SECTOR FUNCTIONS REPRESENTABLE BY LACUNARY POWER SERIES

COMPUTER DETECTING AND PROCESSING OF THE SIGNALS OF A FLAT-COIL ABSOLUTE-POSITION SENSOR BASED SEISMIC DETECTOR

On the distribution of primitive roots that are ( k , r ) -integers

Abstract

Subscribe to TheGufo Newsletter​

Subscribe to TheGufo Newsletter