Dimension of a Maximum Volume

Similar documents
(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3

EXPERIMENTING WITH MAPLE TO OBTAIN SUMS OF BESSEL SERIES

6.3 Testing Series With Positive Terms

Series III. Chapter Alternating Series

MA131 - Analysis 1. Workbook 9 Series III

Confidence Intervals

YALE UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE

COMPUTING FOURIER SERIES

THE INTEGRAL TEST AND ESTIMATES OF SUMS

MAT1026 Calculus II Basic Convergence Tests for Series

Sequences. Notation. Convergence of a Sequence

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

Sigma notation. 2.1 Introduction

a. How might the Egyptians have expressed the number? What about?

A Note on Bilharz s Example Regarding Nonexistence of Natural Density

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES

Please do NOT write in this box. Multiple Choice. Total

Math 113 Exam 3 Practice

The Higher Derivatives Of The Inverse Tangent Function Revisited

CHAPTER 10 INFINITE SEQUENCES AND SERIES

Equations and Inequalities Involving v p (n!)

Seunghee Ye Ma 8: Week 5 Oct 28

Machine Learning Theory Tübingen University, WS 2016/2017 Lecture 12

1. C only. 3. none of them. 4. B only. 5. B and C. 6. all of them. 7. A and C. 8. A and B correct

ECE534, Spring 2018: Final Exam

The Ratio Test. THEOREM 9.17 Ratio Test Let a n be a series with nonzero terms. 1. a. n converges absolutely if lim. n 1

Round-off Errors and Computer Arithmetic - (1.2)

Math 116 Second Midterm November 13, 2017

MA131 - Analysis 1. Workbook 3 Sequences II

4.1 Sigma Notation and Riemann Sums

Randomized Algorithms I, Spring 2018, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 25, 2018)

Summary: CORRELATION & LINEAR REGRESSION. GC. Students are advised to refer to lecture notes for the GC operations to obtain scatter diagram.

tests 17.1 Simple versus compound

Integrable Functions. { f n } is called a determining sequence for f. If f is integrable with respect to, then f d does exist as a finite real number

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.

SNAP Centre Workshop. Basic Algebraic Manipulation

CONSTRUCTING TRUNCATED IRRATIONAL NUMBERS AND DETERMINING THEIR NEIGHBORING PRIMES

Special Modeling Techniques

Proposition 2.1. There are an infinite number of primes of the form p = 4n 1. Proof. Suppose there are only a finite number of such primes, say

Lecture Notes Trigonometric Limits page 1

Solutions to Problem Sheet 1

Weil Conjecture I. Yichao Tian. Morningside Center of Mathematics, AMSS, CAS

Read carefully the instructions on the answer book and make sure that the particulars required are entered on each answer book.

Linear Regression Demystified

Math 155 (Lecture 3)

Mini Lecture 10.1 Radical Expressions and Functions. 81x d. x 4x 4

Alternating Series. 1 n 0 2 n n THEOREM 9.14 Alternating Series Test Let a n > 0. The alternating series. 1 n a n.

1 Lecture 2: Sequence, Series and power series (8/14/2012)

Carleton College, Winter 2017 Math 121, Practice Final Prof. Jones. Note: the exam will have a section of true-false questions, like the one below.

MA131 - Analysis 1. Workbook 10 Series IV

INFINITE SEQUENCES AND SERIES

TR/46 OCTOBER THE ZEROS OF PARTIAL SUMS OF A MACLAURIN EXPANSION A. TALBOT

USA Mathematical Talent Search Round 3 Solutions Year 27 Academic Year

Series: Infinite Sums

10.2 Infinite Series Contemporary Calculus 1

Math 312 Lecture Notes One Dimensional Maps

18.440, March 9, Stirling s formula

MATH301 Real Analysis (2008 Fall) Tutorial Note #7. k=1 f k (x) converges pointwise to S(x) on E if and

AP Calculus AB 2006 Scoring Guidelines Form B

Perfect Numbers 6 = Another example of a perfect number is 28; and we have 28 =

REGRESSION WITH QUADRATIC LOSS

Infinite Sequences and Series

Recurrence Relations

AAEC/ECON 5126 FINAL EXAM: SOLUTIONS

Math 143 Review for Quiz 14 page 1

4.1 SIGMA NOTATION AND RIEMANN SUMS

Chapter 4. Fourier Series

MATH 112: HOMEWORK 6 SOLUTIONS. Problem 1: Rudin, Chapter 3, Problem s k < s k < 2 + s k+1

Math 2784 (or 2794W) University of Connecticut

4x 2. (n+1) x 3 n+1. = lim. 4x 2 n+1 n3 n. n 4x 2 = lim = 3

Math 113 Exam 3 Practice

4.3 Growth Rates of Solutions to Recurrences

Distribution of Sample Proportions

Disjoint set (Union-Find)

Stochastic Matrices in a Finite Field

1 Approximating Integrals using Taylor Polynomials

Ma 530 Infinite Series I

Feedback in Iterative Algorithms

Chapter 8: Estimating with Confidence

Regression with quadratic loss

We will conclude the chapter with the study a few methods and techniques which are useful

3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,

Math 113 Exam 4 Practice

ON SUPERSINGULAR ELLIPTIC CURVES AND HYPERGEOMETRIC FUNCTIONS

[ 47 ] then T ( m ) is true for all n a. 2. The greatest integer function : [ ] is defined by selling [ x]

2 Scalable algorithms, Scheduling, and a glance at All Prefix Sum

Nuclear Physics Worksheet

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018

NICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) =

New Definition of Density on Knapsack Cryptosystems

MA131 - Analysis 1. Workbook 2 Sequences I

CSI 2101 Discrete Structures Winter Homework Assignment #4 (100 points, weight 5%) Due: Thursday, April 5, at 1:00pm (in lecture)

( ) = is larger than. the variance of X V

Fall 2018 Exam 2 PIN: 17 INSTRUCTIONS

Sequences I. Chapter Introduction

MTH 142 Exam 3 Spr 2011 Practice Problem Solutions 1

Machine Learning Theory Tübingen University, WS 2016/2017 Lecture 11

Sect 5.3 Proportions

1 Generating functions for balls in boxes

Transcription:

Dimesio of a Maximum Volume Robert Kreczer Deartmet of Mathematics ad Comutig Uiversity of Wiscosi-Steves Poit Steves Poit, WI 54481 Phoe: (715) 346-3754 Email: rkrecze@uwsmail.uws.edu 1. INTRODUCTION. With mathematical comuter rograms becomig every day more owerful ad friedlier, we observe their growig ifluece o the teachig-learig rocess i the Mathematics. However, the adatatio of these techologies will a have ositive imact o educatio i Mathematics oly if we able to fid ew roblems whose level of difficulty ad origiality is aroriate to the sohisticated level of reset-day software used by the studets. While solvig such roblems, with the aid of comuters, we must ay a lot of attetio to how the studets utilize the emirical data obtaied from a comuter to suort their reasoig. I this rocess we should emhasize a critical attitude towards these results, ad thus itroduce the studets to idea of roof as a livig ad imortat art of the etire rocess ivolved i solvig roblems. I this article we will reset a examle of such a roblem, which is iterestig cotiuatio of the article [ 1] reseted at the last ICTCM. Let us deote by vol(b ) the volume of the uit ball i determied by the l orm, 1. More recisely, the - dimesioal measure of the set I [ 1] we showed that 1 1 B œ {(x,...,x ) : kx k...+ kx k Ÿ 1}. 2 1 ( ) : œ Š > > ( 1) vol(b ). (1.1) By usig Mathematica, we ca very easily sketch the grahs of vol(b ) for few fixed values of. I Figure 1, we show the Mathematica outut for œ 2, 3 ad 6.

Figure 1. The grahs of vol vs., with œ 1,2, ad 6. We observe that all these grahs have oe hum, which gets higher ad moves towards right as icreases. This aloe causes some roblems whe we try to sketch these grahs, because we must at the begiig assig large eough value for, for each searately, so that we ca see the hole hum. Secodly, there might be more tha oe hum, but they are simly ot dislayed by these grahs. Keeig this dilemma i our mid, we will roose the followig roblem: Fid / œ / (), /, such that volume of uit balls B attais its maximum, that is, for fixed 1, / œ / () is such a umber that /() vol(b ) Ÿ vol(b ), for all. Oe of the ossible aroach to solve this roblem would be to aly usual Calculus techiques, the derivatives, but ufortuately this aroach will ot work here. First, either the comutatio of derivative Dvol(B ) is ossible to carry out for most studets, or is its form obtaied from the Mathematica leasat. Secod, tryig to solve equatio Dvol(B ) œ 0, or eve aroximate its solutio, is harder ad messier yet. Third, the solutio of this equatio would be a real umber oly aroximatig /(). Therefore, we must abado this idea ad devise a ew aroach. 2. SHOWING THAT THERE IS ONLY ONE HUMP. Istead of aalyzig the derivative, we will cosider quotiet q() give by q(), œ vol(b ) vol(b -1) which remids us little bit of the formula for derivative. With the formula (1.1), ad the followig basic formulas for Beta (B) ad Gamma ( > ) fuctios:

_!-1 -x (i) >! ( ) œ ' x e dx. (iii) > (x 1) œ x > (x). 0 _ (ii) B(!", ) œ '!-1 "-1 >! ( ) >" ( ) x (1 x) dx. (iv) B(!", ) œ. 0 >! ( ") we will get that 2 q() œ ' 1 (1 x) x dx. (2.1) 0 1 1 Formula (2.1) ca also be verified by the Mathematica. Sice it is easy to observe that 1 1 1 1 (1-x) x Ÿ (1 1 x) x, for 0 Ÿ x Ÿ 1, we coclude that q( 1) q(), that is, the sequece q() is decreasig. By aalogy to the derivative, we may imagie that the grah of vol(b ), as a discrete set of oits, lies o the cocave dow curve. I additio, q(0) œ 2, ad sice the itegrad i (2.1) is less tha 1, by alyig Lebesgue's Theorem, we obtai that q() aroaches 0 as aroaches ositive ifiity. From these facts, therefore, we coclude that the fuctio vol(b ) ca have oly oe relative maximum, ad this relative maximum must be its absolute maximum at the same time. 3. Let Mathematica Fid /(). Sice we are ow cofidet that the first largest ecoutered umber o the list 1 2 {vol(b ), vol(b ),...,vol(b ),...} (3.1) is ideed the absolute maximum, we ca determie its ositio, for few chose values of, by emloyig the Mathematica to do it. For this comutatio we use little rogram show i Figure 2, ad the results of that comutatios were laced i the first colum of Table 1. As we try to comute /(), with this rogram, we discover quickly its two flaws. We must be able to set at frot a umber k, where k is ay

Figure 2. Mathematica's comutatio of /(1),...,v(10) Table 1.

umber greater tha /(). If k is smaller tha /(), list (3.1) is too short, it will ot iclude its absolute maximum, ad the obtaied outut will ot be correct. I oosed, if k is too large, the comutig time take by the Mathematica will become too large. As a matter of fact, with the values of k estimated from the grahs of vol(b ), the comutatio of /(), already for ž 10, becomes too log to be useful i ractice. 4. SO WHAT /() IS LIKE? Lookig at Table 1, first colum, we ca oly observe that /() becomes raidly large. I order to comrehed better these large umbers, we sketch the grah of l( /()) vs., usig data from Table 1. Figure 3. Grah of l( /()) Surrisigly, the oits lie almost o a straight lie, ad this idicates almost exoetial growth of /(). However, our observatio about /(), though imressive, is oly a qualitative statemet about /(), ad it still does ot solve our roblem to fid a exact formula for /(). Sice we do ot kow how to a achieve this goal, we will settle for less, for the time beig - we will try to aroximate /(). The mai idea, to fid a reasoable aroximatio of /(), is to select a coveiet subsequece form sequece vol(b ), ad cosider the maximum of this subsequece to be a aroximatio of /(). We decided, for the urose of simlicity, to select the subsequece r() œ vol(b ), whose formula, by usig (1.1), will become 8 x 1 vol(b ) œ, where x œ 2 > ( 1).!

8 Sice subsequece r() is the every th term of the sequece vol(b :) ad the grah of 8 vol(b :) is of the oe hum shae, the maximum term of the subsequece r() lies withi 8 terms to the left or to the right of the maximum term of vol(b :). Further, the th term i the subsequece r() is the ( )th term i the sequece vol(b ), so a idex of the maximum term of the subsequece r() multilied by should aroximate the maximum term of the sequece vol(b ), /(), with the error boud. O the other had, we ca easily determie the idex of the maximum term of r(), by realizig that the maximum of 8 x x x x! 1 2 r() œ œ... x occurs for the largest such that 1, that is x, that is, x, where x deotes Ÿ Ÿ œ g h g h the floor of x. Thus, we obtaied that : : 1 /() gxh œ ª 2 > (1 )«. (4.1) Now we would like to comare the accuracy of the aroximatio i (4.1). We already kow that the absolute error should be less tha. I Table 1 this error is dislayed i the third colum. I the forth colum, we comuted /() modulo. The umbers i these two colums are the same excet their sig. Accidetally, we discover that /() œ ª 1 2 > (1 )«mod (/()). (4.2) Obviously, the imressive formula (4.2) was discovered exerimetally, ad the the formal roof or disroof of it is still required. However, this seems to be oe roblem, left to a reader as a challege to tackle. REFERENCES 1. T.M. Aostol, Calculus,Volume 2, secod editio, Wiley 19692 2. W. Rudi, Real ad Comlex Aalysis, secod editio, McGraw Hill, 1974. 3. S. Saks ad A. Zygmut, Aalytic Fuctios, secod editio elarged, Pastwowe Wydawictwo Naukowe, 1965. 4. G. Schechtma ad M. Schmuckeschlager, Aother Remark O The Volume Of The Itersectio of Two L Balls, Lectures I Mathematics, Sriger Verlag, #1464, 1994, 174 178. 5. G. Smith ad M.K. Vamaamurthy, How Small Is A Uit Ball?, Mathematics Magazie, 62, 1988, 101 107.