Given a 10 x 5 grid of cartesian coordinates starting at (0,0) and going up to (10, 5): (a)how many different paths are there starting from the bottom left corner to the top right corner? You can only move right or up, without going backwards (no returning routes); Explain why? (b) Generalize this to an arbitrary choice of grid size starting at (0,0), but a different end-point to the grid at the value of (m,n) rather than (10,5) as in (a) above

Solve: 1 O s= 1 O S= -7 O S= -1 O S=7 I3D 47

Solve:

Mr. O'Dell and Mr. Johnson begin running laps around a one mile track at the same time. Mr. O'Dell completes a mile every 6 minutes and Mr. Johnson completes a mile every 8 minutes. How long will it take for them both to finish a lap at the same time?

How large should n be to guarantee that the Trapezoidal Rule approximation to x - 12x- 48x² + 2x + 5) dæ is accurate to within 0.1. n = How large should n be to guarantee that the Simpsons Rule approximation to 2 1(-a - 12a - 48z? + 2x + 5) dx is accurate to within 0.1. n = Hint: Remember your answers should be a whole numbers, and Simpson's Rule requires even values for n Question Help: Video 1 D Video 2 Submit Question P Type here to search hp

Solve: 5=x/4+y for y

Solve ak=uak=u for aa.

solve for x