English
Related papers

Related papers: Square-full primitive roots

200 papers

Let $q$ be a power of a prime $p$, let $k$ be a nontrivial divisor of $q-1$ and write $e=(q-1)/k$. We study upper bounds for cyclotomic numbers $(a,b)$ of order $e$ over the finite field $\mathbb{F}_q$. A general result of our study is that…

Number Theory · Mathematics 2019-03-19 Tai Do Duc , Ka Hin Leung , Bernhard Schmidt

In this paper, we sharpen and simplify our earlier results based on Thue's Fundamentaltheorem and use it to obtain effective irrationality measures for certain roots of polynomials of the form $(x-\sqrt{t})^{n}+(x+\sqrt{t})^{n}$, where $n…

Number Theory · Mathematics 2021-11-02 Paul Voutier

A finite separable extension $E$ of a field $F$ is called primitive if there are no intermediate extensions. It is called solvable if the group $\mathrm{Gal}(\hat E|F)$ of automorphisms of its galoisian closure $\hat E$ over $F$ is…

Number Theory · Mathematics 2017-02-14 Chandan Singh Dalawat

Let n be a positive odd integer and let p>n+1 be a prime. We mainly derive the following congruence: $$\sum_{0<i_1<...<i_n<p}(i_1/3)(-1)^{i_1}/(i_1...i_n)=0 (mod p).$$

Number Theory · Mathematics 2010-02-25 Li-Lu Zhao , Zhi-Wei Sun

We prove the a priori bounds for infinitely renormalizable quadratic polynomials for which we can find an infinite sequence of primitive renormalizations such that the ratios of the periods of successive renormalizations is bounded. This…

Dynamical Systems · Mathematics 2024-01-01 Jeremy Kahn

We obtain new bounds of exponential sums modulo a prime $p$ with binomials $ax^k + bx^n$. In particular, for $k=1$, we improve the bound of Karatsuba (1967) from $O(n^{1/4} p^{3/4})$ to $O\left(p^{3/4} + n^{1/3}p^{2/3}\right)$ for any $n$,…

Number Theory · Mathematics 2018-11-05 Igor E. Shparlinski , Jose Felipe Voloch

For a prime $p$, let $c(p)$ denote the limiting fraction of $n\times n$ matrices over $\mathbb{F}_p$ whose determinant is a primitive root modulo $p$. The quantity $c(p)$ is a natural multiplicative deformation of the totient ratio…

Cryptography and Security · Computer Science 2026-05-08 Vipin Singh Sehrawat

We show that the exponent of distribution of the sequence of squarefree numbers in arithmetic progressions of prime modulus is $\geq 2/3 + 1/57$, improving a result of Prachar from 1958. Our main tool is an upper bound for certain bilinear…

Number Theory · Mathematics 2016-02-02 Ramon M. Nunes

For a prime $p>3$ and $a\in \Bbb Z$ with $p\nmid a$ let $V_p(x^2+\frac ax)$ be the residue-counts of $x^2+\frac ax$ modulo $p$ as $x$ runs over $1,2,\ldots,p-1$. In this paper, we obtain an explicit formula for $V_p(x^2+\frac ax)$, which is…

Number Theory · Mathematics 2023-09-15 Zhi-Hong Sun

Let $p$ be an odd prime and let $d\in\{2,3,7\}$. When $(\frac{-d}p)=1$ we can write $p=x^2+dy^2$ with $x,y\in\mathbb Z$; in this paper we aim at determining $x$ or $y$ modulo $p^2$. For example, when $p=x^2+3y^2$, we show that if $p\equiv…

Number Theory · Mathematics 2015-06-09 Zhi-Wei Sun

Let $g \geq 3$ be fixed and odd, and for large $q$ let $\chi$ be a primitive Dirichlet character modulo $q$ of order $g$. Conditionally on GRH we improve the existing upper bounds in the P\'{o}lya-Vinogradov inequality for $\chi$, showing…

Number Theory · Mathematics 2025-06-23 Alexander P. Mangerel

In this paper we prove that for any prime $p\ge 11$ holds $$ {2p-1\choose p-1}\equiv 1 -2p \sum_{k=1}^{p-1}\frac{1}{k} +4p^2\sum_{1\le i<j\le p-1}\frac{1}{ij}\pmod{p^7}. $$ This is a generalization of the famous Wolstenholme's theorem which…

Number Theory · Mathematics 2018-04-10 Romeo Mestrovic

In this paper, we mainly give a general explicit form of Cassels' $p$-adic embedding theorem for number fields. We also give its refined form in the case of cyclotomic fields. As a byproduct, given an irreducible polynomial $f$ over $Z$, we…

Number Theory · Mathematics 2014-10-21 Arturas Dubickas , Min Sha , Igor E. Shparlinski

We prove, that the sequence $1!, 2!, 3!, \dots$ produces at least $(\sqrt{2} + o(1))\sqrt{p}$ distinct residues modulo prime $p$. Moreover, factorials on an interval $\mathcal{I} \subseteq \{0, 1, \dots, p - 1\}$ of length $N > p^{7/8 +…

Number Theory · Mathematics 2024-04-16 A. Grebennikov , A. Sagdeev , A. Semchankau , A. Vasilevskii

Suppose $ m,n\geq 2 $ are co prime integers. We prove certain new symmetries of the base $ n $ representation of $ 1/m $, and in particular characterize the subgroup generated by $ n $ inside $ (\mathbb{Z}/m\mathbb{Z})^\times $. As an…

Number Theory · Mathematics 2021-07-27 Kalyan Chakraborty , Krishnarjun Krishnamoorthy

Given a negative $D>-(\log X)^{\log 2-\delta}$, we give a new upper bound on the number of square free integers $<X$ which are represented by some but not all forms of the genus of a primitive positive definite binary quadratic form $f$ of…

Number Theory · Mathematics 2011-05-24 J. Bourgain , E. Fuchs

We prove that the average of the $k$-th smallest prime quadratic non-residue modulo a prime approximates the $2k$-th smallest prime.

Number Theory · Mathematics 2023-01-02 Efthymios Sofos

This note provides an effective lower bound for the number of primes in the quadratic progression $p=n^2+1 \leq x$ as $x \to \infty$.

General Mathematics · Mathematics 2024-07-09 N. A. Carella

We show that univariate trinomials $x^n + ax^s + b \in \mathbb{F}_q[x]$ can have at most $\delta \Big\lfloor \frac{1}{2} +\sqrt{\frac{q-1}{\delta}} \Big\rfloor$ distinct roots in $\mathbb{F}_q$, where $\delta = \gcd(n, s, q - 1)$. We also…

Number Theory · Mathematics 2016-12-09 Zander Kelley , Sean Owen

An exponent of distribution 1/16 is established for square-free palindromes. The main input is an upper bound for the number of palindromes, in arithmetic progressions to large moduli, divisible by large squares. Our argument combines a…

Number Theory · Mathematics 2026-03-31 Aleksandr Tuxanidy
‹ Prev 1 8 9 10 Next ›