Attribution Non-Commercial (BY-NC)

10 views

Attribution Non-Commercial (BY-NC)

- TI-82 Guidebook
- F5 Maths Annual Scheme of Work_2012
- APL2 Programming - GUIDE
- Chapt 1
- The Report Format for Project
- Informatics C
- Sum 1
- ms_series_math
- Maths-I DIP Sem-I Wef 01082011
- Schelkunoff Theorems for Linear Arrays
- Artigo Em Analise
- Family Contexts as Cognitive Networks
- On the Product of the Square-free Divisor of a Natural Number
- apgp
- class5
- 05-002s
- Rayleigh1892.pdf
- Guia Gauss
- Automatic Face Naming by Learning Discriminative
- Formulario Completo

You are on page 1of 3

5 October 2008

pflueger@stanford.edu

n X n

X n j

1. Compute . Also give a combinatorial explanation for the result you find.

i=0 j=i

j i

2. (Putnam 2006-A4) A deck of n cards, labeled with the numbers 1, 2, . . . , n, is shuffled ran-

domly. Call a card a “local maximum” if its number is greater than the cards above and

below it (the top card need only be greater than the one card below it, and the bottom

card need only be greater than the one above). Find the expected number of local maxima

in the deck.

3. For any square matrix M , the trace tr(M ) is the sum of the entries on the main diagonal

of the matrix. Prove that if A and B are matrices such that AB and BA are well-defined,

then tr(AB) = tr(BA). Note A, B need not be square matrices.

∞

X n

4. Compute n

.

n=1

2

∞

X n2

5. Compute .

n=1

2n

∞

∞ X

X 1

6. Compute .

n=0 m=1

(n + m)2n+m

∞ X

∞

X 1

7. Compute .

n=0 m=0

2m+n 3|m−n|

1024

X

8. (AHSME 1986-25) Compute blog2 nc.

n=1

blog2 1c + blog2 2c + blog2 3c + · · · + blog2 nc = 1994.

10. (AIME 1996-2) For how many integers n with n < 1000 is it true that blog2 nc is a positive

even integer?

11. Each square 25 × 25 grid contains either 1 or −1. Obtain 25 “row products” by multiplying

all entries in a given row. Similarly obtain 25 “column products.” Prove that the sum of

these 50 numbers cannot be a multiple of 4 (in particular, it cannot be 0).

2n 2n 2n 2n

12. Compute 0 + 2 + 4 + ··· + 2n .

3n 3n 3n

13. Compute 0 + 3 + ··· + 3n .

1

14. Let Fn be the nth Fibonacci number (recall that F0 = 1, F1 = 1, and then each term is

the sum of the

two previous terms, giving the sequence 1, 1, 2, 3, 5, 8, 13, . . . ). Compute

F0 n0 + F1 n1 + · · · + Fn nn .

15. Call a number d square-free if 1 is the only perfect square that divides n. Let f (n) be the

100

X

largest square-free number which divides n. Compute f (n).

n=1

∞

√ X 2hni + 2−hni

16. (Putnam 2001-B3) Define hni to be the integer closest to n. Compute .

n=1

2n

1995

1 √ X

17. (AIME 1995-13) Let f (n) be the integer closest to 4

n. Find

. Show also, without

f (k)

k=1

explicitly evaluating the sum, that it is an integer, and give general conditions for this to

hold for partial sums other than the 1995th (hint: 1995 ≡ 1785 mod 7).

Bn = b1 + b2 + · · · + bn . Show the following two (equivalent) statements:

N

X N

X −1

an Bn = AN BN − An bn+1

n=1 n=1

N

X N

X −1

an bn = AN bn − An (bn+1 − bn )

n=1 n=1

19. (Uses Calculus) Show that if f is a differentiable function, its integral can approximate its

sum in the following sense:

N

X Z N Z N

f (n) = f (x)dx + {x}f 0 (x)dx

n=1 0 0

Note here that {x} is the fractional part of x; it can also be written x − bxc.

Rx

20. (Euler-Maclaurin formula; Uses Calculus) Define {{x}} = 0 ({u} − 21 )du. Use partial inte-

gration to derive the following stronger form of the previous problem for twice-differentiable

functions:

N Z N Z N

X 1

f (n) = f (x)dx − {{x}}f 00 (x)dx + (f (N ) − f (0))

n=1 0 0 2

21. (Stirling’s Formula, weak version) Using partial summation, show that

(n − 1)! ≤ nn /en−1 ≤ n!

22. (Stirling’s Formula, stronger version) Using the Euler-Maclaurin formula, derive a more

precise estimate for n!.

2

23. This problems establishes in an elementary manner the fact (used in the lecture) that the

area under the curve y = 1/x between x = a and x = b is equal to ln ab , without appeal to

Calculus.

– Define l(a) to be the area under the curve y = 1/x between x = 1 and x = a. Show

that the area under this curve from x = a to x = ab is equal to the area between

x = 1 and x = b. Conlude from this that l(ab) = l(a) + l(b).

1

– Show that l(e) = 1 (see the previous notation). (Hint: first show n+1 ≤ l(n + 1) −

1 n

l(n) ≤ n . From this conclude that as n becomes large, l((1 + 1/n) ) becomes vanish-

ingly close to 1.

– Conclude from the previous two problems that l(a) = ln a, the logarithm base e of a.

24. (Putnam 1985-B3) For all pairs positive integers (m, n), some positive integer am,n is as-

signed. Suppose this is done is such a way that each positive integer occurs precisely eight

times among all values am,n . Prove that for some m, n, am,n > mn.

25. (Putnam 1993-A3) Define c(m, n) to be the number of functions f mapping subsets of the

set {1, 2, . . . , n} to numbers in {1, 2, . . . , m} with the property that for any two subsets

A, B, f (A ∪ B) = min(f (A), f (B)). Compute c(m, n).

26. Consider a convex polyhedron with V vertices, F faces, and E edges. The edges are col-

ored red and blue. Call two adjacent edges a corner, and call a corner whose edges are

different colors a red-blue corner. Prove that the number of red-blue corners is less than

4V . You will need Euler’s formula, which states that in a convex polyhedron, V +F = E+2.

27. Given two sequences of real numbers a1 , a2 , . . . , an and b1 , b2 , . . . bn , prove that the following

two statements are equivalent.

– For any numbers x1 ≤ x2 ≤ · · · ≤ xn ,

a1 x1 + a2 x2 + · · · + an xn ≤ b1 x1 + b2 x2 + · · · + bn xn .

a1 + a2 + · · · + ak ≥ b1 + b2 + · · · + bk ,

- TI-82 GuidebookUploaded byortanicholas9303
- F5 Maths Annual Scheme of Work_2012Uploaded byJoyce Tay
- APL2 Programming - GUIDEUploaded byakashawalker
- Chapt 1Uploaded bykbarseghyan
- The Report Format for ProjectUploaded byAniket Sharma
- Informatics CUploaded bypatelvivekj7930
- Sum 1Uploaded byAkshay Bondade
- ms_series_mathUploaded bySarath Htaras
- Maths-I DIP Sem-I Wef 01082011Uploaded byHarmish Bhatt
- Schelkunoff Theorems for Linear ArraysUploaded bylautnertaylor
- Artigo Em AnaliseUploaded byAntonio A. Martinez
- Family Contexts as Cognitive NetworksUploaded byTahir
- On the Product of the Square-free Divisor of a Natural NumberUploaded byRyanElias
- apgpUploaded byHansraj Rahul
- class5Uploaded byRakshit Patel
- 05-002sUploaded bymichel_faleiros
- Rayleigh1892.pdfUploaded byMary Tepcal
- Guia GaussUploaded byTurnOff
- Automatic Face Naming by Learning DiscriminativeUploaded byshalini
- Formulario CompletoUploaded byEnnio Antonio
- 6bis MathcadUploaded byBekele Aman
- Algoritmical problemsUploaded byfern163gmailcom
- Bbmp1103- Edward - CopyUploaded byNur Fazalina
- Formula Tutorial1Uploaded byMark Richard Hilbert(Mark Richard Rossetti)
- 7.1 Define and Use Sequences SeriesUploaded bySarthak Joshi
- bscs-2 classes assignment 2.pdfUploaded byAreeba Malik
- 3-s2.0-B9780123943989000241-mainUploaded byKandukuri Karthikeya
- FieldTheory.pdfUploaded byEricleiton sergio
- pre_calc_codification_SHEENA_AND_GAYOUNG (1).docxUploaded byJosemiguel Florian Perdomo
- quant. questions 700-800Uploaded byMatteo Carbone

- Lecture 5 (Theoretical Framework and Hypothesis Development)Uploaded byAdnan Aziz
- Warehouse ChemguardUploaded byWilfredo Nool Madronio
- ujjwalraj anitha@004140004 thick cylinder(1).docxUploaded byUjjwal Raj A
- Handout - Format for Citations, Quotations and ReferencesUploaded byNayeli Gutiérrez Hernández
- Mechanical Engineering Sem1 f4Uploaded byAznan Zakaria
- GBPPR 'Zine - Issue #9Uploaded byGBPPR
- Sap Error CodeUploaded byAshwin Ravi
- Normal Distribution chapter 10Uploaded byAleciafy
- JSS 4210-05-2005Uploaded byKaushik Sengupta
- E1!09!10 Q2 Control M1 Grup2 Alex MurilloUploaded byAle Key
- Testing ATP-EMTP in Power System ProtectionUploaded byAnonymous fbeCwgBFY
- Approaches for Mining Frequent Itemsets and Minimal Association RulesUploaded byGRD Journals
- 1st Order Diff EqUploaded byHasan Ali Ergin
- cogemini sum rept with plates added pdfUploaded byapi-284662150
- System Based Ship Design, Kai LevanderUploaded byAlex IrieBob
- HW_3_CVEN_212_SP2015.pdfUploaded byMazen Khaled
- ppeUploaded byPraveen Choudhary
- Eaton Moeller Xpole Industrial Feeder and Branch Circuit BreakerUploaded bykn65238859
- JBoss jBPM 3.1 Data ModelUploaded bywatcharate wongpratoom
- Tutorial SantuBabaTricksUploaded byArvsrv
- 3905_engl_2012_11 KTAUploaded bykartoon_38
- Badiou Manifesto for PhilosophyUploaded byprotevi
- Oracle Database Migration VerifierUploaded byAnbao Cheng
- ChainAnchor Identities 04172016Uploaded byVikas Sharma
- Physics Lab Report 1Uploaded byRosalina Coleto
- About Vortex Physics and Vortex Losses 2090 8369.1000101(1)Uploaded byAndreescu Anna-Maria Theodora
- datasheet Esp8266exUploaded bySergio Andrade
- 7_GinzelUploaded byMahade Hasan Dipu
- Anagram, Gestalt, Game in Maya Deren: Reconfiguring the Image in Post‐war CinemaUploaded byBeano de Borbujas
- DTM TENSUploaded byElton Dias

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.