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 17:30
Which are factor pairs of 350? choose all answers that are correct. a) 30 and 12 b) 35 and 10 c) 70 and 5 d) 2 and 125
Answers: 2
question
Mathematics, 21.06.2019 18:00
If the cost to mail a package is an initial $5 and $0.28 for every pound the total cost to mail a package was $11.27, how much did the package weigh?
Answers: 1
question
Mathematics, 21.06.2019 18:30
Thales was an ancient philosopher familiar with similar triangles. one story about him says that he found the height of a pyramid by measuring its shadow and his own shadow at the same time. if the person is 5-ft tall, what is the height of the pyramid in the drawing?
Answers: 3
question
Mathematics, 21.06.2019 22:30
5, 6, 10 question: a. determine whether the side lengths form a triangle. (explain your reasoning) b. if it is a triangle, determine whether it is a right, acute, or obtuse triangle. (show your work)
Answers: 1
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
Questions on the website: 13722363