Congruences for q\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varvec{q}}$$\end{document}-Binomial Coefficients

We discuss q-analogues of the classical congruence apbp≡ab(modp3)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\left( {\begin{array}{c}ap\\ bp\end{array}}\right) \equiv \left( {\begin{array}{c}a\\ b\end{array}}\right) \pmod {p^3}$$\end{document}, for primes p>3\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$p>3$$\end{document}, as well as its generalisations. In particular, we prove related congruences for (q-analogues of) integral factorial ratios.

One also adopts the cyclotomic polynomials Φ n (q) = n j=1 (j,n)=1 as q-analogues of prime numbers, because these are the only factors of the q-numbers which are irreducible over Q.
Arithmetically significant relations often possess several q-analogues. While looking for q-extensions of the classical (Wolstenholme-Ljunggren) congruence ap bp ≡ a b (mod p 3 ) for any prime p > 3, (1.1) more precisely, at a 'q-microscope setup' (when q-congruences for truncated hypergeometric sums are read off from the asymptotics of their non-terminating versions, usually equipped with extra parameters, at roots of unity, see [5]) for Straub's q-congruence [8], [9,Theorem 2.2], (1.2) this author accidentally arrived at an bn where the notation σ n = (−1) n−1 is implemented. Notice that the expression on the right-hand side is a sum of two q-monomials. The q-congruence (1.3) may be compared with another q-extension of (1.1), for any n > 1. This is given by Andrews in [2] for primes n = p > 3 only; though proved modulo Φ p (q) 2 , a complimentary result from [2] demonstrates that (1.1) in its full modulo p 3 strength can be derived from (1.4). More directly, Pan [7] shows that (1.4) can be generalised further to (1.5) It is worth mentioning that the transition from Φ n (q) 2 to Φ n (q) 3 (or, from p 2 to p 3 ) is significant because the former has a simple combinatorial proof (resulting from the q-Chu-Vandermonde identity) whereas no combinatorial proof is known for the latter.
Since q ( bn 2 ) ∼ σ b n as q → ζ, a primitive n-th root of unity, the congruence (1.3) is seen to be an extension of the trivial (q-Lucas) congruence The principal goal of this note is to provide a modulo Φ n (q) 4 extension of (1.3) (see Lemma 2.1 below) as well as to use the result for extending the congruences (1.2) and (1.5). In this way, our theorems provide two q-extensions of the congruence The latter can be continued further to higher powers of primes [6], and our 'mechanical' approach here suggests that one may try-with a lot of effort!-to deduce corresponding q-analogues.

Theorem 1.2.
For any n > 1, we have the congruence We point out that a congruence A 1 (q) ≡ A 2 (q) (mod P (q)) for rational functions A 1 (q), A 2 (q) ∈ Q(q) and a polynomial P (q) ∈ Q[q] is understood as follows: the polynomial P (q) is relatively prime with the denominators of A 1 (q) and A 2 (q), and P (q) divides the numerator A(q) of the difference A 1 (q)−A 2 (q). The latter is equivalent to the condition that for each zero α ∈ C of P (q) of multiplicity k, the polynomial (q − α) k divides A(q) in C[q]; in other words, This latter interpretation underlies our argument in proving the results. For example, the congruence (1.3) can be established by verifying that when q = ζ(1 − ε) and ζ is any primitive n-th root of unity. Our approach goes in line with [5] and shares similarities with the one developed by Gorodetsky in [4], who reads off the asymptotic information of binomial sums at roots of unity through the q-Gauss congruences. It does not seem straightforward to us but Gorodetsky's method may be capable of proving Theorems 1.1 and 1.2. Furthermore, the part [4, Sect. 2.3] contains a survey on q-analogues of (1.1).
After proving an asymptotical expansion for q-binomial coefficients at roots of unity in Sect. 2 [essentially, the O(ε 4 )-extension of (1.8)], we perform a similar asymptotic analysis for q-harmonic sums in Sect. 3. The information gathered is then applied in Sect. 4 to proving Theorems 1.1 and 1.2. Finally, in Sect. 5, we generalise the congruences (1.2) and (1.5) in a different direction, to integral factorial ratios.

Expansions of q-Binomials at Roots of Unity
This section is exclusively devoted to an asymptotical result, which forms the grounds of our later arithmetic analysis. We moderate its proof by highlighting principal ingredients (and difficulties) of derivation and leaving some technical details to the reader.

Lemma 2.1. Let ζ be a primitive n-th root of unity. Then, as
Proof. It follows from the q-binomial theorem [3, Chap. 10] that Taking N = an, for a primitive n-th root of unity ζ = ζ n , we have In particular, Now observe the following summation formulae:

Implementing this information in (2.3), we obtain
where we intentionally omit all ordinary ε 3 -terms-those that sum up to polynomials in a and n multiplied by powers of x n /(1−x n ), like the ones appearing as εand ε 2 -terms. The exceptional ε 3 -summands are computed separately: The finale of our argument is comparison of the coefficients of powers of x n on both sides of the relation obtained; this way we arrive at the asymptotics in (2.1).

A q-Harmonic Sum
Again, the notation ζ is reserved for a primitive n-th root of unity. For the sum where S n−1 (q) is defined in Lemma 2.1. It follows that, for q = ζ(1 − ε), as ε → 0, where we use The latter asymptotics implies that which may be viewed as an extension of recorded, for example, in [6]. A different consequence of (3.2) is the following fact.

Proof of the Theorems
To prove Theorems 1.1 and 1.2, we need to produce 'matching' asymptotics for respectively. These happen to be easier than that from Lemma 2.1 because q n 2 = (1 − ε) n 2 and q n = (1 − ε) n do not depend on the choice of primitive n-th root of unity ζ when q = ζ(1 − ε).
Proof. For N = a in (2.2), take x n q ( n 2 ) and q n 2 for x and q: Then, for q = ζ(1 − ε), we write y = σ n x n to obtain To conclude, we apply the same argument as in the proof of Lemma 2.1.
Proof of Theorem 1.1. Combining the expansions in Lemmas 2.1-4.1, we find that as q = ζ(1 − ε) → ζ radially. This means that the difference of both sides is divisible by (q − ζ) 4 for any n-th primitive root of unity ζ, hence by Φ n (q) 4 . The latter property is equivalent to the congruence (1.6).

q-Rious Congruences
In this final part, we look at the binomial coefficients as particular instances of integral ratios of factorials, also known as Chebyshev-Landau factorial ratios.
Theorem 5.1. In the notation and are valid for any n ≥ 1.
Observe that when n = p > 3 and q → 1, one recovers from any of these two congruences of which (1.1) is a special case. Furthermore, it is tempting to expect that these two families of q-congruences may be generalised even further in the spirit of Theorems 1.1 and 1.2, and that the polynomials D n (q) satisfy the q-Gauss relations from [4]. We do not pursue this line here.
Proof of Theorem 5.1. Though the congruences (5.3) and (5.4) are between polynomials rather than rational functions, we prove the theorem without the assumption (5.2): in other words, the congruences remain true for the rational functions D n (q) provided that the balancing condition (5.1) (equivalently, c 1 (a, b) = 0 in the above notation for c i ) is satisfied. In turn, this more general statement follows from its validity for particular cases whenever it is already known for the individual factors; we leave this simple fact to the reader and only discuss its other appearance when dealing withD n (q) below. Notice that an bn ≡ an bn ≡ 0 (mod Φ n (q)), so thatD n (q) = an  , a − b)) for i = 2, 3.
As explained above, this also establishes the general case of (5.3) and (5.4).
For related Lucas-type congruences satisfied by the q-factorial ratios D n (q), see [1].