Steven Finch, Pascal Sebah
We study the asymptotics of the average number of squares (or quadratic residues) in Z_n and Z_n^*. Similar analyses are performed for cubes, square roots of 0 and 1, and cube roots of 0 and 1.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
Two $q$-supercongruences of truncated basic hypergeometric series containing two free parameters are established by employing specific identities for basic hypergeometric series. The results partly extend two $q$-supercongruences that were earlier conjectured by the same authors and involve $q$-supercongruences modulo the square and the cube of a cyclotomic polynomial. One of the newly proved $q$-supercongruences is even conjectured to hold modulo the fourth power of a cyclotomic polynomial.
Let $p=3n+1$ be a prime with $n\in\mathbb{N}=\{0,1,\cdots\}$, and let $g\in\mathbb{Z}$ be a primitive root modulo $p$. Let $0<a_1<\cdots<a_n<p$ be all the cubic residues modulo $p$ in the interval $(0,p)$. Then clearly the sequence $$a_1\ {\rm mod}\ p,\ a_2\ {\rm mod}\ p,\cdots, a_n\ {\rm mod}\ p$$ is a permutation $s_p(g)$ of the sequence $$g^3\ {\rm mod}\ p,\ g^6\ {\rm mod}\ p,\cdots, g^{3n}\ {\rm mod}\ p.$$ In this paper, we shall determine the sign of this permutation.
Let $p$ be an odd prime. It is well known that $F_{p-(\frac p5)}\equiv 0\pmod{p}$, where $\{F_n\}_{n\ge0}$ is the Fibonacci sequence and $(-)$ is the Jacobi symbol. In this paper we show that if $p\not=5$ then we may determine $F_{p-(\frac p5)}$ mod $p^3$ in the following way: $$\sum_{k=0}^{(p-1)/2}\frac{\binom{2k}k}{(-16)^k}\equiv\left(\frac{p}5\right)\left(1+\frac{F_{p-(\frac {p}5)}}2\right)\pmod{p^3}.$$ We also use Lucas quotients to determine $\sum_{k=0}^{(p-1)/2}\binom{2k}k/m^k$ modulo $p^2$ for any integer $m\not\equiv0\pmod{p}$; in particular, we obtain $$\sum_{k=0}^{(p-1)/2}\frac{\bino…
Let $g^{\square}(p)$ denote the least square-free primitive root modulo $p$. We show that $g^{\square}(p)< p^{0.96}$ for all $p$.
In this paper we continue the investigations about unlike powers in arithmetic progression. We provide sharp upper bounds for the length of primitive non-constant arithmetic progressions consisting of squares/cubes and $n$-th powers.
We show that almost every positive integer can be expressed as a sum of four squares of integers represented as the sums of three positive cubes.
In this paper we study the distribution of squares modulo a square-free number $q$. We also look at inverse questions for the large sieve in the distribution aspect and we make improvements on existing results on the distribution of $s$-tuples of reduced residues.
In this paper we are constructing integer lattice squares, cubes or hypercubes in $\mathbb R^d$ with $d\in \{2,3,4\}$. For squares and cubes we find a complete description of their Ehrhart polynomial. For hypercubes, we compute one of the coefficients and show that there exists a simple linear relation between the other two unknown coefficients. This allows as to formulate a conjecture of what the Ehrhart polynomial is in this case.
A note on the order of the Tate--Shafarevich group modulo squares
本文研究了阿贝尔簇的Tate--Shafarevich群模有理平方的阶，证明了每个无平方因子的自然数均可作为某个阿贝尔簇Tate--Shafarevich群的非无平方因子部分出现，从而验证了W. Stein的猜想。
We investigate the number of representations of a large positive integer as the sum of two squares, two positive integral cubes, and two sixth powers, showing that the anticipated asymptotic formula fails for at most O((log X)^3) positive integers not exceeding X.
Elliptic divisibility sequences (EDSs) are generalizations of a class of integer divisibility sequences called Lucas sequences. There has been much interest in cases where the terms of Lucas sequences are squares or cubes. In this work, using the Tate normal form having one parameter of elliptic curves with torsion points, the general terms and periods of all elliptic divisibility sequences with a zero term are given in terms of this parameter by means of Mazur's theorem, and it is shown that which term of h_{n} of an EDS can be a square or a cube by using the general terms of these sequences.
Sieving with square conditions and applications to Hilbert cubes in arithmetic sets
本文探讨了Gallagher筛法在模素数平方下的应用局限，并提出通过转换余数信息以提升筛法效果，同时研究了Hilbert立方体在不同乘法定义集中的最大维度，得出了相关上界。
Inspired by the fact that the sum of the cubes of the first $n$ naturals is equal to the square of their sum, we explore, for each $n$, the Diophantine equation representing all non-trivial sets of $n$ integers with this property. We find definite answers to the standard question of infinitude of the solutions as well as several other surprising results.
Formulas For The Square Root Modulo p
该研究针对形如p=2^k n+1（n为奇数）的素数，提出构造模p平方根函数在有限域F_p上多项式表示的方法，并给出k为2、3、4时的具体公式。
Matrices over maximal orders in cyclic division algebras over Q as sums of squares and cubes
本文研究有理数域上奇素数次循环除代数中极大序上的矩阵，证明在特定条件下，任意阶数大于等于2的矩阵可表示为平方和与立方和，推广了已有结果。
On simultaneous approximation to a real number, its square, and its cube, II
本文解释了此前关于几何级数中四个$\mathbb{Q}$-线性无关实数的一致有理逼近指数上界为何不是最优的。
Computational results on sums of a prime with squares or cubes
本文通过计算验证了素数加两个平方数或立方数的表示猜想，证明了特定范围内所有整数均可表示，并利用椭圆曲线整点方法实现。
Nonexistence of Consecutive Powerful Triplets Around Cubes with Prime-Square Factors
本文证明了围绕具有素数平方因子的立方体的连续强力三元组不存在，结合模算术、p-adic赋值、Thue方程和椭圆曲线理论，推进了Erdős-Mollin-Walsh猜想的研究。
We provide an upper bound on the uniform exponent of approximation to a triple (xi, xi^2, xi^3) by rational numbers with the same denominator, valid for any transcendental real number xi. This upper bound refines a previous result of Davenport and Schmidt. As a consequence, we get a sharper lower bound on the exponent of approximation of such a number xi by algebraic integers of degree at most 4.
Square-free orders for CM elliptic curves modulo $p$ in short intervals
本文研究有理数域上CM椭圆曲线模素数的无平方因子阶计数问题，改进了已有渐近公式，得到无条件短区间渐近结果，且适用区间比广义黎曼假设下的更短，同时优化了CM椭圆曲线循环性问题的短区间变体结论。
We study rational approximation properties for successive powers of extremal numbers defined by Roy. For $n\in{\{1,2\}}$, the classic approximation constants $λ_{n}(ζ),\hatλ_{n}(ζ),w_{n}(ζ),\hat{w}_{n}(ζ)$ connected to an extremal number $ζ$ have been established and in fact much more is known. However, so far almost nothing had been known for $n\geq 3$. In this paper we determine all classic approximation constants as above for $n=3$. Our methods will more generally provide detailed information on the combined graph defined by Schmidt and Summerer assigned to an extremal number, its square an…
We give some new $q$-supercongruences on truncated forms of squares of basic hypergeometric series. Most of them are modulo the cube of a cyclotomic polynomial, and two of them are modulo the fourth power of a cyclotomic polynomial. The main ingredients of our proofs are the creative microscoping method, a lemma of El Bachraoui, and the Chinese remainder theorem for coprime polynomials. We also propose several related conjectures for further study.
Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this paper, it is proved that for every sufficiently large even integer $N$, the equation \begin{equation*} N=x^2+p_1^3+p_2^3+p_3^3+p_4^3+p_5^3 \end{equation*} is solvable with $x$ being an almost-prime $\mathcal{P}_6$ and the other variables primes. This result constitutes an improvement upon that of Cai, who obtained the same conclusion, but with $\mathcal{P}_{36}$ in place of $\mathcal{P}_6$.
Let $S_2$ be the set of integer squares. We show that the dimension $d$ of a Hilbert cube $a_0+\{0,a_1\}+...+ \{0, a_d\}\subset S_2$ is bounded by $d=O(\log \log N)$
Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this paper, it is proved that, for $12\leqslant b\leqslant 35$ and for every sufficiently large odd integer $N$, the equation \begin{equation*} N=x^2+p_1^3+p_2^3+p_3^3+p_4^3+p_5^4+p_6^b \end{equation*} is solvable with $x$ being an almost-prime $\mathcal{P}_{r(b)}$ and the other variables primes, where $r(b)$ is defined in the Theorem. This result constitutes an improvement upon that of Lü and Mu.
We obtain new lower bounds on the number of smooth squarefree integers up to $x$ in residue classes modulo a prime $p$, relatively large compared to $x$, which in some ranges of $p$ and $x$ improve that of A. Balog and C. Pomerance (1992). We also estimate the smallest squarefull number in almost all residue classes modulo a prime $p$.
We prove that digital sequences modulo $m$ along squares are normal, which covers some prominent sequences like the sum of digits in base $q$ modulo $m$, the Rudin-Shapiro sequence and some generalizations. This gives, for any base, a class of explicit normal numbers that can be efficiently generated.
Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this paper, we generalize the result of Vaughan for ternary admissible exponent. Moreover, we use the refined admissible exponent to prove that, for $3\leqslant k\leqslant 14$ and for every sufficiently large even integer $n$, the following equation \begin{equation*} n=x^2+p_1^2+p_2^3+p_3^3+p_4^3+p_5^k \end{equation*} is solvable with $x$ being an almost-prime $\mathcal{P}_{r(k)}$ and the other variables primes, where $r(k)$ is defined in Theorem. This result constitutes a deepening…
Given an integer $q$ and a polynomial $f\in \mathbb Z_{q}[X]$ of degree $d$ with coefficients in the residue ring $\mathbb Z_q=\mathbb Z/q\mathbb Z,$ we obtain new results concerning the number of solutions to congruences of the form $$y\equiv f(x) \pmod{q},$$ with integer variables lying in some cube $\mathcal B$ of side length $H$. Our argument uses ideas of Cilleruelo, Garaev, Ostafe and Shparlinski which reduces the problem to the Vinogradov mean value theorem and a lattice point counting problem. We treat the lattice point problem differently using transference principles from the Geometr…
Using Watson's terminating $_8ϕ_7$ transformation formula, we prove a family of $q$-congruences modulo the square of a cyclotomic polynomial, which were originally conjectured by the author and Zudilin [J. Math. Anal. Appl. 475 (2019), 1636--646]. As an application, we deduce two supercongruences modulo $p^4$ ($p$ is an odd prime) and their $q$-analogues. This also partially confirms a special case of Swisher's (H.3) conjecture.
The group of singular elements was first introduced by Helmut Hasse and later it has been studied by numerous authors including such well known mathematicians as: Cassels, Furtwängler, Hecke, Knebusch, Takagi and of course Hasse himself; to name just a few. The aim of the present paper is to present algorithms that explicitly construct groups of singular and $S$-singular elements (modulo squares) in a global function field.
$ $The aim of this thesis is to lower the bound on square-free primitive roots modulo primes. Let $g^{\Box}(p)$ be the least square-free primitive root modulo $p$. We have proven the following two theorems. Theorem 0.1. $$g^{\Box}(p) < p^{0.88}\quad\text{for all primes }p.$$ Theorem 0.2. $$g^{\Box}(p) < p^{0.63093}\quad\text{for all primes } p < 2.5\times10^{15} \text{ and }p > 9.63\times10^{65}.$$ Theorem 0.1 shows an improvement in the best known bound while Theorem 0.2 shows for which primes we can prove the theoretical lower bound. After some introductory information in Chapter 1, we will …
Let A be an abelian variety over a number field K. An identity between the L-functions L(A/K_i,s) for extensions K_i of K induces a conjectural relation between the Birch-Swinnerton-Dyer quotients. We prove these relations modulo finiteness of Sha, and give an analogous statement for Selmer groups. Based on this, we develop a method for determining the parity of various combinations of ranks of A over extensions of K. As one of the applications, we establish the parity conjecture for elliptic curves assuming finiteness of Sha[6^\infty] and some restrictions on the reduction at primes above 2 a…
We investigate sums of mixed powers involving two squares and three biquadrates. In particular, subject to the truth of the Generalised Riemann Hypothesis and the Elliott-Halberstam Conjecture, we show that all large natural numbers n with 8 not dividing n, n not congruent to 2 modulo 3, and n not congruent to 14 modulo 16, are the sum of 2 squares and 3 biquadrates.
We make many new observations on primitive roots modulo primes. For an odd prime $p$ and an integer $c$, we establish a theorem concerning $\sum_g(\frac{g+c}p)$, where $g$ runs over all the primitive roots modulo $p$ among $1,\ldots,p-1$, and $(\frac{\cdot}p)$ denotes the Legendre symbol. On the basis of our numerical computations, we formulate 35 conjectures involving primitive roots modulo primes. For example, we conjecture that for any prime $p$ there is a primitive root $g<p$ modulo $p$ with $g-1$ a square, and that for any prime $p>3$ there is a prime $q<p$ with the Bernoulli number $B_{q…
We prove that if $p \equiv 4,7 \pmod{9}$ is prime and $3$ is not a cube modulo $p$, then both of the equations $x^3+y^3=p$ and $x^3+y^3=p^2$ have a solution with $x,y \in \mathbb{Q}$.
We prove that if $\varepsilon(m)\to 0$ arbitrarily slowly, then for almost all $m$ and any $A\subset\mathbb{Z}_m$ such that $A-A$ does not contain non-zero quadratic residues we have $|A|\leq m^{1/2-\varepsilon(m)}.$
In this paper we introduce and study a family $Φ_k$ of arithmetic functions generalizing Euler's totient function. These functions are given by the number of solutions to the equation $\gcd(x_1^2+\ldots +x_k^2, n)=1$ with $x_1,\ldots,x_k \in {\mathbb{Z}}/n{\mathbb{Z}}$ which, for $k=2,4$ and $8$ coincide, respectively, with the number of units in the rings of Gaussian integers, quaternions and octonions over ${\mathbb{Z}}/n{\mathbb{Z}}$. We prove that $Φ_k$ is multiplicative for every $k$, we obtain an explicit formula for $Φ_k(n)$ in terms of the prime-power decomposition of $n$ and derive an…
This paper proposes a new signature scheme based on two hard problems : the cube root extraction modulo a composite moduli (which is equivalent to the factorisation of the moduli, IFP) and the discrete logarithm problem(DLP). By combining these two cryptographic assumptions, we introduce an efficient and strongly secure signature scheme. We show that if an adversary can break the new scheme with an algorithm $\mathcal{A},$ then $\mathcal{A}$ can be used to sove both the DLP and the IFP. The key generation is a simple operation based on the discrete logarithm modulo a composite moduli. The sign…
Let $\mathbb{Z}_n$ be the ring of residue classes modulo $n$, and let $\mathbb{Z}_n^{\ast}$ be the group of its units. 90 years ago, Brauer obtained a formula for the number of representations of $c\in \mathbb{Z}_n$ as the sum of $k$ units. Recently, Yang and Tang in [Q. Yang, M. Tang, On the addition of squares of units and nonunits modulo $n$, J. Number Theory., 155 (2015) 1--12] gave a formula for the number of solutions of the equation $x_1^2+x_2^2=c$ with $x_{1},x_{2}\in \mathbb{Z}_n^{\ast}$. In this paper, we generalize this result. We find an explicit formula for the number of solutions…
We consider a modification of the classical number theoretic question about the gaps between consecutive primitive roots modulo a prime $p$, which by the well-known result of Burgess are known to be at most $p^{1/4+o(1)}$. Here we measure the distance in the Hamming metric and show that if $p$ is a sufficiently large $r$-bit prime, then for any integer $n \in [1,p]$ one can obtain a primitive root modulo $p$ by changing at most $0.11002786...r$ binary digits of $n$. This is stronger than what can be deduced from the Burgess result. Experimentally, the number of necessary bit changes is very sm…
Although squaring integers is deterministic, squares modulo a prime, $p$, appear to be random. First, because they are all generated by the multiplicative linear congruential equation, $x_{i+1} = g^2 x_i \mod p$, where $x_0 = 1$ and $g$ is any primitive root of $p$, a pseudorandom number heuristic suggests that they are, in fact, unpredictable. Moreover, one type of cryptography makes use of discrete algorithms, which depends on the difficulty of solving $a = g^n$ for $n$ given $a$ and $g$. This suggests that the squares, which are exactly the even powers of $g$, are hard to identify. On the o…
We use character sum estimates to give a bound on the least square-full primitive root modulo a prime. Specifically, we show that there is a square-full primitive root mod $p$ less than $p^{2/3 + 3/(4 \sqrt{e})+ ε}$, and we give some conditional bounds.
On polynomials with roots modulo almost all primes
该研究定义了在几乎所有素数模下有根但无整数根的首一整系数多项式为例外多项式，分类了与不可约首一二次多项式乘积为例外多项式的不可约首一整系数多项式，并构造了指定因式形式的例外多项式。
Let $E$ be an elliptic curve over $\Q$. It is well known that the ring of endomorphisms of $E_p$, the reduction of $E$ modulo a prime $p$ of ordinary reduction, is an order of the quadratic imaginary field $Q(π_p)$ generated by the Frobenius element $π_p$. When the curve has complex multiplication (CM), this is always a fixed field as the prime varies. However, when the curve has no CM, very little is known, not only about the order, but about the fields that might appear as algebra of endomorphisms varying the prime. The ring of endomorphisms is obviously related with the arithmetic of $a_p^2…
Issai Schur once asked if it was possible to determine a bound, preferably using elementary methods, such that for all prime numbers p greater than the bound, the greatest number of consecutive quadratic non-residues modulo p is always less than the square root of p. This paper uses elementary methods to prove that 13 is the only prime number for which the greatest number of consecutive quadratic non-residues modulo p exceeds the square root of p.
We study the problem of the existence of arithmetic progressions of three cubes over quadratic number fields Q(sqrt(D)), where D is a squarefree integer. For this purpose, we give a characterization in terms of Q(sqrt(D))-rational points on the elliptic curve E:y^2=x^3-27. We compute the torsion subgroup of the Mordell-Weil group of this elliptic curve over Q(sqrt(D)) and we give partial answers to the finiteness of the free part of E(Q(sqrt(D))). This last task will be translated to compute if the rank of the quadratic D-twist of the modular curve X_0(36) is zero or not.
On the Birch and Swinnerton-Dyer formula modulo squares for certain quadratic twists of elliptic curves
本文研究椭圆曲线二次扭曲下Birch和Swinnerton-Dyer公式模平方的有效性，通过局部Tamagawa数的分类结果，证明了满足修正Heegner假设的二次扭曲下该公式模平方的等价性，并得到半稳定椭圆曲线的相关推论。
We study asymptotic properties of periods and transient phases associated with modular power sequences. The latter are simple; the former are vaguely related to the reciprocal sum of square-free integer kernels.
We give elementary proofs for the Apagodu-Zeilberger-Stanton-Amdeberhan-Tauraso congruences $$\sum\limits_{n=0}^{p-1}\dbinom{2n}{n} \equivη_{p}\mod p^{2},$$ $$\sum\limits_{n=0}^{rp-1}\dbinom{2n}{n} \equivη_{p}\sum\limits_{n=0}^{r-1}\dbinom {2n}{n}\mod p^{2}$$ and $$\sum\limits_{n=0}^{rp-1}\sum\limits_{m=0}^{sp-1}\dbinom{n+m}{m}^{2} \equivη_{p} \sum\limits_{m=0}^{r-1}\sum\limits_{n=0}^{s-1}\dbinom{n+m}{m}^2\mod p^2,$$ where $p$ is an odd prime, $r$ and $s$ are nonnegative integers, and $η_{p}= \begin{cases} 0, &\text{if }p\equiv0\mod 3;\\ 1, & \text{if }p\equiv1\mod 3;\\ -1, &\text{if }p\equiv2…
Factorial residues modulo a prime: beyond the square-root bound
本研究针对素数模阶乘剩余集的大小下界问题，利用有限域阶乘恒等式、分式线性映射交点性质与Stevens-de Zeeuw点线相交定理，将下界从平方根级改进至\\(p^{8/15}\\)量级。
There are infinitely many Hilbert cubes of dimension 3 in the set of squares
本文证明了在整数平方集中存在至少O(N^{1/8})个三维希尔伯特立方体，并证明了相关比例集在正实数中稠密。
In this paper we confirm a conjecture of Sun which states that each positive integer is a sum of a square, an odd square and a triangular number. Given any positive integer m, we show that p=2m+1 is a prime congruent to 3 modulo 4 if and only if T_m=m(m+1)/2 cannot be expressed as a sum of two odd squares and a triangular number, i.e., p^2=x^2+8(y^2+z^2) for no odd integers x,y,z. We also show that a positive integer cannot be written as a sum of an odd square and two triangular numbers if and only if it is of the form 2T_m (m>0) with 2m+1 having no prime divisor congruent to 3 modulo 4.
We study the Witt classes of the modular categories $SO(2r)_{2r}$ associated with quantum groups of type $D_r$ at $4r-2$th roots of unity. From these classes we derive infinitely many Witt classes of order 2 that are linearly independent modulo the subgroup generated by the pointed modular categories. In particular we produce an example of a simple, completely anisotropic modular category that is not pointed whose Witt class has order 2, answering a question of Davydov, Müger, Nikshych and Ostrik. Our results show that the trivial Witt class $[Vec]$ has infinitely many square roots modulo the …
Hilbert cubes in sets with arithmetic properties
本文提出新的框架估计任意集合有限截断中最大希尔伯特立方体维度，研究了完美幂、幂ful数、素数、光滑数和平方自由数等算术集合中的希尔伯特立方体，并改进了多个先前结果，得到若干情况下精确度较高的界。
Several articles deal with tilings with squares and dominoes on 2-dimensional boards, but only a few on boards in 3-dimensional space. We examine a tiling problem with colored cubes and bricks of $(2\times2\times n)$-board in three dimensions. After a short introduction and the definition of breakability we show a way to get the number of the tilings of an $n$-long board considering the $(n-1)$-long board. It describes recursively the number of possible breakable and unbreakable tilings. Finally, we give some identities for the recursions using breakability. The method of determining the recur…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。