12 views

Uploaded by Mihnea

- Basic Group Theory
- phpessentials-130821003448-phpapp02
- HW 6
- On the Smarandache Irrationality Conjecture
- China Western Mathematical Olympiad 2010 63
- Www.fq.Math.ca Papers 50-3 EulerSadek
- Congruence Equations
- H Aboulfotouh Hieratic Numeral Signs
- A note on primes of the form a2 + 1
- FinalClass 9
- Moz the Beginners Guide to SEO
- solHW4
- Hanna Neumann Sheet 1 - Questions
- Suggestion _ MAth3_CSE 4th.
- construct a prime concept and an appreciation of it
- Articulo E241de Leonhar Euler
- A new additive function and the Smarandache divisor product sequences
- cosets
- Maths Grade 6 Practice Test 1
- Chap01 - 001-016.pdf

You are on page 1of 5

Alison Miller

June 30, 2011

1 Warm-up

1 (MOP 00). How many zeroes are there at the end of

6 4

45 + 65 ?

2 Basic Facts

For the purposes of this handout, p is an odd prime.1

Z/pn Z is the set of integers mod p. It has an addition and a multiplication law, furthermore,

any element that is not a multiple of p has a multiplicative inverse. We can consider the subset

Z/pn Z of invertible elements; these are exactly the elements not divisible by p. These form an

abelian group, so we can use the language of group theory here, but we dont need to.

Definition 1. The order mod pn of an element a Z/pn Z is the least d such that ad = 1 mod pn .

Theorem 1. The multiplicative group of Z/pn Z: The multiplicative group of Z/pn Z has order

(pn ) = pn1 (p 1) and is cyclic.

(You should prove this but you may assume that the multiplicative group of Z/pZ is cyclic.)

More useful terminology:

Definition 2. For an integer n define vp (n) = max{a : pa | n}. This is often called the p-adic

valuation of n.

Exercise 1. Show that vp (a + b) min(vp (a), vp (b)).

Theorem 2.

(a + pr b)n = an + npr an1 b (mod p2r ).

mod pn analogue of Taylor Series: If P (x) Z[x], then

p2r b2 P 00 (a) p2r b3 P 000 (a)

P (a + pr b) = P (a) + pr bP 0 (a) + + + .

2! 3!

In particular:

P (a + pr b) = P (a) + pr bP 0 (a) (mod p2r ).

(Again, this sum is finite.)

1

Unless stated otherwise.

1

MOP 2011, Black Group Stuff mod pr June 24, 2011

Lemma 1 (Hensels Lemma). For a polynomial P (x) Z[x], if there exists a Z such that

P (a) 0 (mod p), and P 0 (a) 6 0 (mod p), then, for any positive integer k, there exists b Z

with b a (mod p) and P (b) 0 (mod pn ).

The sort of inductive construction used in Hensels Lemma can be useful in other contexts as

well.

Lemma 2 (The Lemma Which is Not Hensels Lemma, a.k.a. Lifting the Exponent). Let p be an

odd prime and n a positive integer.

If vp (a) = vp (b) = 0 and vp (a b) > 0, then vp (an bn ) = vp (a b) + vp (n).

If vp (a) = vp (b) = 0 and vp (a + b) > 0, then vp (an + bn ) = vp (a + b) + vp (n).

(The prime p = 2 is finicky, so we wont talk about it here. But analogous statements do exist;

can you find them?)

The formula for vp (n!) is useful; it can also be used to find the p-adic valuation of binomial

coefficients.

Theorem 3 (Wolstenholmes theorem:). This is a name given to a number of related facts. Here,

let p be a prime greater than or equal to 5. Then the numerator of

1 1 1

1+ + + +

2 3 p1

1 1 1

1+ 2

+ 2 + +

2 3 (p 1)2

is divisible by p.

2p

2 (mod p3 ),

p

and more generally

ap a

(mod p3 ).

bp b

3 Problems

Not all the problems below involve prime powers in their statements, so you may need to focus on

certain primes or apply Chinese Remainder theorem to solve them.

2. (a) Find the smallest integer n with the following property; if p is an odd prime and a is a

primitive root modulo pn , then a is a primitve root modulo every power of p.

(b) Show that 2 is a primitive root modulo 3k and 5k for every positive integer k.

3 (Ireland 1996). Let p be a prime number and a, n positive integers. Prove that if 2p + 3p = an ,

then n = 1.

2

MOP 2011, Black Group Stuff mod pr June 24, 2011

4. Find all pairs (m, n) of positive integers, with m, n 2, such that an 1 is divisible by m for

each a {1, 2, . . . , n}.

5 (USA TST). Let p be a prime number greater than 5. For any integer x, define

p1

X 1

fp (x) =

k=1

(px + k)2

Prove that for all positive integers x and y the numerator of fp (x) fp (y), when written in

lowest terms, is divisible by p3 .

6. Show that the equation xn + y n = (x + y)m has a unique solution satisfying x > y, m > 1,

n > 1.

7 (China TST 2004, MOP 2004). Let u be a fixed positive integer. Prove that the equation

n! = u u has a finite number of solutions (n, , ).

8 (IMO Shortlist 2007). For every integer k 2, prove that 23k divides the number

k+1 k

2 2

k

k1

2 2

9 (MOP 08). Let a, b, c, d, m be positive integers such that gcd(m, c) = 1. Prove that there exists

a polynomial f of degree at most d such that f (n) can+b (mod m) for all n if and only if m

divides (ca 1)d+1 .

Let p be an odd prime.

We know that n! is divisible by a high power of p. In fact... vp (n!) = b np c + b pn2 c + . So

looking at n! modulo powers of p is boring, because there are all those ps in them. Lets take

them out!

Definition 3. Let Y

(n!)p = i.

1i<n

p6|i

This is however a suboptimal definition because it turns out that the value of (n!)p mod pn

depends not only on the value of n mod p but also on the parity of p (look at (1!)p versus (p + 1)!p ).

The mathematicians who have thought about this sort of thing have generally worked in terms

of generalizing the function (n) = (n 1)!, so we will use their terminology.

The following definition fixes both those problems.

Definition 4 (Moritas p-adic gamma function). Let

3

MOP 2011, Black Group Stuff mod pr June 24, 2011

(Note: this implies that p can be extended to a continuous function on the p-adics.)

10. Suppose p is 1 mod 4. Show that if 2a 1 (mod pn ) then p (a)2 1 (mod pn ).

Because of this we can say that p (1/2) is a p-adic square root of 1.

[WARNING: this section was written late at night and may contain typos/mistakes.]

This problem should be familiar:

11 (TST 2010). Determine whether or not there exists a positive integer k such that p = 6k + 1

is a prime and

3k

1 (mod p).

k

While (trying to) solve it, one might make the observation that

3k X

i4k (1 + i)3k (mod p)

k i mod p

(The sum above is the sum as i runs through all of the p distinct residues mod p.)

and also X

0 i2k (1 + i)3k (mod p).

i mod p

12. Show (

X 0 ifa + b < n

iak (1 + i)bk (mod p) = bk

i mod p (a+bn)k

(mod p) ifa + b n.

Why is this in this handout? Well, it has a mod pn generalization, as follows:

13. Let kn = (pn 1)/a, so k1 = k. Show

X

akpn1 bkpn1 bkn

i (1 + i) (mod p) = (mod pn ) ifa + b n.

i mod p

(a + b n)kn p

Where m

n p

should be something defined analogously to (n!)p . (Side note; if you know what

the beta function is, this sort of looks like the integral definition of the beta function.)

(Reality checks you ought to make: Why does it even make sense to consider the left hand side

mod pn , given that i is only defined mod p? Also, you should check that the mod pn results you

are getting for different n are consistent with each other. If you think there is a mistake in this,

send me an e-mail at abmiller@math.princeton.edu. Also I think the a + b n condition may be

unnecessary.)

This should follow from the work of some subset of {Gross-Koblitz, Katz, Dwork} using very

advanced methods. I dont know an olympiad-level proof but am curious if one exists (even one

that only works for special cases).

4

MOP 2011, Black Group Stuff mod pr June 24, 2011

Let f (x) Z[x] be a polynomial of degree at least 3 with distinct roots. Then the equation

y 2 = f (x) has only finitely many solutions in Z. (This is actually a special case of the full Siegels

theorem for integer points on curves, but its a form which is easy to cite and apply accurately.)

However, it certainly can have infinitely many solutions in Q if f has degree 3 or 4. (This is

true by the theory of elliptic curves; doing an explicit example is messy but Id like to see one if

anyone has one.)

- Basic Group TheoryUploaded byHusnain Ali wajid
- phpessentials-130821003448-phpapp02Uploaded byAlbert Ćurković
- HW 6Uploaded bygrondo4
- On the Smarandache Irrationality ConjectureUploaded byMia Amalia
- China Western Mathematical Olympiad 2010 63Uploaded byNitin Jain
- Www.fq.Math.ca Papers 50-3 EulerSadekUploaded byPedro Fernando Fernández Espinosa
- Congruence EquationsUploaded bysameergarg4
- H Aboulfotouh Hieratic Numeral SignsUploaded byhanaaalex
- A note on primes of the form a2 + 1Uploaded byDon Hass
- FinalClass 9Uploaded byKrishnajyoti Das
- Moz the Beginners Guide to SEOUploaded byChinmay Bhushan
- solHW4Uploaded byLelouch V. Britania
- Hanna Neumann Sheet 1 - QuestionsUploaded byNikos Athanasiou
- Suggestion _ MAth3_CSE 4th.Uploaded byLipika Sur
- construct a prime concept and an appreciation of itUploaded byapi-121560518
- Articulo E241de Leonhar EulerUploaded byEduardoSeverson
- A new additive function and the Smarandache divisor product sequencesUploaded byDon Hass
- cosetsUploaded byHaq
- Maths Grade 6 Practice Test 1Uploaded bychoocgh
- Chap01 - 001-016.pdfUploaded byjfarrell_ie5767
- 54604000 Visual Basic ProjectsUploaded byTahir Bakshi
- Souvenirs from the Empire of Numbers, by F. SmarandacheUploaded byAnonymous 0U9j6BLllB
- Lesson 2.3 LoopingUploaded byRonix Ong
- 1-1enUploaded byTradelinkdeal Us
- Diophantine EquationsUploaded byryszard_lubicz
- Mathcounts Mini#33 SolutionsUploaded bywshen1468
- ALG4.0Uploaded byimnomus
- Simplification-APTITUDEUploaded byasoo786
- Group Theory Notes Uniersity of LondonUploaded byzepapi
- EpilogueUploaded byNghia Minh Le

- 2011squad Nt SolnsUploaded byMihnea
- TheoryUploaded byRoderick Gatdula
- number theoryUploaded byjeffrey_uslan
- ZpZ - Alison Miller - MOP 2011.pdfUploaded byMihnea
- ZpZ Teach - Gabriel Carroll - MOP (Black) 2010.pdfUploaded byMihnea
- Fibonacci 1Uploaded byBiswarup Burman
- Gaussian Integers Keith ConradUploaded byMihnea
- ZpZ - Gabriel Carroll - MOP (Black) 2010.pdfUploaded byMihnea
- ZpZ - Joshua Nichols-Barrer - MOP (Black) 2011.pdfUploaded byMihnea
- Vieta Jumping - X - Project PENUploaded byMihnea
- TJUSAMO 2013-2014 Modular ArithmeticUploaded byChanthana Chongchareon
- IdealsUploaded byMihnea
- Vieta JumpingUploaded byPrafulla Dhariwal
- Floor Function - Titu Andreescu, Dorin Andrica - MR 2006.pdfUploaded byMihnea
- 257294318-120044765-Matematica-Pentru-Grupele-de-Performanta-Clasa-a-XI-A.pdfUploaded byMihnea
- Interesting Arguments, Ideas - Victor Wang - XUploaded byMihnea
- Phuong Trinh HamUploaded byNguyen Ha Duc Thinh
- 50 Diophantine Equations Problems With SolutionsUploaded bybvarici
- Generalized Wilson - Yimin Ge - XUploaded byMihnea
- Parvardi, Ben_1220 Number Theory Problems - Third EditionUploaded bymavrogiannis
- Analiza matematicaUploaded bysaaba9
- Analiza 1Uploaded byTincul Eugen
- Concursuri Internationale Vol 1Uploaded byIoana Bonea
- Elemente de Analiza Matematica XI 1995Uploaded byMihnea
- Muirhead - ExcaliburUploaded byMihnea
- Documents.tips Dumitrel Probleme de Analiza Matematica Pentru Clasa Xi 1pdfUploaded byMihnea
- 100 Number Theory ProblemsUploaded bycheetah17
- 250 Problems in Elementary Number Theory, SierpinskiUploaded byMon0id

- Appendix cUploaded byGufran Ahmed
- Chapter_4Uploaded byShiva Nandam
- EPM212 - Chapter 9 Slides GD T HandoutUploaded byJosephRomeralo
- Math Paper 4 2010Uploaded bySami Shoura
- RRB MATH2Uploaded byPrateep Yedla
- Area Important Fact and FormulaUploaded byAnirban Banerjee
- 4MB0_01_que_20120307Uploaded byaisharyn
- Linx Refresh April 2010 Mathematics With Answer Key OKUploaded byCharles Nunez
- Solucionario parte 3 Matemáticas Avanzadas para Ingeniería - 2da Edición - Glyn JamesUploaded byKimberly Clark
- Tomasz Dubejko- Recurrent Random Walks, Liouville's Theorem, and Circle PackingsUploaded byGremnDL
- EMTUploaded byAsgher Khattak
- AR231 عزم القصور_Chap08_MomentofInertia.pptUploaded byAhmed El Morsy
- math history hwUploaded byapi-113620450
- 4 ExercisesUploaded byDk Hardiana
- formative assessment analysis part 1Uploaded byapi-241619704
- 1910154-16MET45 RUploaded bymaxpayne555
- 2.18) Add Math Module 18 (Differentiation)Uploaded byAidil-Nur Zainal
- introduction to DynamicsUploaded byArwa Hussein
- Mathira Matibay 2016Uploaded byJudah Lazaga
- Euclidean and Non Euclidean Geometries Greenberg PDFUploaded byHolly
- IT6501 Notes RejinpaulUploaded bySuraj Kumar
- MathematicsTeachingLearning_11626_7Uploaded byAmi Rah
- A Neighborhood of Infinity_ a Pictorial Proof of the Hairy Ball TheoremUploaded byDan Piponi
- IMO Level-2 Class-7Uploaded byNilesh Gupta
- Chap14_Sec2 partial derivativesUploaded byCravoc001
- Differential CalculusUploaded byPauSomerhalder
- cap10Uploaded byBendis Amm
- chap11 - alpha chiang solucionesUploaded bynecroteck1
- ΑΣΚΗΣΕΙΣ ΜΑΘΗΜΑΤΙΚΩΝ ΑΠΟ ΠΕΡΙΟΔΙΚΟ 2007Uploaded byΘωμαςΣτεφανιδης
- Saharon Shelah and Lutz Strungmann- Cotorsion theories cogenerated by aleph-1 free abelian groupsUploaded bySakoMC