Abstract
In $$\mathbb {F}_q$$ , Dartyge and Sarkozy introduced the notion of digits and studied some properties of the sum of digits function. We will provide sharp estimates for the number of elements of special sequences of $$\mathbb {F}_q$$ whose sum of digits is prescribed. Such special sequences of particular interest include the set of n-th powers for each $$n\ge 1$$ and the set of elements of order d in $$\mathbb {F}_q^*$$ for each divisor d of $$q-1$$ . We provide an optimal estimate for the number of squares whose sum of digits is prescribed. Our methods combine A. Weil bounds with character sums, Gaussian sums and exponential sums.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.