Extension of $v_p$ to $\bar{\mathbb{Q}}$
by math154, Jul 10, 2011, 3:40 AM
Hmm this is pretty tricky and I wish I actually knew what it meant but here is an application anyway.
(Adapted from Gabriel Dospinescu, 2010 MR U160). Let
be a prime and let
be positive integers. Prove that
![\[v_p\left(\sum_{p|k,0\le k\le n}(-1)^{k} k^{s}\binom{n}{k}\right)\ge v_p(n!).\]](//latex.artofproblemsolving.com/e/e/4/ee4be599ba7f77066b1ddc20b0d8fdd41aeb8de6.png)
Solution
Edit: Two more applications (also from PFTB)!
(Gabriel Dospinescu). Let
be a prime number and let
and
be multiples of
, with
odd. For any function
satisfying
, consider the product
. Prove that the sum of these products is divisible by
. (Yes, we can strengthen it easily.)
(St. Petersburg 2003). Let
be a prime and let
and
be integers. Define
and
the number of subsets
having
elements and such that
divides
. Show that
is a multiple of
.
(Adapted from Gabriel Dospinescu, 2010 MR U160). Let


![\[v_p\left(\sum_{p|k,0\le k\le n}(-1)^{k} k^{s}\binom{n}{k}\right)\ge v_p(n!).\]](http://latex.artofproblemsolving.com/e/e/4/ee4be599ba7f77066b1ddc20b0d8fdd41aeb8de6.png)
Solution
Let the sum be
. Then by a roots of unity filter and the Stirling number representation of
(define
),
and
, then we get a zero term. Also, if
, then from the
terms we get
which is a multiple of
. Thus it suffices to show that for
,
for all
. But using the extension of
to the field of algebraic numbers
(i.e.
, where
is the minimal polynomial of
), the LHS is just
so we're done (note that
in this case).



\[\begin{align*} pS &= \sum_{j=0}^{p-1}\sum_{k=0}^{n}\binom{n}{k} k^s (-\omega^j)^k \\ &= \sum_{j=0}^{p-1}\sum_{k=0}^{n}\binom{n}{k}(-\omega^j)^k\sum_{\ell=0}^{s}{s\brace\ell}\binom{k}{\ell}\ell! \\ &= \sum_{j=0}^{p-1}\sum_{\ell=0}^{\min(s,n)}{s\brace\ell}\ell!\sum_{k=0}^{n}\binom{k}{\ell}\binom{n}{k}(-\omega^j)^k \\ &= \sum_{j=0}^{p-1}\sum_{\ell=0}^{\min(s,n)}{s\brace\ell}\ell!\binom{n}{\ell}\sum_{k=\ell}^{n}\binom{n-\ell}{k-\ell}(-\omega^j)^k \\ &= \sum_{j=0}^{p-1}\sum_{\ell=0}^{\min(s,n)}{s\brace\ell}\ell!\binom{n}{\ell}(-\omega^j)^{\ell}(1-\omega^j)^{n-\ell}. \end{align*}\]If




![\[n!\sum_{j=0}^{p-1}(-\omega^j)^n=p n! (-1)^n [p|n],\]](http://latex.artofproblemsolving.com/0/6/b/06bfdf17f72bd4f39c6b1f7d88d68a377bd21a03.png)


![\[v_p\left(\ell!\binom{n}{\ell}(1-\omega^j)^{n-\ell}\right)>v_p(n!)\]](http://latex.artofproblemsolving.com/d/0/c/d0c7b6a793293c30d1eb4a5ca6e3ff808f21fc0a.png)






![\[v_p(n!)-\frac{n-\ell-s_p(n-\ell)}{p-1}+\frac{n-\ell}{p-1}>v_p(n!),\]](http://latex.artofproblemsolving.com/e/e/0/ee0a131f5c667841a9d537d1b30f4ebbf5a31a7b.png)

Edit: Two more applications (also from PFTB)!
(Gabriel Dospinescu). Let









(St. Petersburg 2003). Let











This post has been edited 8 times. Last edited by math154, Jan 17, 2013, 11:42 PM