Computing π with Bouncing Balls

Similar documents
n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0

Quantum Mechanics I - Session 4

Salmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2

C/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1

NOTES ON SIMPLIFICATION OF MATRICES

Stanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011

2.3 Nilpotent endomorphisms

= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system.

Difference Equations

Ballot Paths Avoiding Depth Zero Patterns

APPENDIX A Some Linear Algebra

U.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS

Quantum Mechanics for Scientists and Engineers. David Miller

Math 217 Fall 2013 Homework 2 Solutions

This model contains two bonds per unit cell (one along the x-direction and the other along y). So we can rewrite the Hamiltonian as:

A property of the elementary symmetric functions

332600_08_1.qxp 4/17/08 11:29 AM Page 481

A FORMULA FOR COMPUTING INTEGER POWERS FOR ONE TYPE OF TRIDIAGONAL MATRIX

General viscosity iterative method for a sequence of quasi-nonexpansive mappings

MATH Sensitivity of Eigenvalue Problems

Lecture 20: Lift and Project, SDP Duality. Today we will study the Lift and Project method. Then we will prove the SDP duality theorem.

Spectral Graph Theory and its Applications September 16, Lecture 5

9 Characteristic classes

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE

Homework Notes Week 7

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS

CHAPTER III Neural Networks as Associative Memory

Restricted Lie Algebras. Jared Warner

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system

Norms, Condition Numbers, Eigenvalues and Eigenvectors

1 Matrix representations of canonical matrices

Section 8.3 Polar Form of Complex Numbers

ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM

A New Refinement of Jacobi Method for Solution of Linear System Equations AX=b

U.C. Berkeley CS294: Beyond Worst-Case Analysis Handout 6 Luca Trevisan September 12, 2017

Some Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS)

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal

HMMT February 2016 February 20, 2016

SL n (F ) Equals its Own Derived Group

Supplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso

18.781: Solution to Practice Questions for Final Exam

PRIMES 2015 reading project: Problem set #3

On the symmetric character of the thermal conductivity tensor

FINITELY-GENERATED MODULES OVER A PRINCIPAL IDEAL DOMAIN

ψ = i c i u i c i a i b i u i = i b 0 0 b 0 0

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

Physics for Scientists and Engineers. Chapter 9 Impulse and Momentum

Lecture 21: Numerical methods for pricing American type derivatives

Foundations of Arithmetic

Bernoulli Numbers and Polynomials

COS 521: Advanced Algorithms Game Theory and Linear Programming

On Finite Rank Perturbation of Diagonalizable Operators

arxiv: v2 [math.ca] 24 Sep 2010

Errata to Invariant Theory with Applications January 28, 2017

The Second Eigenvalue of Planar Graphs

Solutions Homework 4 March 5, 2018

1 (1 + ( )) = 1 8 ( ) = (c) Carrying out the Taylor expansion, in this case, the series truncates at second order:

Randić Energy and Randić Estrada Index of a Graph

Perron Vectors of an Irreducible Nonnegative Interval Matrix

LECTURE 9 CANONICAL CORRELATION ANALYSIS

1 Generating functions, continued

Spin-rotation coupling of the angularly accelerated rigid body

THE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens

1 Derivation of Point-to-Plane Minimization

Singular Value Decomposition: Theory and Applications

5 The Rational Canonical Form

Bezier curves. Michael S. Floater. August 25, These notes provide an introduction to Bezier curves. i=0

10. Canonical Transformations Michael Fowler

Fall 2012 Analysis of Experimental Measurements B. Eisenstein/rev. S. Errede

Remarks on the Properties of a Quasi-Fibonacci-like Polynomial Sequence

Implicit Integration Henyey Method

5.76 Lecture #21 2/28/94 Page 1. Lecture #21: Rotation of Polyatomic Molecules I

Section 3.6 Complex Zeros

Lecture 12: Discrete Laplacian

Physics 207: Lecture 20. Today s Agenda Homework for Monday

Modelli Clamfim Equazioni differenziali 7 ottobre 2013

2 More examples with details

Lecture 5 September 17, 2015

From Biot-Savart Law to Divergence of B (1)

BOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS

Introduction to Algorithms

COMPLEX NUMBERS AND QUADRATIC EQUATIONS

Common loop optimizations. Example to improve locality. Why Dependence Analysis. Data Dependence in Loops. Goal is to find best schedule:

Determinants Containing Powers of Generalized Fibonacci Numbers

Markov chains. Definition of a CTMC: [2, page 381] is a continuous time, discrete value random process such that for an infinitesimal

Entropy of Markov Information Sources and Capacity of Discrete Input Constrained Channels (from Immink, Coding Techniques for Digital Recorders)

Lecture Note 3. Eshelby s Inclusion II

The Feynman path integral

Representation theory and quantum mechanics tutorial Representation theory and quantum conservation laws

Physics 5153 Classical Mechanics. Principle of Virtual Work-1

Bézier curves. Michael S. Floater. September 10, These notes provide an introduction to Bézier curves. i=0

Calculus of Variations Basics

Convexity preserving interpolation by splines of arbitrary degree

Lecture 6/7 (February 10/12, 2014) DIRAC EQUATION. The non-relativistic Schrödinger equation was obtained by noting that the Hamiltonian 2

Study Guide For Exam Two

Matrix Approximation via Sampling, Subspace Embedding. 1 Solving Linear Systems Using SVD

Complex Numbers Alpha, Round 1 Test #123

e - c o m p a n i o n

Transcription:

by Let the mass of two balls be M and m, where M = (6 n )m for n N. The larger ball s rolled towards the lghter ball, whch ear a wall and ntally at rest. Fnd the number of collsons between the two balls untl the larger ball begns to move n the drecton opposte to ts ntal velocty. Assume all collsons are perfectly elastc.

Our Soluton Ths problem, unsurprsngly, begns wth conservaton of momentum and, due to the elastc nature of the collsons, conservaton of energy. In defnng we have x m M, () u n x = u n+ + x+ () u n + xs n = u n+ + xs n+, (3) where u n and are the velocty of the large and small ball, respectvely, after the nth collson. Do due the lnearty of momentum, we guess a lnear soluton of the form: u n+ = αu n + β + = γu n + δ, = un+ + α β un =, (4) γ δ where all α, β, γ, δ R are are constant. Substtutng (4) nto the momentum and energy expressons () and (3), respectvely, we have u n x = u n (α + xγ) + (β + xδ) u n + xs n = u n(α + xγ ) + u n (αβ + γδx) + s n(β + xδ ). By matchng coeffcents wth the constants wthn each expresson, we establsh the system: α + xγ = α + xγ = αβ + γδx = β + xδ = x β + xδ = x From here, we wsh to derve non-trval solutons for the constants α, β, γ, and δ, whch we clam are nonzero and n terms of x. Applyng ths restrcton and trudgng through the algebra, one obtans the unque soluton α = x + x, β = x + x, γ = + x, and δ = x + x..

These mply the transformaton matrx Λ = x +x +x x +x x +x, makng the recurrence n (4) become or more succnctly where un+ + = x +x +x x +x x +x v n+ = Λ v n, v n = un. un, (5) We now acknowledge that (5), though correct n applcaton, ot helpful n ts present form. We are certan that wth n = (essentally at t = ), v = Λ v as ths s the frst collson and so only one transformaton of Λ ecessary. Though for the next collson, Λ s surrepttously appled twce: v = Λ v = v = Λ(Λ v ) = Λ v. And ths s true n general: v n+ = Λ n+ v, promptng a more useful expresson of (5) to be un+ + = x +x +x x +x u n+ x s +x. (6) Ths expresson s ndcatve that the matrx Λ s lkely dagonalzable, meanng there may exst matrces D and P such that Λ = P DP λ, where D = and P = z λ z λ, λ where each z λ s a column and egenvector for the egenvalue λ of Λ. Notce, then, that f Λ s dagonalzable, Λ n+ = (P DP )(P DP ) (P DP ) = P D n+ P, (7) }{{} n+ factors 3

whch vastly smplfes the computaton. To proceed, we frst fnd the egenvalues and egenvectors of Λ. Settng cos θ = x + x = x = cos θ + cos θ, t follows from both the functonal expresson det(λ λi ) =, where I s the dentty matrx, and Euler s equaton e θ = cos θ + sn θ that λ = e ±θ = λ = e θ and λ = e θ. To compute the egenvectors z λ and z λ, we revert back to Λ n terms of x. Ths prompts the egenvectors x x z λ = and z λ =. Because the egenvalues of Λ are dstnct and the above egenvectors are lnearly ndependent, Λ s dagonalzable, thereby establshng the matrces P = x and P = x n the dagonalzaton of Λ. Furthermore, we have e θ e D = = D n+ (n+)θ =, e θ e (n+)θ makng Λ n+ = x e (n+)θ e (n+)θ by the logc n (7). Though t may seem abrupt, t s convenent for computatonal sake to now defne p as the number of collsons that occur untl the velocty vector of the larger ball egatve. Now, multplyng the above matrx expresson wth p a + and through rearrangements of Euler s equaton, we obtan Λ p = cos(θp) sn(θp) x sn(θp). cos(θp) For sake of brevty (and to not underwhelm the result of ths problem), we have excluded a majorty of the ntermedate algebra. 4

By (6), we have up s p = cos(θp) sn(θp) x sn(θp) u cos(θp) s As specfed n the problem statement, s = ; hence the matrx-vector product above becomes up s p = cos(θp), sn(θp) whch mples u p = cos(θp). By the way n whch we ve defned p (the number of collsons before the drecton of the velocty vector of the larger ball s reversed), t follows that cos(θp) and cos(θ(p+)) <, whch formulates the compound nequaltes cos(θp) > cos(θ(p + )) = θp π < θ(p + ), (8) because the cosne functon changes sgn at π. We are now nearly there. Recallng the defnton cos θ = x + x, t follows from the Taylor polynomals cos θ = n= ( ) n θ n (n)! that, to a second-order approxmaton n θ, and x + x = + ( ) n x n n= θ x = θ. By the defnton for x n () and the value of x n the problem statement, we have that θ n. Hence, substtutng nto (8), we obtan the nequalty p n π < p +. A compound nequalty of ths form s the defnton of the floor functon beng operated on p. Consequently, t follows that p = n π, suggestng that the number of collsons p that occur untl the larger ball commences to retreat s the nteger formed by the frst n + dgts of π. Qute spectacular! 5