Step-by-step explanation:
Claim:
it takes n - 1 number of breaks to break the bar into n separate squares for all integers n.
Basic case -> n = 1
The bar is already completely broken into pieces.
Case -> n ≥ 2
Assuming that assertion is true for all rectangular bars with fewer than n squares. Break the bar into two pieces of size k and n - k where 1 ≤ k < n
The bar with k squares requires k − 1 breaks and the bar with n − k squares
requires n − k − 1 breaks.
So the original bar requires 1 + (k−1) + (n−k−1) breaks.
simplifying yields,
1 + k − 1 + n − k − 1
1 - 1 + n - 1
n - 1
Therefore, we proved as we claimed that it takes n - 1 breaks to break the bar into n separate squares.
Answer:
no its the 3rd one
Step-by-step explanation:
thank me later
Answer:
The answer is 856.17.
Step-by-step explanation:
If you made the fraction into a decimal, you would get 856.166666666. If you round it to the nearest hundredth, you would get 856.17.
Answer:
18p
Step-by-step explanation:
