The Blood Testing Problem

Size: px
Start display at page:

Download "The Blood Testing Problem"

Transcription

1 Teachig Cotemorary Mathematics Coferece Feb 6-7, 00 The Blood Testig Problem Suose that you have a large oulatio that you wish to test for a certai characteristic i their blood or urie (for examle, testig all CAA athletes for steroid use or all US military ersoel for a articular disease) Each test will be either ositive or egative Sice the umber of idividuals to be tested is quite large, we ca exect that the cost of testig will also be large How ca we reduce the umber of tests eeded ad thereby reduce the costs? If the urie could be ooled by uttig a ortio of, say, 0 samles together ad the testig the ooled samle, the umber of tests might be reduced If the ooled samle is egative, the all the idividuals i the ool are egative, ad we have checed 0 eole with oe test If, however, the ooled samle is ositive, we ow oly that at least oe of the idividuals i the samle will test ositive Each member of the samle must the be retested idividually ad a total of tests will be ecessary to do the job The larger the grou size, the more we ca elimiate with oe test, but the more liely the grou is to test ositive Would oolig 5 secime be better tha oolig 0? What is the relatioshi betwee the robability of a idividual testig ositive ad the grou size that miimizes the total umber of tests required? Certaily, we aticiate that the larger the robability of a idividual testig ositive the smaller the grou size, while the smaller the robability, the larger the grou size required Problem Statemet You have a large oulatio () that you wish to test for a certai characteristic i their blood Each test will be either ositive or egative Sice the umber of idividuals to be tested is quite large, you wish to reduce the umber of tests eeded to scree everyoe ad thereby reduce the costs If the blood could be ooled by uttig samles together ad the testig the ooled samle, the umber of tests required might be reduced What is the relatioshi betwee the robability of a idividual testig ositive () ad the grou size () that miimizes the total umber of tests required? Use your solutio to determie the umber of tests required to fid 00 idividuals who will test ositive i a oulatio of,000,000 The Basic Model A essetial asect to develoig ay model is to cosider the simlest case that embodies the essece of the roblem For the grou testig roblem, this is a solutio that uses oly oe grou test, ad the tests everyoe remaiig idividually If the studets caot solve this roblem, they will ot be able to solve a more ivolved model that is erhas more realistic Further, the solutio to the simlest situatio ofte is helful i arrivig at a more geeral solutio What follows is the aroach tae by most studet grous Sice there are eole to be tested i grous of size, the iitial umber of tests eeded to test these grou is The robability of testig ositive is, so we exect that eole will test ositive With the worst case assumtio that exactly oe erso i each grou will test ositive, this meas that of the grous will test ositive, ad eole remai to be tested The umber of tests eeded for this testig rotocol is give by Daiel J Teague C School of Sciece & Mathematics

2 Teachig Cotemorary Mathematics Coferece Feb 6-7, 00 T( ) = + I the worst case, if ay grou tests ositive, all members of the grou will test ositive So the umber of tests eeded to test usig oe grou test ad the testig everyoe remaiig idividually is T = + = + Sice the factor roduces a vertical stretch i the grah of T, the value of that miimizes the umber of tests will ot be affected by, so we set = for coveiece For a give value of, we ca determie the grou size which miimizes the umber of tests, ad therefore the costs, by usig a grahig calculator to zoom ad trace For, examle, if = 00, we ca fid the miimum value o the grah of T = + ( 00) as show i Figure below Figure : rahs of T = + for = 05 ad = 00 Reeatig the rocess for differet values of, we geerate the table below: By usig techiques of data aalysis o the scatterlot for this data, we ca create a model relatig the best grou size to the robability Figure : Scatterlot of Best rou Size vs Probability Figure : Log-log Re-exressio to Liearize Data Daiel J Teague C School of Sciece & Mathematics

3 Teachig Cotemorary Mathematics Coferece Feb 6-7, 00 By re-exressig the data with a log-log lot, we liearize the data The least-squares equatio is l ( ) = l ( ), so = If =, the total umber of tests eeded is T = + = + = I our examle, 00 idividuals testig ositive ca be foud i a oulatio of oe millio eole i aroximately 0,000 tests Further, if, the, ad it is couterroductive to test i grous Refiig ad Imrovig the Model Of course, there is o reaso to re-test everyoe idividually Sice is ideedet of, we could retest all of the remaiig after the first grou test i similar grous We already ow that = However, sice we have already elimiated a large umber of eole i the first hase of testig, the value of will be much larger for the secod grou test There are eole that we exect to test ositive ad eole remaiig to be retested The robability of testig ositive i the secod roud is = = So the ext test should be doe with = = Cotiuig i this fashio, we fid the grou sizes to be First rouig ew Probability Secod rouig ew Probability Third rouig 8 ew Probability 8 th rouig ew Probability Sto grouig whe the ew robability is greater tha 05 Whe do you sto grouig ad test everyoe idividually? We wat to ow for what l( ) is Solvig for, we fid that = l l() l() The iterated model just created wors quite well, reducig the umber of tests dramatically, eve though i ractice we violate the assumtio uo which the solutio was based I the examle of fidig 00 ositive idividuals i a oulatio of,000,000, testig i grous of 00, 0, ad, ad the idividually requires oly,6 tests However, this is clearly ot a otimal solutio I creatig the model, we assumed that we would grou oly Daiel J Teague C School of Sciece & Mathematics

4 Teachig Cotemorary Mathematics Coferece Feb 6-7, 00 oce ad the retest idividually The grou size = was determied o the basis of that assumtio Is it ossible to determie the umber of tests eeded by taig the additioal grou tests ito accout? A secod model exteds this iitial solutio The model just created wors well, reducig the umber of tests dramatically I the examle of fidig 00 ositive idividuals i a oulatio of,000,000, testig i grous of 00, 0, ad, ad the idividually requires oly,6 tests Roud of Testig umber to Test,000,000 0,000, rou Size 00 0 umber of Tests 0,000, umber to Retest 00(00) 00(0) 00() 0 Calculus Solutio: This is a straight-forward calculus roblem for first semester studets We have the same model T = + To determie the best grou size, we differetiate with resect to dt = +, d ad fid the value of that maes this derivative zero If dt = 0, the = The rest of the roblem roceeds as before, ad we fid that,6 d tests are eeded to fid 00 out of,000,000 This is a large reductio, but we ca do eve better! The Multile rou, Iterated Model As with the iitial solutio, the startig oit is with the simlest model that cotais the essece of the roblem I this case, it is a model that allows for two grou tests ad the testig everyoe remaiig idividually So, T = + + P It seems that T is a fuctio of two variables, ad, which is beyod the scoe of a itroductory course i calculus Is ossible to rewrite this as a sigle variable roblem? A few hits are geerally i order at this oit With some ecouragemet, studets will realize that they ow the solutio to the last art of the roblem, the roblem of miimizig the umber of tests with oe test ad the testig everyoe remaiig idividually Recall that this grou size was ideedet of the umber beig tested So, i fact, Daiel J Teague C School of Sciece & Mathematics

5 Teachig Cotemorary Mathematics Coferece Feb 6-7, 00 we ow =, where is the robability of testig ositive after the first test But is just the exected umber testig ositive divided by the total umber i the reset oulatio So = = Substitutig, we ow that = The total umber of tests ca ow be writte as a fuctio of the sigle variable T( ) = + The dt = + / d ad elemetary calculus shows that the otimum value for is / If two grouigs are used, the sizes of the grous should be / ad / Extedig the grouig to three cotiues the atter If we ow that = ( ) / ad ( ) / Rewritig, we fid that T = P, / =, with = So = / ( ) = + T ad / = Agai, elemetary calculus shows that the otimum grou sizes are /, /, ad / Reeatig the aalysis with four grous geerates the otimum grou sizes 5 / 5, / 5, / 5, ad / I geeral, if a total of grouigs are used, the grou sizes are give by = ( ) + + +, + + with the th grou of size o grou of studets has yet verified this geeralized grouig, but they lace their faith i the atter geerated from usig,,,, ad 5 grous Provig the geeral case seems beyod their reset abilities Based o the clear atter develoed by iitial secific cases, studets argue the total umber of tests required with grouigs is Daiel J Teague 5 C School of Sciece & Mathematics

6 Teachig Cotemorary Mathematics Coferece Feb 6-7, 00 T / = + What umber of grouigs is otimum for a give iitial robability? If we cosider T as a fuctio of, we fid that Differetiatig, we fid that + T ( ) = ( + ) dt l( ) + = + d + The otimal umber of grouigs is = l( ) Recall that we are igorig ay o-iteger asects of the roblem The total umber of tests required is give by ( l( )) T = e If = 0 000, this is a reductio by a factor of 00 If 00 out of,000,000 had the sought for characteristic, they could be foud i aroud,500 tests Fidig the Otimal rou Size With this value of, we ca also determie the otimum size of the th grou We ow that ( ) +, with = l( ), so the th grou should size should be l( ) l( ) While most grous leave their exressio for the th grou size i this form, be simlified l( ) l( ) l ( ) l( ) l( ) l If, the l ( ) = l ( ) ad l = l( ) l = l or So ( ) ( ) l( ) l( ) ca = e Studets are always surrised to see e show u i the solutio Of course, while this theoretical result is leasig, it may ot be realizable, for = may be too may secime to hadle e i a sigle grou This roblem offers may imortat teachig oits both about mathematical modelig ad about calculus The roblem of imrovig the iitial solutio by violatig the assumtios Daiel J Teague 6 C School of Sciece & Mathematics

7 Teachig Cotemorary Mathematics Coferece Feb 6-7, 00 creates a iterestig discussio about mathematical theory ad ractice, ad the imortace of a good aroximate solutio over a ideal urealizable oe The imortace of iteratig the model ad refiig the solutio based o rior wor is clear ad covicig i this settig o studets have foud the more sohisticated multile grou solutio without first worig through the sigle grou solutio ad beig dissatisfied with it Also, the imortace of cosiderig "what questio does this ew solutio as?" is see i several laces We obtai a solutio, ad immediately use it to further the roblem First, we cosider T as a fuctio of, the as a fuctio of The coversatios surroudig the solutio ad i the rocess of solvig this roblem ecourage essetial asects of modelig Fial ote The Precalculus modelig techique will also wor o the average case sceario I this situatio, the total umber of tests is the sum of the iitial umber of tests ad all the retests ( ( ) ), so the model is ( ) ( ( ) ) ( ) T = + = + You may wat to verify that calculus is absolutely o hel here! However, we ca create a table for ad best as before ad fit a model to the data The result is = + REFERECES Dilwy Edwards ad Mie Hamso, uide of Mathematical Modelig, CRC Mathematical uides, CRC Press, Boca Rato, Florida, 989, William Feller, A Itroductio to Probability Theory ad Its Alicatios, Vol, rd Ed Joh Wiley ad Sos, Ic, ew Yor, 968, 5 Paul L Meyer, Itroductory Probability ad Statistical Alicatios, d Ed, Addiso-Wesley Publishig Co, Readig, Massachusetts, 970, - Daiel J Teague 7 C School of Sciece & Mathematics

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

a. How might the Egyptians have expressed the number? What about? A-APR Egytia Fractios II Aligmets to Cotet Stadards: A-APR.D.6 Task Aciet Egytias used uit fractios, such as ad, to rereset all other fractios. For examle, they might exress the umber as +. The Egytias

More information

COMPUTING FOURIER SERIES

COMPUTING FOURIER SERIES COMPUTING FOURIER SERIES Overview We have see i revious otes how we ca use the fact that si ad cos rereset comlete orthogoal fuctios over the iterval [-,] to allow us to determie the coefficiets of a Fourier

More information

Confidence Intervals

Confidence Intervals Cofidece Itervals Berli Che Deartmet of Comuter Sciece & Iformatio Egieerig Natioal Taiwa Normal Uiversity Referece: 1. W. Navidi. Statistics for Egieerig ad Scietists. Chater 5 & Teachig Material Itroductio

More information

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

( ) = is larger than. the variance of X V Stat 400, sectio 6. Methods of Poit Estimatio otes by Tim Pilachoski A oit estimate of a arameter is a sigle umber that ca be regarded as a sesible value for The selected statistic is called the oit estimator

More information

Confidence intervals for proportions

Confidence intervals for proportions Cofidece itervals for roortios Studet Activity 7 8 9 0 2 TI-Nsire Ivestigatio Studet 60 mi Itroductio From revious activity This activity assumes kowledge of the material covered i the activity Distributio

More information

EXPERIMENTING WITH MAPLE TO OBTAIN SUMS OF BESSEL SERIES

EXPERIMENTING WITH MAPLE TO OBTAIN SUMS OF BESSEL SERIES EXPERIMENTING WITH MAPLE TO OBTAIN SUMS OF BESSEL SERIES Walter R Bloom Murdoch Uiversity Perth, Wester Australia Email: bloom@murdoch.edu.au Abstract I the study of ulse-width modulatio withi electrical

More information

Chapter 4. Fourier Series

Chapter 4. Fourier Series Chapter 4. Fourier Series At this poit we are ready to ow cosider the caoical equatios. Cosider, for eample the heat equatio u t = u, < (4.) subject to u(, ) = si, u(, t) = u(, t) =. (4.) Here,

More information

6.3 Testing Series With Positive Terms

6.3 Testing Series With Positive Terms 6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial

More information

BIOSTATISTICAL METHODS FOR TRANSLATIONAL & CLINICAL RESEARCH

BIOSTATISTICAL METHODS FOR TRANSLATIONAL & CLINICAL RESEARCH BIOSAISICAL MEHODS FOR RANSLAIONAL & CLINICAL RESEARCH Direct Bioassays: REGRESSION APPLICAIONS COMPONENS OF A BIOASSAY he subject is usually a aimal, a huma tissue, or a bacteria culture, he aget is usually

More information

Nuclear Physics Worksheet

Nuclear Physics Worksheet Nuclear Physics Worksheet The ucleus [lural: uclei] is the core of the atom ad is comosed of articles called ucleos, of which there are two tyes: rotos (ositively charged); the umber of rotos i a ucleus

More information

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

[ 47 ] then T ( m ) is true for all n a. 2. The greatest integer function : [ ] is defined by selling [ x] [ 47 ] Number System 1. Itroductio Pricile : Let { T ( ) : N} be a set of statemets, oe for each atural umber. If (i), T ( a ) is true for some a N ad (ii) T ( k ) is true imlies T ( k 1) is true for all

More information

THE INTEGRAL TEST AND ESTIMATES OF SUMS

THE INTEGRAL TEST AND ESTIMATES OF SUMS THE INTEGRAL TEST AND ESTIMATES OF SUMS. Itroductio Determiig the exact sum of a series is i geeral ot a easy task. I the case of the geometric series ad the telescoig series it was ossible to fid a simle

More information

Solutions to Problem Set 7

Solutions to Problem Set 7 8.78 Solutios to Problem Set 7. If the umber is i S, we re doe sice it s relatively rime to everythig. So suose S. Break u the remaiig elemets ito airs {, }, {4, 5},..., {, + }. By the Pigeohole Pricile,

More information

Putnam Training Exercise Counting, Probability, Pigeonhole Principle (Answers)

Putnam Training Exercise Counting, Probability, Pigeonhole Principle (Answers) Putam Traiig Exercise Coutig, Probability, Pigeohole Pricile (Aswers) November 24th, 2015 1. Fid the umber of iteger o-egative solutios to the followig Diohatie equatio: x 1 + x 2 + x 3 + x 4 + x 5 = 17.

More information

Special Modeling Techniques

Special Modeling Techniques Colorado School of Mies CHEN43 Secial Modelig Techiques Secial Modelig Techiques Summary of Toics Deviatio Variables No-Liear Differetial Equatios 3 Liearizatio of ODEs for Aroximate Solutios 4 Coversio

More information

CHAPTER 10 INFINITE SEQUENCES AND SERIES

CHAPTER 10 INFINITE SEQUENCES AND SERIES CHAPTER 10 INFINITE SEQUENCES AND SERIES 10.1 Sequeces 10.2 Ifiite Series 10.3 The Itegral Tests 10.4 Compariso Tests 10.5 The Ratio ad Root Tests 10.6 Alteratig Series: Absolute ad Coditioal Covergece

More information

Recursive Algorithms. Recurrences. Recursive Algorithms Analysis

Recursive Algorithms. Recurrences. Recursive Algorithms Analysis Recursive Algorithms Recurreces Computer Sciece & Egieerig 35: Discrete Mathematics Christopher M Bourke cbourke@cseuledu A recursive algorithm is oe i which objects are defied i terms of other objects

More information

NUMERICAL METHODS FOR SOLVING EQUATIONS

NUMERICAL METHODS FOR SOLVING EQUATIONS Mathematics Revisio Guides Numerical Methods for Solvig Equatios Page 1 of 11 M.K. HOME TUITION Mathematics Revisio Guides Level: GCSE Higher Tier NUMERICAL METHODS FOR SOLVING EQUATIONS Versio:. Date:

More information

You may work in pairs or purely individually for this assignment.

You may work in pairs or purely individually for this assignment. CS 04 Problem Solvig i Computer Sciece OOC Assigmet 6: Recurreces You may work i pairs or purely idividually for this assigmet. Prepare your aswers to the followig questios i a plai ASCII text file or

More information

SNAP Centre Workshop. Basic Algebraic Manipulation

SNAP Centre Workshop. Basic Algebraic Manipulation SNAP Cetre Workshop Basic Algebraic Maipulatio 8 Simplifyig Algebraic Expressios Whe a expressio is writte i the most compact maer possible, it is cosidered to be simplified. Not Simplified: x(x + 4x)

More information

Confidence Intervals for the Difference Between Two Proportions

Confidence Intervals for the Difference Between Two Proportions PASS Samle Size Software Chater 6 Cofidece Itervals for the Differece Betwee Two Proortios Itroductio This routie calculates the grou samle sizes ecessary to achieve a secified iterval width of the differece

More information

PROPERTIES OF THE POSITIVE INTEGERS

PROPERTIES OF THE POSITIVE INTEGERS PROPERTIES OF THE POSITIVE ITEGERS The first itroductio to mathematics occurs at the pre-school level ad cosists of essetially coutig out the first te itegers with oe s figers. This allows the idividuals

More information

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

NICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) = AN INTRODUCTION TO SCHRÖDER AND UNKNOWN NUMBERS NICK DUFRESNE Abstract. I this article we will itroduce two types of lattice paths, Schröder paths ad Ukow paths. We will examie differet properties of each,

More information

Zeros of Polynomials

Zeros of Polynomials Math 160 www.timetodare.com 4.5 4.6 Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered with fidig the solutios of polyomial equatios of ay degree

More information

1 6 = 1 6 = + Factorials and Euler s Gamma function

1 6 = 1 6 = + Factorials and Euler s Gamma function Royal Holloway Uiversity of Lodo Departmet of Physics Factorials ad Euler s Gamma fuctio Itroductio The is a self-cotaied part of the course dealig, essetially, with the factorial fuctio ad its geeralizatio

More information

Chapter 10: Power Series

Chapter 10: Power Series Chapter : Power Series 57 Chapter Overview: Power Series The reaso series are part of a Calculus course is that there are fuctios which caot be itegrated. All power series, though, ca be itegrated because

More information

YALE UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE

YALE UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE YALE UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE CPSC 467a: Crytograhy ad Comuter Security Notes 16 (rev. 1 Professor M. J. Fischer November 3, 2008 68 Legedre Symbol Lecture Notes 16 ( Let be a odd rime,

More information

INTEGRATION BY PARTS (TABLE METHOD)

INTEGRATION BY PARTS (TABLE METHOD) INTEGRATION BY PARTS (TABLE METHOD) Suppose you wat to evaluate cos d usig itegratio by parts. Usig the u dv otatio, we get So, u dv d cos du d v si cos d si si d or si si d We see that it is ecessary

More information

ECE534, Spring 2018: Final Exam

ECE534, Spring 2018: Final Exam ECE534, Srig 2018: Fial Exam Problem 1 Let X N (0, 1) ad Y N (0, 1) be ideedet radom variables. variables V = X + Y ad W = X 2Y. Defie the radom (a) Are V, W joitly Gaussia? Justify your aswer. (b) Comute

More information

John H. J. Einmahl Tilburg University, NL. Juan Juan Cai Tilburg University, NL

John H. J. Einmahl Tilburg University, NL. Juan Juan Cai Tilburg University, NL Estimatio of the margial exected shortfall Laures de Haa, Poitiers, 202 Estimatio of the margial exected shortfall Jua Jua Cai Tilburg iversity, NL Laures de Haa Erasmus iversity Rotterdam, NL iversity

More information

Linear Regression Demystified

Linear Regression Demystified Liear Regressio Demystified Liear regressio is a importat subject i statistics. I elemetary statistics courses, formulae related to liear regressio are ofte stated without derivatio. This ote iteds to

More information

Coping with Insufficient Data: The Case of Household Automobile Holding Modeling by Ryuichi Kitamura and Toshiyuki Yamamoto

Coping with Insufficient Data: The Case of Household Automobile Holding Modeling by Ryuichi Kitamura and Toshiyuki Yamamoto Coig with Isufficiet Data: he Case of ousehold utomobile oldig odelig by Ryuichi Kitamura ad oshiyuki Yamamoto It is ofte the case that tyically available data do ot cotai all the variables that are desired

More information

Math 155 (Lecture 3)

Math 155 (Lecture 3) Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,

More information

18.440, March 9, Stirling s formula

18.440, March 9, Stirling s formula Stirlig s formula 8.44, March 9, 9 The factorial fuctio! is importat i evaluatig biomial, hypergeometric, ad other probabilities. If is ot too large,! ca be computed directly, by calculators or computers.

More information

To make comparisons for two populations, consider whether the samples are independent or dependent.

To make comparisons for two populations, consider whether the samples are independent or dependent. Sociology 54 Testig for differeces betwee two samle meas Cocetually, comarig meas from two differet samles is the same as what we ve doe i oe-samle tests, ecet that ow the hyotheses focus o the arameters

More information

THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS

THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS DEMETRES CHRISTOFIDES Abstract. Cosider a ivertible matrix over some field. The Gauss-Jorda elimiatio reduces this matrix to the idetity

More information

The Hong Kong University of Science & Technology ISOM551 Introductory Statistics for Business Assignment 3 Suggested Solution

The Hong Kong University of Science & Technology ISOM551 Introductory Statistics for Business Assignment 3 Suggested Solution The Hog Kog Uiversity of ciece & Techology IOM55 Itroductory tatistics for Busiess Assigmet 3 uggested olutio Note All values of statistics i Q ad Q4 are obtaied by Excel. Qa. Let be the robability that

More information

Recurrence Relations

Recurrence Relations Recurrece Relatios Aalysis of recursive algorithms, such as: it factorial (it ) { if (==0) retur ; else retur ( * factorial(-)); } Let t be the umber of multiplicatios eeded to calculate factorial(). The

More information

MATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006

MATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006 MATH 34 Summer 006 Elemetary Number Theory Solutios to Assigmet Due: Thursday July 7, 006 Departmet of Mathematical ad Statistical Scieces Uiversity of Alberta Questio [p 74 #6] Show that o iteger of the

More information

Bertrand s Postulate

Bertrand s Postulate Bertrad s Postulate Lola Thompso Ross Program July 3, 2009 Lola Thompso (Ross Program Bertrad s Postulate July 3, 2009 1 / 33 Bertrad s Postulate I ve said it oce ad I ll say it agai: There s always a

More information

Equations and Inequalities Involving v p (n!)

Equations and Inequalities Involving v p (n!) Equatios ad Iequalities Ivolvig v (!) Mehdi Hassai Deartmet of Mathematics Istitute for Advaced Studies i Basic Scieces Zaja, Ira mhassai@iasbs.ac.ir Abstract I this aer we study v (!), the greatest ower

More information

tests 17.1 Simple versus compound

tests 17.1 Simple versus compound PAS204: Lecture 17. tests UMP ad asymtotic I this lecture, we will idetify UMP tests, wherever they exist, for comarig a simle ull hyothesis with a comoud alterative. We also look at costructig tests based

More information

MIDTERM 3 CALCULUS 2. Monday, December 3, :15 PM to 6:45 PM. Name PRACTICE EXAM SOLUTIONS

MIDTERM 3 CALCULUS 2. Monday, December 3, :15 PM to 6:45 PM. Name PRACTICE EXAM SOLUTIONS MIDTERM 3 CALCULUS MATH 300 FALL 08 Moday, December 3, 08 5:5 PM to 6:45 PM Name PRACTICE EXAM S Please aswer all of the questios, ad show your work. You must explai your aswers to get credit. You will

More information

ARITHMETIC PROGRESSIONS

ARITHMETIC PROGRESSIONS CHAPTER 5 ARITHMETIC PROGRESSIONS (A) Mai Cocepts ad Results A arithmetic progressio (AP) is a list of umbers i which each term is obtaied by addig a fixed umber d to the precedig term, except the first

More information

Properties and Tests of Zeros of Polynomial Functions

Properties and Tests of Zeros of Polynomial Functions Properties ad Tests of Zeros of Polyomial Fuctios The Remaider ad Factor Theorems: Sythetic divisio ca be used to fid the values of polyomials i a sometimes easier way tha substitutio. This is show by

More information

(b) What is the probability that a particle reaches the upper boundary n before the lower boundary m?

(b) What is the probability that a particle reaches the upper boundary n before the lower boundary m? MATH 529 The Boudary Problem The drukard s walk (or boudary problem) is oe of the most famous problems i the theory of radom walks. Oe versio of the problem is described as follows: Suppose a particle

More information

Basics of Inference. Lecture 21: Bayesian Inference. Review - Example - Defective Parts, cont. Review - Example - Defective Parts

Basics of Inference. Lecture 21: Bayesian Inference. Review - Example - Defective Parts, cont. Review - Example - Defective Parts Basics of Iferece Lecture 21: Sta230 / Mth230 Coli Rudel Aril 16, 2014 U util this oit i the class you have almost exclusively bee reseted with roblems where we are usig a robability model where the model

More information

MEI Casio Tasks for Further Pure

MEI Casio Tasks for Further Pure Task Complex Numbers: Roots of Quadratic Equatios. Add a ew Equatio scree: paf 2. Chage the Complex output to a+bi: LpNNNNwd 3. Select Polyomial ad set the Degree to 2: wq 4. Set a=, b=5 ad c=6: l5l6l

More information

MAT 271 Project: Partial Fractions for certain rational functions

MAT 271 Project: Partial Fractions for certain rational functions MAT 7 Project: Partial Fractios for certai ratioal fuctios Prerequisite kowledge: partial fractios from MAT 7, a very good commad of factorig ad complex umbers from Precalculus. To complete this project,

More information

3.1. Introduction Assumptions.

3.1. Introduction Assumptions. Sectio 3. Proofs 3.1. Itroductio. A roof is a carefully reasoed argumet which establishes that a give statemet is true. Logic is a tool for the aalysis of roofs. Each statemet withi a roof is a assumtio,

More information

Distribution of Sample Proportions

Distribution of Sample Proportions Distributio of Samle Proortios Probability ad statistics Aswers & Teacher Notes TI-Nsire Ivestigatio Studet 90 mi 7 8 9 10 11 12 Itroductio From revious activity: This activity assumes kowledge of the

More information

4.3 Growth Rates of Solutions to Recurrences

4.3 Growth Rates of Solutions to Recurrences 4.3. GROWTH RATES OF SOLUTIONS TO RECURRENCES 81 4.3 Growth Rates of Solutios to Recurreces 4.3.1 Divide ad Coquer Algorithms Oe of the most basic ad powerful algorithmic techiques is divide ad coquer.

More information

SYMMETRIC POSITIVE SEMI-DEFINITE SOLUTIONS OF AX = B AND XC = D

SYMMETRIC POSITIVE SEMI-DEFINITE SOLUTIONS OF AX = B AND XC = D Joural of Pure ad Alied Mathematics: Advaces ad Alicatios olume, Number, 009, Pages 99-07 SYMMERIC POSIIE SEMI-DEFINIE SOLUIONS OF AX B AND XC D School of Mathematics ad Physics Jiagsu Uiversity of Sciece

More information

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,

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, 3. Z Trasform Referece: Etire Chapter 3 of text. Recall that the Fourier trasform (FT) of a DT sigal x [ ] is ω ( ) [ ] X e = j jω k = xe I order for the FT to exist i the fiite magitude sese, S = x [

More information

Mathematical Induction

Mathematical Induction Mathematical Iductio Itroductio Mathematical iductio, or just iductio, is a proof techique. Suppose that for every atural umber, P() is a statemet. We wish to show that all statemets P() are true. I a

More information

The Binomial Theorem

The Binomial Theorem The Biomial Theorem Robert Marti Itroductio The Biomial Theorem is used to expad biomials, that is, brackets cosistig of two distict terms The formula for the Biomial Theorem is as follows: (a + b ( k

More information

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

2 Scalable algorithms, Scheduling, and a glance at All Prefix Sum CME 323: Distributed Algorithms ad Otimizatio, Srig 2017 htt://staford.edu/~rezab/dao. Istructor: Reza Zadeh, Matroid ad Staford. Lecture 2, 4/5/2017. Scribed by Adreas Satucci. 2 Scalable algorithms,

More information

Dimension of a Maximum Volume

Dimension of a Maximum Volume 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.

More information

Machine Learning for Data Science (CS 4786)

Machine Learning for Data Science (CS 4786) Machie Learig for Data Sciece CS 4786) Lecture & 3: Pricipal Compoet Aalysis The text i black outlies high level ideas. The text i blue provides simple mathematical details to derive or get to the algorithm

More information

Optimization Methods: Linear Programming Applications Assignment Problem 1. Module 4 Lecture Notes 3. Assignment Problem

Optimization Methods: Linear Programming Applications Assignment Problem 1. Module 4 Lecture Notes 3. Assignment Problem Optimizatio Methods: Liear Programmig Applicatios Assigmet Problem Itroductio Module 4 Lecture Notes 3 Assigmet Problem I the previous lecture, we discussed about oe of the bech mark problems called trasportatio

More information

n m CHAPTER 3 RATIONAL EXPONENTS AND RADICAL FUNCTIONS 3-1 Evaluate n th Roots and Use Rational Exponents Real nth Roots of a n th Root of a

n m CHAPTER 3 RATIONAL EXPONENTS AND RADICAL FUNCTIONS 3-1 Evaluate n th Roots and Use Rational Exponents Real nth Roots of a n th Root of a CHAPTER RATIONAL EXPONENTS AND RADICAL FUNCTIONS Big IDEAS: 1) Usig ratioal expoets ) Performig fuctio operatios ad fidig iverse fuctios ) Graphig radical fuctios ad solvig radical equatios Sectio: Essetial

More information

The Method of Least Squares. To understand least squares fitting of data.

The Method of Least Squares. To understand least squares fitting of data. The Method of Least Squares KEY WORDS Curve fittig, least square GOAL To uderstad least squares fittig of data To uderstad the least squares solutio of icosistet systems of liear equatios 1 Motivatio Curve

More information

Infinite Sequences and Series

Infinite Sequences and Series Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet

More information

Comparison Study of Series Approximation. and Convergence between Chebyshev. and Legendre Series

Comparison Study of Series Approximation. and Convergence between Chebyshev. and Legendre Series Applied Mathematical Scieces, Vol. 7, 03, o. 6, 3-337 HIKARI Ltd, www.m-hikari.com http://d.doi.org/0.988/ams.03.3430 Compariso Study of Series Approimatio ad Covergece betwee Chebyshev ad Legedre Series

More information

Kinetics of Complex Reactions

Kinetics of Complex Reactions Kietics of Complex Reactios by Flick Colema Departmet of Chemistry Wellesley College Wellesley MA 28 wcolema@wellesley.edu Copyright Flick Colema 996. All rights reserved. You are welcome to use this documet

More information

Problem 4: Evaluate ( k ) by negating (actually un-negating) its upper index. Binomial coefficient

Problem 4: Evaluate ( k ) by negating (actually un-negating) its upper index. Binomial coefficient Problem 4: Evaluate by egatig actually u-egatig its upper idex We ow that Biomial coefficiet r { where r is a real umber, is a iteger The above defiitio ca be recast i terms of factorials i the commo case

More information

(3) If you replace row i of A by its sum with a multiple of another row, then the determinant is unchanged! Expand across the i th row:

(3) If you replace row i of A by its sum with a multiple of another row, then the determinant is unchanged! Expand across the i th row: Math 5-4 Tue Feb 4 Cotiue with sectio 36 Determiats The effective way to compute determiats for larger-sized matrices without lots of zeroes is to ot use the defiitio, but rather to use the followig facts,

More information

MATH 10550, EXAM 3 SOLUTIONS

MATH 10550, EXAM 3 SOLUTIONS MATH 155, EXAM 3 SOLUTIONS 1. I fidig a approximate solutio to the equatio x 3 +x 4 = usig Newto s method with iitial approximatio x 1 = 1, what is x? Solutio. Recall that x +1 = x f(x ) f (x ). Hece,

More information

w (1) ˆx w (1) x (1) /ρ and w (2) ˆx w (2) x (2) /ρ.

w (1) ˆx w (1) x (1) /ρ and w (2) ˆx w (2) x (2) /ρ. 2 5. Weighted umber of late jobs 5.1. Release dates ad due dates: maximimizig the weight of o-time jobs Oce we add release dates, miimizig the umber of late jobs becomes a sigificatly harder problem. For

More information

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

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018 CSE 353 Discrete Computatioal Structures Sprig 08 Sequeces, Mathematical Iductio, ad Recursio (Chapter 5, Epp) Note: some course slides adopted from publisher-provided material Overview May mathematical

More information

The Phi Power Series

The Phi Power Series The Phi Power Series I did this work i about 0 years while poderig the relatioship betwee the golde mea ad the Madelbrot set. I have fially decided to make it available from my blog at http://semresearch.wordpress.com/.

More information

Elliptic Curves Spring 2017 Problem Set #1

Elliptic Curves Spring 2017 Problem Set #1 18.783 Ellitic Curves Srig 017 Problem Set #1 These roblems are related to the material covered i Lectures 1-3. Some of them require the use of Sage; you will eed to create a accout at the SageMathCloud.

More information

Math 609/597: Cryptography 1

Math 609/597: Cryptography 1 Math 609/597: Cryptography 1 The Solovay-Strasse Primality Test 12 October, 1993 Burt Roseberg Revised: 6 October, 2000 1 Itroductio We describe the Solovay-Strasse primality test. There is quite a bit

More information

Disjoint set (Union-Find)

Disjoint set (Union-Find) CS124 Lecture 7 Fall 2018 Disjoit set (Uio-Fid) For Kruskal s algorithm for the miimum spaig tree problem, we foud that we eeded a data structure for maitaiig a collectio of disjoit sets. That is, we eed

More information

U8L1: Sec Equations of Lines in R 2

U8L1: Sec Equations of Lines in R 2 MCVU U8L: Sec. 8.9. Equatios of Lies i R Review of Equatios of a Straight Lie (-D) Cosider the lie passig through A (-,) with slope, as show i the diagram below. I poit slope form, the equatio of the lie

More information

September 2012 C1 Note. C1 Notes (Edexcel) Copyright - For AS, A2 notes and IGCSE / GCSE worksheets 1

September 2012 C1 Note. C1 Notes (Edexcel) Copyright   - For AS, A2 notes and IGCSE / GCSE worksheets 1 September 0 s (Edecel) Copyright www.pgmaths.co.uk - For AS, A otes ad IGCSE / GCSE worksheets September 0 Copyright www.pgmaths.co.uk - For AS, A otes ad IGCSE / GCSE worksheets September 0 Copyright

More information

Q-BINOMIALS AND THE GREATEST COMMON DIVISOR. Keith R. Slavin 8474 SW Chevy Place, Beaverton, Oregon 97008, USA.

Q-BINOMIALS AND THE GREATEST COMMON DIVISOR. Keith R. Slavin 8474 SW Chevy Place, Beaverton, Oregon 97008, USA. INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 2008, #A05 Q-BINOMIALS AND THE GREATEST COMMON DIVISOR Keith R. Slavi 8474 SW Chevy Place, Beaverto, Orego 97008, USA slavi@dsl-oly.et Received:

More information

CHAPTER I: Vector Spaces

CHAPTER I: Vector Spaces CHAPTER I: Vector Spaces Sectio 1: Itroductio ad Examples This first chapter is largely a review of topics you probably saw i your liear algebra course. So why cover it? (1) Not everyoe remembers everythig

More information

3.2 Properties of Division 3.3 Zeros of Polynomials 3.4 Complex and Rational Zeros of Polynomials

3.2 Properties of Division 3.3 Zeros of Polynomials 3.4 Complex and Rational Zeros of Polynomials Math 60 www.timetodare.com 3. Properties of Divisio 3.3 Zeros of Polyomials 3.4 Complex ad Ratioal Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered

More information

Notes on the prime number theorem

Notes on the prime number theorem Notes o the rime umber theorem Keji Kozai May 2, 24 Statemet We begi with a defiitio. Defiitio.. We say that f(x) ad g(x) are asymtotic as x, writte f g, if lim x f(x) g(x) =. The rime umber theorem tells

More information

Unit 5. Hypersurfaces

Unit 5. Hypersurfaces Uit 5. Hyersurfaces ================================================================= -------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

More information

Math 113, Calculus II Winter 2007 Final Exam Solutions

Math 113, Calculus II Winter 2007 Final Exam Solutions Math, Calculus II Witer 7 Fial Exam Solutios (5 poits) Use the limit defiitio of the defiite itegral ad the sum formulas to compute x x + dx The check your aswer usig the Evaluatio Theorem Solutio: I this

More information

Average-Case Analysis of QuickSort

Average-Case Analysis of QuickSort Average-Case Aalysis of QuickSort Comp 363 Fall Semester 003 October 3, 003 The purpose of this documet is to itroduce the idea of usig recurrece relatios to do average-case aalysis. The average-case ruig

More information

Chapter 2 The Solution of Numerical Algebraic and Transcendental Equations

Chapter 2 The Solution of Numerical Algebraic and Transcendental Equations Chapter The Solutio of Numerical Algebraic ad Trascedetal Equatios Itroductio I this chapter we shall discuss some umerical methods for solvig algebraic ad trascedetal equatios. The equatio f( is said

More information

Implicit function theorem

Implicit function theorem Jovo Jaric Implicit fuctio theorem The reader kows that the equatio of a curve i the x - plae ca be expressed F x, =., this does ot ecessaril represet a fuctio. Take, for example F x, = 2x x =. (1 either

More information

Series: Infinite Sums

Series: Infinite Sums Series: Ifiite Sums Series are a way to mae sese of certai types of ifiitely log sums. We will eed to be able to do this if we are to attai our goal of approximatig trascedetal fuctios by usig ifiite degree

More information

SOME TRIBONACCI IDENTITIES

SOME TRIBONACCI IDENTITIES Mathematics Today Vol.7(Dec-011) 1-9 ISSN 0976-38 Abstract: SOME TRIBONACCI IDENTITIES Shah Devbhadra V. Sir P.T.Sarvajaik College of Sciece, Athwalies, Surat 395001. e-mail : drdvshah@yahoo.com The sequece

More information

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

Randomized Algorithms I, Spring 2018, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 25, 2018) Radomized Algorithms I, Sprig 08, Departmet of Computer Sciece, Uiversity of Helsiki Homework : Solutios Discussed Jauary 5, 08). Exercise.: Cosider the followig balls-ad-bi game. We start with oe black

More information

Section 1.1. Calculus: Areas And Tangents. Difference Equations to Differential Equations

Section 1.1. Calculus: Areas And Tangents. Difference Equations to Differential Equations Differece Equatios to Differetial Equatios Sectio. Calculus: Areas Ad Tagets The study of calculus begis with questios about chage. What happes to the velocity of a swigig pedulum as its positio chages?

More information

Chapter 2: Numerical Methods

Chapter 2: Numerical Methods Chapter : Numerical Methods. Some Numerical Methods for st Order ODEs I this sectio, a summar of essetial features of umerical methods related to solutios of ordiar differetial equatios is give. I geeral,

More information

(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

(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 MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special

More information

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

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer. 6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio

More information

STAT-UB.0103 NOTES for Wednesday 2012.APR.25. Here s a rehash on the p-value notion:

STAT-UB.0103 NOTES for Wednesday 2012.APR.25. Here s a rehash on the p-value notion: STAT-UB.3 NOTES for Wedesday 22.APR.25 Here s a rehash o the -value otio: The -value is the smallest α at which H would have bee rejected, with these data. The -value is a measure of SHOCK i the data.

More information

PROPERTIES OF AN EULER SQUARE

PROPERTIES OF AN EULER SQUARE PROPERTIES OF N EULER SQURE bout 0 the mathematicia Leoard Euler discussed the properties a x array of letters or itegers ow kow as a Euler or Graeco-Lati Square Such squares have the property that every

More information

CONSTRUCTING TRUNCATED IRRATIONAL NUMBERS AND DETERMINING THEIR NEIGHBORING PRIMES

CONSTRUCTING TRUNCATED IRRATIONAL NUMBERS AND DETERMINING THEIR NEIGHBORING PRIMES CONSTRUCTING TRUNCATED IRRATIONAL NUMBERS AND DETERMINING THEIR NEIGHBORING PRIMES It is well kow that there exist a ifiite set of irratioal umbers icludig, sqrt(), ad e. Such quatities are of ifiite legth

More information

Chapter 6: BINOMIAL PROBABILITIES

Chapter 6: BINOMIAL PROBABILITIES Charles Bocelet, Probability, Statistics, ad Radom Sigals," Oxford Uiversity Press, 016. ISBN: 978-0-19-00051-0 Chater 6: BINOMIAL PROBABILITIES Sectios 6.1 Basics of the Biomial Distributio 6. Comutig

More information

Ma 530 Introduction to Power Series

Ma 530 Introduction to Power Series Ma 530 Itroductio to Power Series Please ote that there is material o power series at Visual Calculus. Some of this material was used as part of the presetatio of the topics that follow. What is a Power

More information

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting Lecture 6 Chi Square Distributio (χ ) ad Least Squares Fittig Chi Square Distributio (χ ) Suppose: We have a set of measuremets {x 1, x, x }. We kow the true value of each x i (x t1, x t, x t ). We would

More information

OPTIMAL ALGORITHMS -- SUPPLEMENTAL NOTES

OPTIMAL ALGORITHMS -- SUPPLEMENTAL NOTES OPTIMAL ALGORITHMS -- SUPPLEMENTAL NOTES Peter M. Maurer Why Hashig is θ(). As i biary search, hashig assumes that keys are stored i a array which is idexed by a iteger. However, hashig attempts to bypass

More information

Math 113 Exam 3 Practice

Math 113 Exam 3 Practice Math Exam Practice Exam will cover.-.9. This sheet has three sectios. The first sectio will remid you about techiques ad formulas that you should kow. The secod gives a umber of practice questios for you

More information