Skip to main content
Ira Gessel's user avatar
Ira Gessel's user avatar
Ira Gessel's user avatar
Ira Gessel
  • Member for 14 years, 1 month
  • Last seen this week
  • Brandeis University, Waltham, MA, United States
awarded
Loading…
awarded
comment
Binomial coefficient congruence modulo $p^n$
The congruences that you stated are not correct; correct versions are given in Ofir Gorodetsky's answer. The related congruences in Meštrović's paper are (37)–(41); see also his Remark 21 on page 13.
answered
Loading…
revised
Loading…
revised
Zeros of inverse of dilogarithm
deleted 1 character in body
Loading…
awarded
awarded
revised
Laurent series in several complex variables
deleted 2 characters in body
Loading…
answered
Loading…
awarded
revised
Loading…
revised
Loading…
Loading…
comment
Number of square-free polynomials over a finite field - a combinatorial interpretation?
Here's a generating function version of this argument. Let $p_n$ be the number of monic polynomials of degree $n$, and let $s_n$ be the number of square-free monic polynomials of degree $n$. Then the generating function for monic polynomials that are squares is $\sum_n p_n x^{2n}$, so the unique factorization of an arbitrary monic polynomial as a square-free polynomial times a square gives $\sum_{n}p_n x^n = \left(\sum_{n}s_n x^n\right)\left(\sum_n p_n x^{2n}\right)$. Since $p_n = q^n$, this gives $\sum_n s_n x^n = (1-qx^2)/(1-qx)=1+qx + \sum_{n=2}^\infty (q^n - q^{n-1})x^n$.
comment
Evaluation of a summation involving Hermite polynomials
One thing you might try is multiply (3) by $z^s/s!$ and sum on $s$, and apply Taylor's theorem. This will give you a simple closed form for the generating function in $s$ of (1).
awarded
revised
Loading…
1
5 6
7
8 9
42