What is the smallest value of n for which the approximation above is guaranteed to have an error less than 0.0001

Five dinosaurs go for a walk and come across some lovely chicken wings. their names are rexy, bronto, steggy, paly, and terry. there are exactly 5 dozen wings(equal enough for each dino to have a dozen right? ); however, terry is on a diet and he only eats 6 wings. if paly eats 2 more than terry, steggy eats 4 more than paly, and bronto and rexy eat the same amount because they are really hungry from not eating all day, how many chicken wings did each dino eat?

20.ju inces. which ordered pair is a viable solution if x represents the number of books he orders and y represents the total weight of the books, in ounces? (-3,-18) (-0.5, -3) (0,0) (0.5, 3)

Use mathematical induction to prove the statement is true for all positive integers n, or show why it is false. 1^2 + 4^2 + 7^2 + + (3n - 2)^2 = [n(6n^2-3n-1)/2]