Stalnaker s Argument

Size: px
Start display at page:

Download "Stalnaker s Argument"

Transcription

1 Stlker s Argumet (This is supplemet to Coutble Additiviy, Dutch Books d the Sleepig Beuty roblem ) Stlker (008) suggests rgumet tht c be stted thus: Let t be the time t which Beuty wkes o Mody morig. Upo wkeig, Beuty lers somethig tht is relevt to Heds: while she does t kow whe t is, she does ler, of t, tht she is wke the. Hvig lered this, she kows tht oe of the followig three possibilities obtis: T*: Tils d t is o Mody. T*: Tils d t is o Tuesdy. H*: Heds d t is o Mody. But if Beuty is to be represeted s lerig, o Mody morig, tht she is wke t t, the she must be represeted s ot yet kowig this o Sudy eveig, d hece s hvig ot yet ruled out the followig possibility: H*: Heds d t is o Tuesdy. O Sudy eveig, Beuty should regrd ech of the four bove possibilities s eqully probble. Ad o Mody morig, she should coditiolize o the egtio of the fourth possibility, with the result tht her credece i H*, d hece i Heds, is oe-third. Ufortutely, while Stlker sys tht ll prties to the debte should be ble to gree bout how Beuty s degrees of belief should be pportioed o Sudy mog these four possibilities, he does t idicte how this cosesus should be reched. However, elsewhere (008b) he offers clue bout the kid of priciple he wts to ivoke: [Beuty] is i positio tht is like [tht of] perso who is sked to mke probbility judgmet bout the followig situtio: Two people re wlkig together i Cetrl rk. Cll them A d B. How probble do you thik it is tht B is werig ruig shoes, give tht A is? [H]owever she swers the questio, if she is rtiol, she hd better swer this follow-up questio i the sme wy: Now cosider the coditiol degree of belief tht it is A who is werig ruig shoes, o the coditio tht B is. The reso the questios hve to be swered the sme wy is tht they re relly the sme questio, sice A d B re just the theorist s lbels for two geericlly idetified people... The oly idifferece priciple tht I wt to rely o is the priciple used i this exmple, requirig tht the two questios bout coditiol degree of belief be swered i the sme wy for geericlly described situtios. I the SB cse, this priciple pplies o Sudy to the possibilities tht will be distiguished o Mody d Tuesdy, but tht c be described oly geericlly o Sudy. O some wys of formlizig the idifferece priciple Stlker lludes to, this priciple would, by itself, coflict with CA. The iterestig questio, however, is whether CA coflicts with restricted,

2 fiitistic versio of this idifferece priciple, together with the other ssumptios eeded to derive the oe-third solutio. We c formulte restricted versio of the idifferece priciple s follows: Arbitrry Time Idifferece. Suppose T is fiite set cosistig of times, t, t, t, such tht Beuty represets the elemets of T simply s rbitrry times. Ad for some propositio, p, d some predicte, A, suppose tht, coditiol o p, the set of propositios {A(t ), A(t ), A(t )} costitutes prtitio. I this cse, Beuty should hve equl credece, coditiol o p, i ech of the propositios i T. We c derive the oe-third solutio from the bove priciple, together with Fiite Additivity, the Restricted ricipl riciple, d the followig three ssumptios: rior Admissibility. I y Sleepig Beuty problem, o the eveig prior to the first experimetl wkeig, Beuty kows tht she hs o iformtio tht is idmissible i reltio to y of the hypotheses i S. De Re Coditioliztio. I y Sleepig Beuty problem, if t is the time t which Beuty first wkes, the her credeces t t should be the sme s they would be if she hd iitilly represeted t s rbitrry time, d the coditiolized o the propositio tht she udergoes experimetl wkeig t t. Arbitrry Time Idepedece. I y Sleepig Beuty problem, for y hypothesis h i S, where propositio p is specifictio of the loctios of times tht Beuty represets simply s rbitrry times, Beuty s credece i h give p should be equl to her ucoditiol credece i h. I order to derive the oe-third solutio, let t represet the time whe Beuty wkes o Mody morig, d let t' represet y other time which Beuty represets, o both o Sudy eveig d o Mody morig, simply s rbitrry time. Let be Beuty s credece fuctio whe she wkes o Mody morig, d let be the credece fuctio she would hve o Sudy eveig, ssumig tht t tht time she lso represeted t simply s rbitrry time. Let the propositios H' d X be defied s follows: H'. Heds d t' is o Mody. X. t d t' re the two times whe Beuty would udergo experimetl wkeigs give Tils. Ad let Y be the followig propositio, which is etiled by X: Y. t' is oe of the times whe Beuty would udergo experimetl wkeigs give Tils, d t' does ot coicide with t.

3 Coditiol o (Heds & X), the set {H*, H'} costitutes prtitio. Ad sice the propositios i this set differ oly with respect to times which, reltive to, re represeted simply s rbitrry times, it follows from Arbitrry Time Idifferece tht H * Heds& X H Heds& X Ad coditiol o (Heds & X), H' is equivlet to H*. Hece, H* Heds& X H* Heds& X Sice, coditiol o X, Heds is equivlet to the disjuctio of H* d H*, we my ifer H * X H * X Heds X But sice X is specifictio of the loctios of times which, reltive to, re represeted simply s rbitrry times, it follows from Arbitrry Time Idepedece tht Heds X Heds Ad from the ricipl riciple, together with rior Admissibility Hece, from the lst three lies, Heds ChHeds / H * X H * X () 4 We c ow determie Beuty s Mody morig credece i Heds. Sice Y is specifictio of the loctios of time which, o Mody morig, Beuty represets simply s rbitrry time, it follows from Arbitrry Time Idifferece tht Heds HedsY Ad where W is the propositio tht Beuty udergoes experimetl wkeig t t, it follows from De Re Coditioliztio tht Ad sice (W & Y) etils X, HedsY HedsW & Y

4 Heds W & Y Heds W & X & Y Heds & W X & Y W X & Y But coditiol o (X & Y), (Heds & W) is equivlet to H*, d W is equivlet to the egtio of H*. Hece, from (), Heds & W X & Y W X & Y Ad so it follows, from the lst four lies, tht Heds = /3. H* X / 4 H* X 3/ 4 3 I will ow rgue tht the premises of the bove rgumet coflict with CA. I y Sleepig Beuty problem defied by prtitio, S, let i d j be y two hypotheses i S. If N(j) N(i), the let A deote i, d let B deote j; otherwise, let A deote j d let B deote i. Thus, N(B) N(A). Let t 0 be the time of Beuty s first experimetl wkeig. Ad let t, t 3, t N(B) be y other times such tht, both upo first wkeig d o the previous eveig, Beuty represets these times simply s rbitrry times. Let be Beuty s credece fuctio whe she first wkes, d let be the credece fuctio she would hve the previous eveig, ssumig tht t tht time she lso represeted t simply s rbitrry time. Let propositios X' d Y' be defied s follows: X'. Y'. The times t through t N(B) re the N(B) times whe Beuty would udergo experimetl wkeig give B. The times t through t N(B) re ll distict times t which Beuty would udergo experimetl wkeig give B, d oe of these times coicides with t. Ad for y two itegers, m d, betwee d N(B), let us defie the propositio s follows: m. Hypothesis A is true, d t m m is the time of the th experimetl wkeig. Now cosider the followig mtrix: N ( B) We c ow determie the probbilities of the propositios i this row, reltive to. Coditiol o (A & X'), every row, d every colum, of this mtrix costitutes prtitio. Ad the propositios i y give colum differ from oe other oly with respect to times which, reltive to, re represeted

5 simply s rbitrry times. Ad so it follows from Arbitrry Time Idifferece tht, coditiol o (A & X'), ech of the propositios i y give colum must hve the sme probbility, d these probbilities must sum to oe. Therefore, every propositio i y give row must likewise hve the sme probbility, coditiol o (A & X'). Cosider the first row. As we hve see, coditiol o (A & X'), ll the propositios i this row hve the sme probbility. Ad, coditiol o X', the disjuctio of these propositios is equivlet to A. Hece, coditiol o X', Beuty s credeces i these propositios must be equl, d must sum to her credece i A. Thus, sice there re N(B) propositios i this row, For ll s.t. N( B), X NB A X Applyig Arbitrry Time Idepedece, the ricipl riciple, d rior Admissibility, we obti For ll s.t. N( j), X N A B Ch N A B (') We c ow determie wht Beuty s credeces should be whe she first wkes. Sice Y' is specifictio of the loctios of times which, upo first wkeig, Beuty represets simply s rbitrry times, it follows from Arbitrry Time Idepedece tht A AY. Hece, where W' is the propositio tht Beuty udergoes experimetl wkeig t t, it follows from De Re Coditioliztio tht A AW Y &. By similr resoig, B BW Y A BW & Y B AW & Y Ad sice (A & W' & Y') d (B & W' & Y') ech etils X', A B & W X & Y B A& W X & Y &. Hece, But coditiol o (X' & Y'), (B & W') is equivlet to B, d (A & W') is equivlet to the disjuctio N. Hece, Ad so, from ('), by Fiite Additivity, N A B X B A B X BNAChA NB / Ad by Arbitrry Time Idepedece, the Restricted ricipl riciple, d rior Admissibility, X

6 B X B X ChB Hece, from the lst two lies ANBChB BNAChA wheever Ni, Ni Z Now recll tht A d B re simply the rbitrry hypotheses, i d j, belogig to S. Becuse of the symmetry of the bove equtio, we c ifer tht, regrdless of whether A = i d B = j, or vice vers, in jch j jni Chi wheever Ni, Ni Z Thus, the premises of the De Re Coditioliztio rgumet etil the GT. Refereces Stlker, R. (008). Our Kowledge of the Iterl World. Oxford: Oxford Uiversity ress. Stlker, R. (008b). Commet o Stlker o Sleepig Beuty Bri is: group blog i the philosophy of mid. (ccessed Oct., 009).

Review of the Riemann Integral

Review of the Riemann Integral Chpter 1 Review of the Riem Itegrl This chpter provides quick review of the bsic properties of the Riem itegrl. 1.0 Itegrls d Riem Sums Defiitio 1.0.1. Let [, b] be fiite, closed itervl. A prtitio P of

More information

EVALUATING DEFINITE INTEGRALS

EVALUATING DEFINITE INTEGRALS Chpter 4 EVALUATING DEFINITE INTEGRALS If the defiite itegrl represets re betwee curve d the x-xis, d if you c fid the re by recogizig the shpe of the regio, the you c evlute the defiite itegrl. Those

More information

Sequence and Series of Functions

Sequence and Series of Functions 6 Sequece d Series of Fuctios 6. Sequece of Fuctios 6.. Poitwise Covergece d Uiform Covergece Let J be itervl i R. Defiitio 6. For ech N, suppose fuctio f : J R is give. The we sy tht sequece (f ) of fuctios

More information

MTH 146 Class 16 Notes

MTH 146 Class 16 Notes MTH 46 Clss 6 Notes 0.4- Cotiued Motivtio: We ow cosider the rc legth of polr curve. Suppose we wish to fid the legth of polr curve curve i terms of prmetric equtios s: r f where b. We c view the cos si

More information

Numbers (Part I) -- Solutions

Numbers (Part I) -- Solutions Ley College -- For AMATYC SML Mth Competitio Cochig Sessios v.., [/7/00] sme s /6/009 versio, with presettio improvemets Numbers Prt I) -- Solutios. The equtio b c 008 hs solutio i which, b, c re distict

More information

Chapter 5. The Riemann Integral. 5.1 The Riemann integral Partitions and lower and upper integrals. Note: 1.5 lectures

Chapter 5. The Riemann Integral. 5.1 The Riemann integral Partitions and lower and upper integrals. Note: 1.5 lectures Chpter 5 The Riem Itegrl 5.1 The Riem itegrl Note: 1.5 lectures We ow get to the fudmetl cocept of itegrtio. There is ofte cofusio mog studets of clculus betwee itegrl d tiderivtive. The itegrl is (iformlly)

More information

Fig. 1. I a. V ag I c. I n. V cg. Z n Z Y. I b. V bg

Fig. 1. I a. V ag I c. I n. V cg. Z n Z Y. I b. V bg ymmetricl Compoets equece impedces Although the followig focuses o lods, the results pply eqully well to lies, or lies d lods. Red these otes together with sectios.6 d.9 of text. Cosider the -coected lced

More information

b a 2 ((g(x))2 (f(x)) 2 dx

b a 2 ((g(x))2 (f(x)) 2 dx Clc II Fll 005 MATH Nme: T3 Istructios: Write swers to problems o seprte pper. You my NOT use clcultors or y electroic devices or otes of y kid. Ech st rred problem is extr credit d ech is worth 5 poits.

More information

Reversing the Arithmetic mean Geometric mean inequality

Reversing the Arithmetic mean Geometric mean inequality Reversig the Arithmetic me Geometric me iequlity Tie Lm Nguye Abstrct I this pper we discuss some iequlities which re obtied by ddig o-egtive expressio to oe of the sides of the AM-GM iequlity I this wy

More information

0 otherwise. sin( nx)sin( kx) 0 otherwise. cos( nx) sin( kx) dx 0 for all integers n, k.

0 otherwise. sin( nx)sin( kx) 0 otherwise. cos( nx) sin( kx) dx 0 for all integers n, k. . Computtio of Fourier Series I this sectio, we compute the Fourier coefficiets, f ( x) cos( x) b si( x) d b, i the Fourier series To do this, we eed the followig result o the orthogolity of the trigoometric

More information

INFINITE SERIES. ,... having infinite number of terms is called infinite sequence and its indicated sum, i.e., a 1

INFINITE SERIES. ,... having infinite number of terms is called infinite sequence and its indicated sum, i.e., a 1 Appedix A.. Itroductio As discussed i the Chpter 9 o Sequeces d Series, sequece,,...,,... hvig ifiite umber of terms is clled ifiite sequece d its idicted sum, i.e., + + +... + +... is clled ifite series

More information

Chapter 2 Infinite Series Page 1 of 9

Chapter 2 Infinite Series Page 1 of 9 Chpter Ifiite eries Pge of 9 Chpter : Ifiite eries ectio A Itroductio to Ifiite eries By the ed of this sectio you will be ble to uderstd wht is met by covergece d divergece of ifiite series recogise geometric

More information

Review of Sections

Review of Sections Review of Sectios.-.6 Mrch 24, 204 Abstrct This is the set of otes tht reviews the mi ides from Chpter coverig sequeces d series. The specific sectios tht we covered re s follows:.: Sequces..2: Series,

More information

General properties of definite integrals

General properties of definite integrals Roerto s Notes o Itegrl Clculus Chpter 4: Defiite itegrls d the FTC Sectio Geerl properties of defiite itegrls Wht you eed to kow lredy: Wht defiite Riem itegrl is. Wht you c ler here: Some key properties

More information

Vectors. Vectors in Plane ( 2

Vectors. Vectors in Plane ( 2 Vectors Vectors i Ple ( ) The ide bout vector is to represet directiol force Tht mes tht every vector should hve two compoets directio (directiol slope) d mgitude (the legth) I the ple we preset vector

More information

Taylor Polynomials. The Tangent Line. (a, f (a)) and has the same slope as the curve y = f (x) at that point. It is the best

Taylor Polynomials. The Tangent Line. (a, f (a)) and has the same slope as the curve y = f (x) at that point. It is the best Tylor Polyomils Let f () = e d let p() = 1 + + 1 + 1 6 3 Without usig clcultor, evlute f (1) d p(1) Ok, I m still witig With little effort it is possible to evlute p(1) = 1 + 1 + 1 (144) + 6 1 (178) =

More information

Chapter System of Equations

Chapter System of Equations hpter 4.5 System of Equtios After redig th chpter, you should be ble to:. setup simulteous lier equtios i mtrix form d vice-vers,. uderstd the cocept of the iverse of mtrix, 3. kow the differece betwee

More information

PROGRESSIONS AND SERIES

PROGRESSIONS AND SERIES PROGRESSIONS AND SERIES A sequece is lso clled progressio. We ow study three importt types of sequeces: () The Arithmetic Progressio, () The Geometric Progressio, () The Hrmoic Progressio. Arithmetic Progressio.

More information

 n. A Very Interesting Example + + = d. + x3. + 5x4. math 131 power series, part ii 7. One of the first power series we examined was. 2!

 n. A Very Interesting Example + + = d. + x3. + 5x4. math 131 power series, part ii 7. One of the first power series we examined was. 2! mth power series, prt ii 7 A Very Iterestig Emple Oe of the first power series we emied ws! + +! + + +!! + I Emple 58 we used the rtio test to show tht the itervl of covergece ws (, ) Sice the series coverges

More information

Chapter 7 Infinite Series

Chapter 7 Infinite Series MA Ifiite Series Asst.Prof.Dr.Supree Liswdi Chpter 7 Ifiite Series Sectio 7. Sequece A sequece c be thought of s list of umbers writte i defiite order:,,...,,... 2 The umber is clled the first term, 2

More information

We will begin by supplying the proof to (a).

We will begin by supplying the proof to (a). (The solutios of problem re mostly from Jeffrey Mudrock s HWs) Problem 1. There re three sttemet from Exmple 5.4 i the textbook for which we will supply proofs. The sttemets re the followig: () The spce

More information

10.5 Power Series. In this section, we are going to start talking about power series. A power series is a series of the form

10.5 Power Series. In this section, we are going to start talking about power series. A power series is a series of the form 0.5 Power Series I the lst three sectios, we ve spet most of tht time tlkig bout how to determie if series is coverget or ot. Now it is time to strt lookig t some specific kids of series d we will evetully

More information

is infinite. The converse is proved similarly, and the last statement of the theorem is clear too.

is infinite. The converse is proved similarly, and the last statement of the theorem is clear too. 12. No-stdrd lysis October 2, 2011 I this sectio we give brief itroductio to o-stdrd lysis. This is firly well-developed field of mthemtics bsed o model theory. It dels ot just with the rels, fuctios o

More information

SUTCLIFFE S NOTES: CALCULUS 2 SWOKOWSKI S CHAPTER 11

SUTCLIFFE S NOTES: CALCULUS 2 SWOKOWSKI S CHAPTER 11 UTCLIFFE NOTE: CALCULU WOKOWKI CHAPTER Ifiite eries Coverget or Diverget eries Cosider the sequece If we form the ifiite sum 0, 00, 000, 0 00 000, we hve wht is clled ifiite series We wt to fid the sum

More information

FOURIER SERIES PART I: DEFINITIONS AND EXAMPLES. To a 2π-periodic function f(x) we will associate a trigonometric series. a n cos(nx) + b n sin(nx),

FOURIER SERIES PART I: DEFINITIONS AND EXAMPLES. To a 2π-periodic function f(x) we will associate a trigonometric series. a n cos(nx) + b n sin(nx), FOURIER SERIES PART I: DEFINITIONS AND EXAMPLES To -periodic fuctio f() we will ssocite trigoometric series + cos() + b si(), or i terms of the epoetil e i, series of the form c e i. Z For most of the

More information

M3P14 EXAMPLE SHEET 1 SOLUTIONS

M3P14 EXAMPLE SHEET 1 SOLUTIONS M3P14 EXAMPLE SHEET 1 SOLUTIONS 1. Show tht for, b, d itegers, we hve (d, db) = d(, b). Sice (, b) divides both d b, d(, b) divides both d d db, d hece divides (d, db). O the other hd, there exist m d

More information

1. (25 points) Use the limit definition of the definite integral and the sum formulas to compute. [1 x + x2

1. (25 points) Use the limit definition of the definite integral and the sum formulas to compute. [1 x + x2 Mth 3, Clculus II Fil Exm Solutios. (5 poits) Use the limit defiitio of the defiite itegrl d the sum formuls to compute 3 x + x. Check your swer by usig the Fudmetl Theorem of Clculus. Solutio: The limit

More information

( a n ) converges or diverges.

( a n ) converges or diverges. Chpter Ifiite Series Pge of Sectio E Rtio Test Chpter : Ifiite Series By the ed of this sectio you will be ble to uderstd the proof of the rtio test test series for covergece by pplyig the rtio test pprecite

More information

Section 6.3: Geometric Sequences

Section 6.3: Geometric Sequences 40 Chpter 6 Sectio 6.: Geometric Sequeces My jobs offer ul cost-of-livig icrese to keep slries cosistet with ifltio. Suppose, for exmple, recet college grdute fids positio s sles mger erig ul slry of $6,000.

More information

MAS221 Analysis, Semester 2 Exercises

MAS221 Analysis, Semester 2 Exercises MAS22 Alysis, Semester 2 Exercises Srh Whitehouse (Exercises lbelled * my be more demdig.) Chpter Problems: Revisio Questio () Stte the defiitio of covergece of sequece of rel umbers, ( ), to limit. (b)

More information

,... are the terms of the sequence. If the domain consists of the first n positive integers only, the sequence is a finite sequence.

,... are the terms of the sequence. If the domain consists of the first n positive integers only, the sequence is a finite sequence. Chpter 9 & 0 FITZGERALD MAT 50/5 SECTION 9. Sequece Defiitio A ifiite sequece is fuctio whose domi is the set of positive itegers. The fuctio vlues,,, 4,...,,... re the terms of the sequece. If the domi

More information

Section IV.6: The Master Method and Applications

Section IV.6: The Master Method and Applications Sectio IV.6: The Mster Method d Applictios Defiitio IV.6.1: A fuctio f is symptoticlly positive if d oly if there exists rel umer such tht f(x) > for ll x >. A cosequece of this defiitio is tht fuctio

More information

1.3 Continuous Functions and Riemann Sums

1.3 Continuous Functions and Riemann Sums mth riem sums, prt 0 Cotiuous Fuctios d Riem Sums I Exmple we sw tht lim Lower() = lim Upper() for the fuctio!! f (x) = + x o [0, ] This is o ccidet It is exmple of the followig theorem THEOREM Let f be

More information

Convergence rates of approximate sums of Riemann integrals

Convergence rates of approximate sums of Riemann integrals Jourl of Approximtio Theory 6 (9 477 49 www.elsevier.com/locte/jt Covergece rtes of pproximte sums of Riem itegrls Hiroyuki Tski Grdute School of Pure d Applied Sciece, Uiversity of Tsukub, Tsukub Ibrki

More information

Week 13 Notes: 1) Riemann Sum. Aim: Compute Area Under a Graph. Suppose we want to find out the area of a graph, like the one on the right:

Week 13 Notes: 1) Riemann Sum. Aim: Compute Area Under a Graph. Suppose we want to find out the area of a graph, like the one on the right: Week 1 Notes: 1) Riem Sum Aim: Compute Are Uder Grph Suppose we wt to fid out the re of grph, like the oe o the right: We wt to kow the re of the red re. Here re some wys to pproximte the re: We cut the

More information

Merge Sort. Outline and Reading. Divide-and-Conquer. Divide-and-conquer paradigm ( 4.1.1) Merge-sort ( 4.1.1)

Merge Sort. Outline and Reading. Divide-and-Conquer. Divide-and-conquer paradigm ( 4.1.1) Merge-sort ( 4.1.1) Merge Sort 7 2 9 4 2 4 7 9 7 2 2 7 9 4 4 9 7 7 2 2 9 9 4 4 Merge Sort versio 1.3 1 Outlie d Redig Divide-d-coquer prdigm ( 4.1.1 Merge-sort ( 4.1.1 Algorithm Mergig two sorted sequeces Merge-sort tree

More information

Approximations of Definite Integrals

Approximations of Definite Integrals Approximtios of Defiite Itegrls So fr we hve relied o tiderivtives to evlute res uder curves, work doe by vrible force, volumes of revolutio, etc. More precisely, wheever we hve hd to evlute defiite itegrl

More information

: : 8.2. Test About a Population Mean. STT 351 Hypotheses Testing Case I: A Normal Population with Known. - null hypothesis states 0

: : 8.2. Test About a Population Mean. STT 351 Hypotheses Testing Case I: A Normal Population with Known. - null hypothesis states 0 8.2. Test About Popultio Me. Cse I: A Norml Popultio with Kow. H - ull hypothesis sttes. X1, X 2,..., X - rdom smple of size from the orml popultio. The the smple me X N, / X X Whe H is true. X 8.2.1.

More information

f(t)dt 2δ f(x) f(t)dt 0 and b f(t)dt = 0 gives F (b) = 0. Since F is increasing, this means that

f(t)dt 2δ f(x) f(t)dt 0 and b f(t)dt = 0 gives F (b) = 0. Since F is increasing, this means that Uiversity of Illiois t Ur-Chmpig Fll 6 Mth 444 Group E3 Itegrtio : correctio of the exercises.. ( Assume tht f : [, ] R is cotiuous fuctio such tht f(x for ll x (,, d f(tdt =. Show tht f(x = for ll x [,

More information

Graphing Review Part 3: Polynomials

Graphing Review Part 3: Polynomials Grphig Review Prt : Polomils Prbols Recll, tht the grph of f ( ) is prbol. It is eve fuctio, hece it is smmetric bout the bout the -is. This mes tht f ( ) f ( ). Its grph is show below. The poit ( 0,0)

More information

Infinite Series Sequences: terms nth term Listing Terms of a Sequence 2 n recursively defined n+1 Pattern Recognition for Sequences Ex:

Infinite Series Sequences: terms nth term Listing Terms of a Sequence 2 n recursively defined n+1 Pattern Recognition for Sequences Ex: Ifiite Series Sequeces: A sequece i defied s fuctio whose domi is the set of positive itegers. Usully it s esier to deote sequece i subscript form rther th fuctio ottio.,, 3, re the terms of the sequece

More information

Similar idea to multiplication in N, C. Divide and conquer approach provides unexpected improvements. Naïve matrix multiplication

Similar idea to multiplication in N, C. Divide and conquer approach provides unexpected improvements. Naïve matrix multiplication Next. Covered bsics of simple desig techique (Divided-coquer) Ch. of the text.. Next, Strsse s lgorithm. Lter: more desig d coquer lgorithms: MergeSort. Solvig recurreces d the Mster Theorem. Similr ide

More information

MATH 118 HW 7 KELLY DOUGAN, ANDREW KOMAR, MARIA SIMBIRSKY, BRANDEN LASKE

MATH 118 HW 7 KELLY DOUGAN, ANDREW KOMAR, MARIA SIMBIRSKY, BRANDEN LASKE MATH 118 HW 7 KELLY DOUGAN, ANDREW KOMAR, MARIA SIMBIRSKY, BRANDEN LASKE Prt 1. Let be odd rime d let Z such tht gcd(, 1. Show tht if is qudrtic residue mod, the is qudrtic residue mod for y ositive iteger.

More information

Discrete Mathematics I Tutorial 12

Discrete Mathematics I Tutorial 12 Discrete Mthemtics I Tutoril Refer to Chpter 4., 4., 4.4. For ech of these sequeces fid recurrece reltio stisfied by this sequece. (The swers re ot uique becuse there re ifiitely my differet recurrece

More information

SUTCLIFFE S NOTES: CALCULUS 2 SWOKOWSKI S CHAPTER 11

SUTCLIFFE S NOTES: CALCULUS 2 SWOKOWSKI S CHAPTER 11 SUTCLIFFE S NOTES: CALCULUS SWOKOWSKI S CHAPTER Ifiite Series.5 Altertig Series d Absolute Covergece Next, let us cosider series with both positive d egtive terms. The simplest d most useful is ltertig

More information

SM2H. Unit 2 Polynomials, Exponents, Radicals & Complex Numbers Notes. 3.1 Number Theory

SM2H. Unit 2 Polynomials, Exponents, Radicals & Complex Numbers Notes. 3.1 Number Theory SMH Uit Polyomils, Epoets, Rdicls & Comple Numbers Notes.1 Number Theory .1 Addig, Subtrctig, d Multiplyig Polyomils Notes Moomil: A epressio tht is umber, vrible, or umbers d vribles multiplied together.

More information

f(bx) dx = f dx = dx l dx f(0) log b x a + l log b a 2ɛ log b a.

f(bx) dx = f dx = dx l dx f(0) log b x a + l log b a 2ɛ log b a. Eercise 5 For y < A < B, we hve B A f fb B d = = A B A f d f d For y ɛ >, there re N > δ >, such tht d The for y < A < δ d B > N, we hve ba f d f A bb f d l By ba A A B A bb ba fb d f d = ba < m{, b}δ

More information

Mathacle. PSet Stats, Concepts In Statistics Level Number Name: Date:

Mathacle. PSet Stats, Concepts In Statistics Level Number Name: Date: APPENDEX I. THE RAW ALGEBRA IN STATISTICS A I-1. THE INEQUALITY Exmple A I-1.1. Solve ech iequlity. Write the solutio i the itervl ottio..) 2 p - 6 p -8.) 2x- 3 < 5 Solutio:.). - 4 p -8 p³ 2 or pî[2, +

More information

MA123, Chapter 9: Computing some integrals (pp )

MA123, Chapter 9: Computing some integrals (pp ) MA13, Chpter 9: Computig some itegrls (pp. 189-05) Dte: Chpter Gols: Uderstd how to use bsic summtio formuls to evlute more complex sums. Uderstd how to compute its of rtiol fuctios t ifiity. Uderstd how

More information

Riemann Integral Oct 31, such that

Riemann Integral Oct 31, such that Riem Itegrl Ot 31, 2007 Itegrtio of Step Futios A prtitio P of [, ] is olletio {x k } k=0 suh tht = x 0 < x 1 < < x 1 < x =. More suitly, prtitio is fiite suset of [, ] otiig d. It is helpful to thik of

More information

Laws of Integral Indices

Laws of Integral Indices A Lws of Itegrl Idices A. Positive Itegrl Idices I, is clled the se, is clled the idex lso clled the expoet. mes times.... Exmple Simplify 5 6 c Solutio 8 5 6 c 6 Exmple Simplify Solutio The results i

More information

B. Examples 1. Finite Sums finite sums are an example of Riemann Sums in which each subinterval has the same length and the same x i

B. Examples 1. Finite Sums finite sums are an example of Riemann Sums in which each subinterval has the same length and the same x i Mth 06 Clculus Sec. 5.: The Defiite Itegrl I. Riem Sums A. Def : Give y=f(x):. Let f e defied o closed itervl[,].. Prtitio [,] ito suitervls[x (i-),x i ] of legth Δx i = x i -x (i-). Let P deote the prtitio

More information

Riemann Integration. Chapter 1

Riemann Integration. Chapter 1 Mesure, Itegrtio & Rel Alysis. Prelimiry editio. 8 July 2018. 2018 Sheldo Axler 1 Chpter 1 Riem Itegrtio This chpter reviews Riem itegrtio. Riem itegrtio uses rectgles to pproximte res uder grphs. This

More information

Basic Limit Theorems

Basic Limit Theorems Bsic Limit Theorems The very "cle" proof of L9 usig L8 ws provided to me by Joh Gci d it ws this result which ispired me to write up these otes. Absolute Vlue Properties: For rel umbers x, d y x x if x

More information

Handout #2. Introduction to Matrix: Matrix operations & Geometric meaning

Handout #2. Introduction to Matrix: Matrix operations & Geometric meaning Hdout # Title: FAE Course: Eco 8/ Sprig/5 Istructor: Dr I-Mig Chiu Itroductio to Mtrix: Mtrix opertios & Geometric meig Mtrix: rectgulr rry of umers eclosed i pretheses or squre rckets It is covetiolly

More information

POWER SERIES R. E. SHOWALTER

POWER SERIES R. E. SHOWALTER POWER SERIES R. E. SHOWALTER. sequeces We deote by lim = tht the limit of the sequece { } is the umber. By this we me tht for y ε > 0 there is iteger N such tht < ε for ll itegers N. This mkes precise

More information

Linear Programming. Preliminaries

Linear Programming. Preliminaries Lier Progrmmig Prelimiries Optimiztio ethods: 3L Objectives To itroduce lier progrmmig problems (LPP To discuss the stdrd d coicl form of LPP To discuss elemetry opertio for lier set of equtios Optimiztio

More information

Notes 17 Sturm-Liouville Theory

Notes 17 Sturm-Liouville Theory ECE 638 Fll 017 Dvid R. Jckso Notes 17 Sturm-Liouville Theory Notes re from D. R. Wilto, Dept. of ECE 1 Secod-Order Lier Differetil Equtios (SOLDE) A SOLDE hs the form d y dy 0 1 p ( x) + p ( x) + p (

More information

Content: Essential Calculus, Early Transcendentals, James Stewart, 2007 Chapter 1: Functions and Limits., in a set B.

Content: Essential Calculus, Early Transcendentals, James Stewart, 2007 Chapter 1: Functions and Limits., in a set B. Review Sheet: Chpter Cotet: Essetil Clculus, Erly Trscedetls, Jmes Stewrt, 007 Chpter : Fuctios d Limits Cocepts, Defiitios, Lws, Theorems: A fuctio, f, is rule tht ssigs to ech elemet i set A ectly oe

More information

Definite Integral. The Left and Right Sums

Definite Integral. The Left and Right Sums Clculus Li Vs Defiite Itegrl. The Left d Right Sums The defiite itegrl rises from the questio of fidig the re betwee give curve d x-xis o itervl. The re uder curve c be esily clculted if the curve is give

More information

Schrödinger Equation Via Laplace-Beltrami Operator

Schrödinger Equation Via Laplace-Beltrami Operator IOSR Jourl of Mthemtics (IOSR-JM) e-issn: 78-578, p-issn: 39-765X. Volume 3, Issue 6 Ver. III (Nov. - Dec. 7), PP 9-95 www.iosrjourls.org Schrödiger Equtio Vi Lplce-Beltrmi Opertor Esi İ Eskitşçioğlu,

More information

FACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING. Lectures

FACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING. Lectures FACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING Lectures MODULE 0 FURTHER CALCULUS II. Sequeces d series. Rolle s theorem d me vlue theorems 3. Tlor s d Mcluri s theorems 4. L Hopitl

More information

Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Lecture 17

Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Lecture 17 CS 70 Discrete Mthemtics d Proility Theory Sprig 206 Ro d Wlrd Lecture 7 Vrice We hve see i the previous ote tht if we toss coi times with is p, the the expected umer of heds is p. Wht this mes is tht

More information

Advanced Calculus Test File Spring Test 1

Advanced Calculus Test File Spring Test 1 Advced Clculus Test File Sprig 009 Test Defiitios - Defie the followig terms.) Crtesi product of A d B.) The set, A, is coutble.) The set, A, is ucoutble 4.) The set, A, is ifiite 5.) The sets A d B re

More information

Objective Mathematics

Objective Mathematics . o o o o {cos 4 cos 9 si cos 65 } si 7º () cos 6º si 8º. If x R oe of these, the mximum vlue of the expressio si x si x.cos x c cos x ( c) is : () c c c c c c. If ( cos )cos cos ; 0, the vlue of 4. The

More information

Inference on One Population Mean Hypothesis Testing

Inference on One Population Mean Hypothesis Testing Iferece o Oe Popultio Me ypothesis Testig Scerio 1. Whe the popultio is orml, d the popultio vrice is kow i. i. d. Dt : X 1, X,, X ~ N(, ypothesis test, for istce: Exmple: : : : : : 5'7" (ull hypothesis:

More information

The limit comparison test

The limit comparison test Roerto s Notes o Ifiite Series Chpter : Covergece tests Sectio 4 The limit compriso test Wht you eed to kow lredy: Bsics of series d direct compriso test. Wht you c ler here: Aother compriso test tht does

More information

The total number of permutations of S is n!. We denote the set of all permutations of S by

The total number of permutations of S is n!. We denote the set of all permutations of S by DETERMINNTS. DEFINITIONS Def: Let S {,,, } e the set of itegers from to, rrged i scedig order. rerrgemet jjj j of the elemets of S is clled permuttio of S. S. The totl umer of permuttios of S is!. We deote

More information

lecture 16: Introduction to Least Squares Approximation

lecture 16: Introduction to Least Squares Approximation 97 lecture 16: Itroductio to Lest Squres Approximtio.4 Lest squres pproximtio The miimx criterio is ituitive objective for pproximtig fuctio. However, i my cses it is more ppelig (for both computtio d

More information

Avd. Matematisk statistik

Avd. Matematisk statistik Avd. Mtemtisk sttistik TENTAMEN I SF94 SANNOLIKHETSTEORI/EAM IN SF94 PROBABILITY THE- ORY WEDNESDAY 8th OCTOBER 5, 8-3 hrs Exmitor : Timo Koski, tel. 7 3747, emil: tjtkoski@kth.se Tillåt hjälpmedel Mes

More information

8.3 Sequences & Series: Convergence & Divergence

8.3 Sequences & Series: Convergence & Divergence 8.3 Sequeces & Series: Covergece & Divergece A sequece is simply list of thigs geerted by rule More formlly, sequece is fuctio whose domi is the set of positive itegers, or turl umbers,,,3,. The rge of

More information

5. Solving recurrences

5. Solving recurrences 5. Solvig recurreces Time Complexity Alysis of Merge Sort T( ) 0 if 1 2T ( / 2) otherwise sortig oth hlves mergig Q. How to prove tht the ru-time of merge sort is O( )? A. 2 Time Complexity Alysis of Merge

More information

Math F215: Induction April 7, 2013

Math F215: Induction April 7, 2013 Math F25: Iductio April 7, 203 Iductio is used to prove that a collectio of statemets P(k) depedig o k N are all true. A statemet is simply a mathematical phrase that must be either true or false. Here

More information

MATRIX ALGEBRA, Systems Linear Equations

MATRIX ALGEBRA, Systems Linear Equations MATRIX ALGEBRA, Systes Lier Equtios Now we chge to the LINEAR ALGEBRA perspective o vectors d trices to reforulte systes of lier equtios. If you fid the discussio i ters of geerl d gets lost i geerlity,

More information

[ 20 ] 1. Inequality exists only between two real numbers (not complex numbers). 2. If a be any real number then one and only one of there hold.

[ 20 ] 1. Inequality exists only between two real numbers (not complex numbers). 2. If a be any real number then one and only one of there hold. [ 0 ]. Iequlity eists oly betwee two rel umbers (ot comple umbers).. If be y rel umber the oe d oly oe of there hold.. If, b 0 the b 0, b 0.. (i) b if b 0 (ii) (iii) (iv) b if b b if either b or b b if

More information

Convergence rates of approximate sums of Riemann integrals

Convergence rates of approximate sums of Riemann integrals Covergece rtes of pproximte sums of Riem itegrls Hiroyuki Tski Grdute School of Pure d Applied Sciece, Uiversity of Tsuku Tsuku Irki 5-857 Jp tski@mth.tsuku.c.jp Keywords : covergece rte; Riem sum; Riem

More information

Lecture 38 (Trapped Particles) Physics Spring 2018 Douglas Fields

Lecture 38 (Trapped Particles) Physics Spring 2018 Douglas Fields Lecture 38 (Trpped Prticles) Physics 6-01 Sprig 018 Dougls Fields Free Prticle Solutio Schrödiger s Wve Equtio i 1D If motio is restricted to oe-dimesio, the del opertor just becomes the prtil derivtive

More information

A GENERAL METHOD FOR SOLVING ORDINARY DIFFERENTIAL EQUATIONS: THE FROBENIUS (OR SERIES) METHOD

A GENERAL METHOD FOR SOLVING ORDINARY DIFFERENTIAL EQUATIONS: THE FROBENIUS (OR SERIES) METHOD Diol Bgoo () A GENERAL METHOD FOR SOLVING ORDINARY DIFFERENTIAL EQUATIONS: THE FROBENIUS (OR SERIES) METHOD I. Itroductio The first seprtio of vribles (see pplictios to Newto s equtios) is ver useful method

More information

Math 104: Final exam solutions

Math 104: Final exam solutions Mth 14: Fil exm solutios 1. Suppose tht (s ) is icresig sequece with coverget subsequece. Prove tht (s ) is coverget sequece. Aswer: Let the coverget subsequece be (s k ) tht coverges to limit s. The there

More information

The Structure of Z p when p is Prime

The Structure of Z p when p is Prime LECTURE 13 The Structure of Z p whe p is Prime Theorem 131 If p > 1 is a iteger, the the followig properties are equivalet (1) p is prime (2) For ay [0] p i Z p, the equatio X = [1] p has a solutio i Z

More information

Eigenfunction Expansion. For a given function on the internal a x b the eigenfunction expansion of f(x):

Eigenfunction Expansion. For a given function on the internal a x b the eigenfunction expansion of f(x): Eigefuctio Epsio: For give fuctio o the iterl the eigefuctio epsio of f(): f ( ) cmm( ) m 1 Eigefuctio Epsio (Geerlized Fourier Series) To determie c s we multiply oth sides y Φ ()r() d itegrte: f ( )

More information

INTEGRATION TECHNIQUES (TRIG, LOG, EXP FUNCTIONS)

INTEGRATION TECHNIQUES (TRIG, LOG, EXP FUNCTIONS) Mthemtics Revisio Guides Itegrtig Trig, Log d Ep Fuctios Pge of MK HOME TUITION Mthemtics Revisio Guides Level: AS / A Level AQA : C Edecel: C OCR: C OCR MEI: C INTEGRATION TECHNIQUES (TRIG, LOG, EXP FUNCTIONS)

More information

UNIVERSITY OF BRISTOL. Examination for the Degrees of B.Sc. and M.Sci. (Level C/4) ANALYSIS 1B, SOLUTIONS MATH (Paper Code MATH-10006)

UNIVERSITY OF BRISTOL. Examination for the Degrees of B.Sc. and M.Sci. (Level C/4) ANALYSIS 1B, SOLUTIONS MATH (Paper Code MATH-10006) UNIVERSITY OF BRISTOL Exmitio for the Degrees of B.Sc. d M.Sci. (Level C/4) ANALYSIS B, SOLUTIONS MATH 6 (Pper Code MATH-6) My/Jue 25, hours 3 miutes This pper cotis two sectios, A d B. Plese use seprte

More information

Section 7.3, Systems of Linear Algebraic Equations; Linear Independence, Eigenvalues, Eigenvectors (the variable vector of the system) and

Section 7.3, Systems of Linear Algebraic Equations; Linear Independence, Eigenvalues, Eigenvectors (the variable vector of the system) and Sec. 7., Boyce & DiPrim, p. Sectio 7., Systems of Lier Algeric Equtios; Lier Idepedece, Eigevlues, Eigevectors I. Systems of Lier Algeric Equtios.. We c represet the system...... usig mtrices d vectors

More information

Test Info. Test may change slightly.

Test Info. Test may change slightly. 9. 9.6 Test Ifo Test my chge slightly. Short swer (0 questios 6 poits ech) o Must choose your ow test o Tests my oly be used oce o Tests/types you re resposible for: Geometric (kow sum) Telescopig (kow

More information

Approximate Integration

Approximate Integration Study Sheet (7.7) Approimte Itegrtio I this sectio, we will ler: How to fid pproimte vlues of defiite itegrls. There re two situtios i which it is impossile to fid the ect vlue of defiite itegrl. Situtio:

More information

Algebra II, Chapter 7. Homework 12/5/2016. Harding Charter Prep Dr. Michael T. Lewchuk. Section 7.1 nth roots and Rational Exponents

Algebra II, Chapter 7. Homework 12/5/2016. Harding Charter Prep Dr. Michael T. Lewchuk. Section 7.1 nth roots and Rational Exponents Algebr II, Chpter 7 Hrdig Chrter Prep 06-07 Dr. Michel T. Lewchuk Test scores re vilble olie. I will ot discuss the test. st retke opportuit Sturd Dec. If ou hve ot tke the test, it is our resposibilit

More information

MATH 104 FINAL SOLUTIONS. 1. (2 points each) Mark each of the following as True or False. No justification is required. y n = x 1 + x x n n

MATH 104 FINAL SOLUTIONS. 1. (2 points each) Mark each of the following as True or False. No justification is required. y n = x 1 + x x n n MATH 04 FINAL SOLUTIONS. ( poits ech) Mrk ech of the followig s True or Flse. No justifictio is required. ) A ubouded sequece c hve o Cuchy subsequece. Flse b) A ifiite uio of Dedekid cuts is Dedekid cut.

More information

F x = 2x λy 2 z 3 = 0 (1) F y = 2y λ2xyz 3 = 0 (2) F z = 2z λ3xy 2 z 2 = 0 (3) F λ = (xy 2 z 3 2) = 0. (4) 2z 3xy 2 z 2. 2x y 2 z 3 = 2y 2xyz 3 = ) 2

F x = 2x λy 2 z 3 = 0 (1) F y = 2y λ2xyz 3 = 0 (2) F z = 2z λ3xy 2 z 2 = 0 (3) F λ = (xy 2 z 3 2) = 0. (4) 2z 3xy 2 z 2. 2x y 2 z 3 = 2y 2xyz 3 = ) 2 0 微甲 07- 班期中考解答和評分標準 5%) Fid the poits o the surfce xy z = tht re closest to the origi d lso the shortest distce betwee the surfce d the origi Solutio Cosider the Lgrge fuctio F x, y, z, λ) = x + y + z

More information

Probability and Stochastic Processes: A Friendly Introduction for Electrical and Computer Engineers Roy D. Yates and David J.

Probability and Stochastic Processes: A Friendly Introduction for Electrical and Computer Engineers Roy D. Yates and David J. Probbility d Stochstic Processes: A Friedly Itroductio for Electricl d Computer Egieers Roy D. Ytes d Dvid J. Goodm Problem Solutios : Ytes d Goodm,4..4 4..4 4..7 4.4. 4.4. 4..6 4.6.8 4.6.9 4.7.4 4.7.

More information

Background 1. Cramer-Rao inequality

Background 1. Cramer-Rao inequality Bro-06, Lecture, 60506 D/Stt/Bro-06/tex wwwmstqueesuc/ blevit/ Observtio vector, dt: Bckgroud Crmer-Ro iequlity X (X,, X X R Here dt c be rel- or vector vlued, compoets of the dt c be idepedet or depedet,

More information

INTEGRATION IN THEORY

INTEGRATION IN THEORY CHATER 5 INTEGRATION IN THEORY 5.1 AREA AROXIMATION 5.1.1 SUMMATION NOTATION Fibocci Sequece First, exmple of fmous sequece of umbers. This is commoly ttributed to the mthemtici Fibocci of is, lthough

More information

DETERMINANT. = 0. The expression a 1. is called a determinant of the second order, and is denoted by : y + c 1

DETERMINANT. = 0. The expression a 1. is called a determinant of the second order, and is denoted by : y + c 1 NOD6 (\Dt\04\Kot\J-Advced\SMP\Mths\Uit#0\NG\Prt-\0.Determits\0.Theory.p65. INTRODUCTION : If the equtios x + b 0, x + b 0 re stisfied by the sme vlue of x, the b b 0. The expressio b b is clled determit

More information

Statistics for Financial Engineering Session 1: Linear Algebra Review March 18 th, 2006

Statistics for Financial Engineering Session 1: Linear Algebra Review March 18 th, 2006 Sttistics for Ficil Egieerig Sessio : Lier Algebr Review rch 8 th, 6 Topics Itroductio to trices trix opertios Determits d Crmer s rule Eigevlues d Eigevectors Quiz The cotet of Sessio my be fmilir to

More information

n 2 + 3n + 1 4n = n2 + 3n + 1 n n 2 = n + 1

n 2 + 3n + 1 4n = n2 + 3n + 1 n n 2 = n + 1 Ifiite Series Some Tests for Divergece d Covergece Divergece Test: If lim u or if the limit does ot exist, the series diverget. + 3 + 4 + 3 EXAMPLE: Show tht the series diverges. = u = + 3 + 4 + 3 + 3

More information

Certain sufficient conditions on N, p n, q n k summability of orthogonal series

Certain sufficient conditions on N, p n, q n k summability of orthogonal series Avilble olie t www.tjs.com J. Nolier Sci. Appl. 7 014, 7 77 Reserch Article Certi sufficiet coditios o N, p, k summbility of orthogol series Xhevt Z. Krsiqi Deprtmet of Mthemtics d Iformtics, Fculty of

More information

lecture 24: Gaussian quadrature rules: fundamentals

lecture 24: Gaussian quadrature rules: fundamentals 133 lecture 24: Gussi qudrture rules: fudmetls 3.4 Gussi qudrture It is cler tht the trpezoid rule, b 2 f ()+ f (b), exctly itegrtes lier polyomils, but ot ll qudrtics. I fct, oe c show tht o qudrture

More information

The Weierstrass Approximation Theorem

The Weierstrass Approximation Theorem The Weierstrss Approximtio Theorem Jmes K. Peterso Deprtmet of Biologicl Scieces d Deprtmet of Mthemticl Scieces Clemso Uiversity Februry 26, 2018 Outlie The Wierstrss Approximtio Theorem MtLb Implemettio

More information

Probability theory and mathematical statistics:

Probability theory and mathematical statistics: N.I. Lobachevsky State Uiversity of Nizhi Novgorod Probability theory ad mathematical statistics: Law of Total Probability. Associate Professor A.V. Zorie Law of Total Probability. 1 / 14 Theorem Let H

More information

CH 39 USING THE GCF TO REDUCE FRACTIONS

CH 39 USING THE GCF TO REDUCE FRACTIONS 359 CH 39 USING THE GCF TO EDUCE FACTIONS educig Algeric Frctios M ost of us lered to reduce rithmetic frctio dividig the top d the ottom of the frctio the sme (o-zero) umer. For exmple, 30 30 5 75 75

More information