Robin Chapman, Hao Pan
We give q-analogues of Wilson's theorem for the primes congruent 1 and 3 modulo 4 respectively. And q-analogues of two congruences due to Mordell and Chowla are also established.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
Let ${\mathcal C}_n$ be the set of all permutation cycles of length $n$ over $\{1,2,\ldots,n\}$. Let $${\mathfrak f}_n(q):=\sum_{σ\in{\mathcal C}_{n+1}}q^{{\mathrm maj}\,σ} $$ be a $q$-analogue of the factorial $n!$, where ${\mathrm maj}$ denotes the major index. We prove a $q$-analogue of Wilson's congruence $$ {\mathfrak f}_{n-1}(q)\equivμ(n)\pmod{Φ_n(q)}, $$ where $μ$ denotes the Möbius function and $Φ_n(q)$ is the $n$-th cyclotomic polynomial.
We use actions by finite cyclic groups to derive generalizations of three classical theorems from elementary number theory.
A classical result of A. Fleck states that if p is a prime, and n>0 and r are integers, then $$\sum_{k=r(mod p)}\binom {n}{k}(-1)^k=0 (mod p^{[(n-1)/(p-1)]}).$$ Recently R. M. Wilson used Fleck's congruence and Weisman's extension to present a useful lemma on polynomials modulo prime powers, and applied this lemma to reprove the Ax-Katz theorem on solutions of congruences modulo p and deduce various results on codewords in p-ary linear codes with weights. In light of the recent generalizations of Fleck's congruence given by D. Wan, and D. M. Davis and Z. W. Sun, we obtain new extensions of Wil…
We give a q-analogue of Gauss' divisibility theorem
We present generalisations of Wilson's theorem for double factorials, hyperfactorials, subfactorials and superfactorials.
Wilson's theorem modulo higher prime powers I: Fermat and Wilson quotients
该研究利用Bell多项式与Newton恒等式，证明威尔逊定理及威尔逊商可由含费马商幂和项的任意更高素数幂模超同余式描述，还给出相关多元多项式的递推公式与更多性质，推进了数论中超同余问题的研究。
We introduce Wilson's theorem and Clement's result and present a necessary and sufficient condition for p and p+2k to be primes where k is a positive integer. By using Simiov's Theorem, we derive an improved version of Clement's result and characterizations of Polignac twin primes which parallel previous characterizations.
In this short note, we introduce an analogue of Wilson's theorem for all nonzero elements $a_1,a_2,...,a_{q-1}$ of a finite filed $\mathbb{F}$ with $|\mathbb{F}|=q\geq 3$, as follows: $$ \sum_{1\leq i_1< i_2<...< i_k\leq q-1}a_{i_1}a_{i_2}... a_{i_k}=\left\lfloor\frac{k}{q-1}\right\rfloor(-1)^q\hspace{10mm}(k=1,2,..., q-1), $$ which the left hand side of above formula is the $k-$th elementary symmetric polynomial evaluated at $a_1,a_2,...,a_{q-1}$. Specially, letting $\mathbb{F}=\mathbb{Z}_p$ with $p\geq 3$, reproves Wilson's theorem and yields some Wilson type identities. Finally, we obtain a…
In this short note, we introduce an Euler analogue of Wilson's theorem; $a_1a_2... a_{ϕ(n)}\equiv (-1)^{ϕ(n)+1}~({\rm mod}~n)$ say, where ${\rm gcd}(a_i,n)=1$.
Renyi's result on the density of integers whose prime factorizations have excess multiplicity has an analogue for polynomials over a finite field.
A family of congruences interpolating between those of Wilson and Giuga is constructed. Several elementary results are established, in order to present a possible approach to establishing Giuga's conjecture.
On Quotients of a More General Theorem of Wilson
本研究基于Wilson定理的扩展推论，推导出更多商的求和表达式、扩展Lehmer结果的模同余式及生成函数。
We provide a proof of Wilson's Theorem and Wolstenholme's Theorem based on a direct approach by Lagrange requiring only basic properties of the primes and the Binomial theorem. The goal is to show how similar the two theorems are by providing the easiest proof possible in a single unified argument.
By applying multiplicate forms of the Carlitz inverse series relations to the $q$-Pfaff-Saalsch{ü}tz summation theorem, we establish twenty five nonterminating $q$-series identities with several of them serving as $q$-analogues of infinite series expressions for $π$ and $1/π$, including some typical ones discovered by Ramanujan (1914) and Guillera.
We present a Rainbow Ramsey version of the well-known Ramsey-type theorem of Richard Rado. We use techniques from the Geometry of Numbers. We also disprove two conjectures proposed in the literature.
First, we present a new proof of Glaisher's formula dating from 1900 and concerning Wilson's theorem modulo p^2. Our proof uses p-adic numbers and Faulhaber's formula for the sums of powers (17th century), as well as more recent results on Faulhaber's coefficients obtained by Gessel and Viennot. Second, by using our method, we find a simpler proof than Sun's proof regarding a formula for (p-1)! modulo p^3, and one that can be generalized to higher powers of p. Third, we can derive from our method a way to compute the Stirling numbers modulo p^3, thus improving Glaisher and Sun's own results fr…
We show that there are four possibilities for the product of all elements in the multiplicative group of a quotient of the ring of integers in a number field, and give precise conditions for each of the possibilities to occur. This generalisation of Wilson's theorem turns out to have been first discovered by M. Laššák (2000), but our proof is simpler and more direct.
Wilson's theorem modulo higher prime powers II: Bernoulli numbers and polynomials
该研究将作者此前用费马商幂和超同余描述威尔逊定理与威尔逊商的成果，转化为幂和与伯努利数的同余式，给出更简洁的证明，还算出了模p⁴的威尔逊商等结果并可推广到更高素数幂。
For positive integers m and n, denote S(m,n) as the associated Stirling number of the second kind and let z be a complex variable. In this paper, we introduce the Stirling functions S(m,n,z) which satisfy S(m,n,z) = S(m,n) for any z which lies in the zero set of a certain polynomial P(m,n,z). For all real z, the solutions of S(m,n,z) = S(m,n) are computed and all real roots of the polynomial P(m,n,z) are shown to be simple. Applying the properties of the Stirling functions, we investigate the divisibility of the numbers S(m,n) and then generalize Wilson's Theorem.
We prove an analogue of the prime number theorem for finite fields.
We study the series s(n,x) which is the sum for k from 1 to n of the square of the sine of the product x Gamma(k)/k, where x is a variable. By Wilson's theorem we show that the integer part of s(n,x) for x = Pi/2 is the number of primes less or equal to n and we get a similar formula for x a rational multiple of Pi. We show that for almost all x in the Lebesgue measure s(n,x) is equivalent to n/2 when n tends to infinity, while for almost all x in the Baire sense, 1/2 is a limit point of the ratio of s(n,x) to the number of primes less or equal to n.
Wilson's theorem modulo higher prime powers III: The cases modulo $p^6$ and $p^7$
本研究拓展前期工作，算出更高素数幂下的威尔逊商及对应阶乘同余，确定费马商幂和模性质，揭示相关p进系数规律并验证原始威尔逊同余的适配性。
The Ramanujan--Mordell Theorem for sums of an even number of squares is extended to other quadratic forms and quadratic polynomials.
Khintchine's and Dyson's transference theorems can be very easily deduced from Mahler's transference theorem. In the multiplicative setting an obstacle appears, which does not allow deducing the multiplicative transference theorem immediately from Mahler's theorem. Some extra considerations are required, for instance, induction by the dimension. In this paper we propose an analogue of Mahler's theorem which implies the multiplicative transference theorem immediately.
The purpose of this paper is to derive the analogue of Lebesgue-Radon-Nikodym theorem with respect to $p$-adic $q$-invariant distribution on $\Bbb Z_p$ which is defined by author in [1].
Wilson's Theorem states that the product of all nonzero elements of a finite field ${\mathbb F}_q$ is $-1$. In this article, we define some natural subsets $S \subset {\mathbb F}_q^\times$ and find formulas for the product of the elements of $S$, denoted $\prod S$. These new formulas are appealing for the simple, natural description of the sets $S$, and for the simplicity of the product. An example is $\prod\left\{ a \in {\mathbb F}_q^\times : \text{$1-a$ and $3+a$ are nonsquares} \right\} = 2$ if $q \equiv \pm 1 \pmod{12}$, or $-1$ otherwise.
We prove a strong analogue of Liouville's Theorem in Diophantine approximation for points on arbitrary algebraic varieties. We use this theorem to prove a conjecture of the first author for cubic surfaces in $¶^3$.
The classical Grunwald--Wang theorem is an example of a local--global (or Hasse) principle stating that except in some special cases which are precisely determined, an element $m$ in a number field $\mathbb{K}$ is an $a$-th power in $\mathbb{K}$ if and only if it is an $a$-th power in the completion $\mathbb{K}_{v}$ for all but finitely many primes $v$ of $\mathbb{K}$. In this paper, we prove a Carlitz module analogue of the Grunwald--Wang theorem.
Given a polynomial $g$ of positive degree over a finite field, we show that the proportion of polynomials of degree $n$, which can be written as $h+g^k$, where $h$ is an irreducible polynomial of degree $n$ and $k$ is a nonnegative integer, has order of magnitude $1/°g$.
We construct a family of harmonic Maass forms of polynomial growth of any level corresponding to any cusp whose shadows are Eisenstein series of integral weight. We further consider Dirichlet series attached to a harmonic Maass form of polynomial growth, study its analytic properties, and prove an analogue of Weil's converse theorem.
The main result of this paper is an inequality relating the lattice point enumerator of a 3-dimensional, 0-symmetric convex body and its successive minima. This is an example of generalization of Minkowski's theorems on successive minima, where the volume is replaced by the discrete analogue, the lattice point enumerator. This problem is still open in higher dimensions, however, we introduce a stronger conjecture that shows a possibility of proof by induction on the dimension.
An analogue of Rogers' theorem on sieving in commutative rings
本文研究了在可换环中筛法定理的类比条件，证明了当且仅当环是Dedekind环时成立，并探讨了有限可换环中该定理成立的条件。
This paper deals with function field analogues of the famous theorem of Landau which gives the asymptotic density of sums of two squares in $\mathbb{Z}$. We define the analogue of a sum of two squares in $\mathbb{F}_q[T]$ and estimate the number $B_q(n)$ of such polynomials of degree $n$ in two cases. The first case is when $q$ is large and $n$ fixed and the second case is when $n$ is large and $q$ is fixed. Although the methods used and main terms computed in each of the two cases differ, the two iterated limits of (a normalization of) $B_q(n)$ turn out to be exactly the same.
In connection with our previous work on semi-galois categories, this paper proves an arithmetic analogue of Christol's theorem concerning an automata-theoretic characterization of when a formal power series over finite field is algebraic over the polynomial ring. There are by now several variants of Christol's theorem, all of which are concerned with rings of positive characteristic. This paper provides an arithmetic (or F_1) variant of Christol's theorem in the sense that it replaces the polynomial ring with the ring of integers of a number field and the ring of formal power series with the r…
Difference "abc" theorem for entire functions and Difference analogue of truncated version of Nevanlinna second main theorem
本文研究了阶小于1的整函数的差分$abc$定理及Nevanlinna第二主定理截断版本的差分类似，揭示了次正规亚纯函数在复平面上具有长长度点的数量限制，并应用于差分Fermat泛函方程的整解。
In this paper we study random iterated function systems. Our main result gives sufficient conditions for an analogue of a well known theorem due to Khintchine from Diophantine approximation to hold almost surely for stochastically self-similar and self-affine random iterated function systems.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。