• 検索結果がありません。

RESEARCH NOTES

N/A
N/A
Protected

Academic year: 2022

シェア "RESEARCH NOTES"

Copied!
4
0
0

読み込み中.... (全文を見る)

全文

(1)

I nternat. J. Math. Math. Sci.

Vol. 5 No.

2

(1980)

597-400

,97

RESEARCH NOTES

BINOMIAL EXPANSIONS MODULO PRIME POWERS

PAUL W. HAGGARD

Department of Mathematics East Carolina University Greenville, North Carolina 27834

U.S.A.

JOHN O. KILTINEN

Department of Mathematics Northern Michigan University Marquette, Michigan 49855

U.S.A.

(Received December 3, 1979)

ABSTRACT: In this note a result is given and proved concerning binomial

expansions modulo prime powers. In the proof congruence modulo prime powers is generalized to the rational numbers via valuations.

KEY WORDS AND PHRAS_ES: Modulo Pime Powers, p-adic valuation, and rings of characteristi p’"

1980 MATHEMATICS SUBJECT CLASSIFICATION CODES:

IOC20.

i. INTRODUCTION.

It is well known that if R is a commutative ring of prime characteristic p, then

(2)

398 P. W. HAGGARD AND J. O. KILTINEN

(x

+ y)P

xp

+ yP

(l.i).

and more generally,

n n n

(x

+ y)P

xp

+ yP

for any x and y in R. The reason that (2) holds is that

c(pn,k) { I

ifif i <k k0 <or

pn-i

pn (mod p)., (1.3)

and so the interior terms all vanish when one applies the usual binomial expansion formula.

One cannot expect such a simple expansion with a non-prime characteristic.

However, a generalization of

(1.3)

leads to a recognition of the vanishing terms in the case of a ring of prime power characteristic.

To develop this result, we use the notation v to denote the usual p-adic P

valuation on the rational numbers

Q: Vp(k)

is the highest power of p

dividin

an integer k and

Vp(J/k) vp(j) Vp(k)

for a rational number

J/k.

(Set

Vp(0) .

Recall that

Vp(X + y) min{Vp(X),Vp(y)}

and

Vp(Xy) Vp(X) + Vp(y)

for any x, y in

Q.)

For x, y e Q and positive integer m, define

x E y (rood

pro)

Iff v

(x y) am.

One can show that this defines an equivalence P

relation on Q which reduces to the usual equivalence relation modulo

pm

on the integers Z. We will need the following fact about this relation:

For all x, y e Q and

J,

k e

Z,

if x

J

(mod

pro)

and y k (rood

pm),

then xy

Jk

(rood

pro) (1.4)

2. MAIN RESULTS

THEOREM: For p a prime, m and n positive integers with n R m-l, and for 0 < k < pn

if p k (ie,

Vp(k)

_< n-m)

c(pn’k)

(pm-l,i)

if k i.pn-’l (rood

pro) (2.1)

(3)

BINOMIAL EXPANSIONS MODULO PRIME POWERS 399

PROOF: Note first that

(c(pn,k))

v

(.F__)--

n n v (k).

vp p K p

(2.2)

To see this, write

n n

C

(pn,k) Y__. pn-l.

P"’-2

Pn- (k-l)

k i 2 k-i

Note that

PJ

i iff

pJ (pn-i)

for I <

I

< k-l. Thus,

Vp((pn-i)/i)

0

for 1 < i k-l, and so

(2.2)

follows.

Now if vP

(k)

< n-m, then from

(2.2), Vp(C(pn,k))

> n-(n-m) m, so

c(pn,k)

0 (rood

pro),

and this case is proven.

n-m+l

Now take k i.p Write C(pn-

,i-p

n-re+l)

in the following form, n-m+l

grouping the terms divisible by p to the front:

C(P

n

i.pn_m+l (pn_(i_l)pn-m+l). (pn_(i_2)pn-m+l) P

n

pn_j

n-m+l n-m+l n-m+l

J

p 2.p i’p

n-m+l

The concluding product is taken over those

J

less than i-p such that

n-m+l

p

J.

Note that the first i terms reduce to

c[pm-l,i)’"

when all factors n-m+l

of p are removed. Also, since

(pn_j)/j +

i

pn/j

and

Vp(pn/j)

n-vP(j) >

n-(n-m)

m, one has

(pn_j)/j

-i (rood

pro)

for all of the

n-m+l n-m+l

terms in the concluding product. Since there are i.p i i(p i) such terms in the product, by

(1.4),

one has

i

(pn-m+l-l)

c(pn,i pn-m+l)

C(p

m-l,l).

(-i) (rood

pro).

For p odd or i even, this gives the desired result.

The one remaining case is p 2 and i odd. Now by (2.2) and since i is odd,

v2(c(2n,i.2n-m+l)) v2(2n/i’2n-m+l)

m-l. Thus,

c(2n,i.

2n-m+l is

2

m-I

times some odd integer, say 2x+l. Then

c(2n,i-2 n-re+l) 2rex +

2

m-I

2

m-I

(rood 2

m)

for any n

m

m-l. Equating for each such n to the special case n m-l, one gets C(2n i.2

n-m+l)

C(2m-1 i) (rood 2

m)

which is the desired result again

(4)

400 P. W. HAGGARD AND J. O. KILTINEN

This theorem yields the following binomial expansion in rings of character- istic pm

COROLLARY: If R is a commutative ring of characteristic pm and if n > m-l, then for any x and y in R,

n m-I n-m+l n-m+l

(x

+ y)

p

7.i:

P 0 C

(pm-i

,i)-x

[pro-l-i)

p

"Yi"

p (2.3)

Note that the number of nonvanishing terms depends only on the characteristic pm and not on the exponent pn and that for m i, (2.3) reduces to (1.2). The following reference considers some closely related questions.

REFERENCE

J. Kiltinen, Linearity of exponentlation, Math. Mag. 52

(1979),

3-9.

参照

関連したドキュメント

Xavier, Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation, Eur.. Lueker, Probabilistic Analysis of Packing

In Section 2, we prove Theorem 2.2 and Theorem 2.4 which show the freeness of the maximal divided power extension of the rational Cherednik algebra of

Two grid diagrams of the same link can be obtained from each other by a finite sequence of the following elementary moves.. • stabilization

Although Golomb [I] conjectured that 6 is not a proper difference of two powerful numbers, and that there are infinitely many integers which cannot be represented as a proper

The model is developed with the following assumptions: i the temperature profile is determined in a quasi-stationary regime; ii the gas temperature does not change substantially in

The computation of CA and SA numbers allows a very compact representation: since the prime exponents form a slowly decreasing sequence, with a very long tail of ones, we may just

Recall that we have derived upper bounds for the entropy of summation operators by the corresponding results about integration operators.. But for t k ’s not increasing too fast we

We give an elementary proof that, if the order of a horizontal s- form on a jet bundle does not increase under the operation of the horizontal differential, then the coefficients of