subject
Mathematics, 24.06.2020 05:01 stevenabdullatif16

A stick n inches long must be cut into n 1-inch pieces. We could cut the stick (n-1) times, but we would like to minimize the number of times the saw is used. Several stick pieces can be stacked together and cut at the same time. Draw the sticks and illustrate their arrangement so the saw is used as few times as possible. Clearly identify the stick lengths at each cut, and clearly identify the number of cuts needed. a. Solve the problem for a 30-inch stick. (2 points) b. Solve the problem for a 33-inch stick. (2 points) c. State a general formula for the minimum number of cuts for an n-inch stick. (2 points)

ansver
Answers: 3

Another question on Mathematics

question
Mathematics, 21.06.2019 14:30
Aparking lot is to be 400 feet wide and 370 feet deep. how many standard-sized cars fit in this lot considering a double-loaded (w4) two way traffic set up, an angle of 90° and a sw of 9’ 0’’? (do not consider handicapped parking spaces, and consider 15’ for turning aisles). show your work.
Answers: 2
question
Mathematics, 21.06.2019 19:00
How do you find the circumfrance of a circle?
Answers: 1
question
Mathematics, 21.06.2019 20:00
Which expression is rational? 6. , square root two, square root 14, square root 49
Answers: 1
question
Mathematics, 21.06.2019 21:20
Rose bought a new hat when she was on vacation. the following formula describes the percent sales tax rose paid b=t-c/c
Answers: 3
You know the right answer?
A stick n inches long must be cut into n 1-inch pieces. We could cut the stick (n-1) times, but we w...
Questions
question
Mathematics, 13.04.2021 01:40
question
Mathematics, 13.04.2021 01:40
question
Mathematics, 13.04.2021 01:40