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:
CBenson1031
Step-by-step explanation:
p = 5 ÷ (12.37 - 1.12)
p = 5 ÷ 11.25
p = 2.25
Step-by-step explanation:
Answer:
3,9
Step-by-step explanation:
Factors of 36 = 1,2,3,4,6,9,12,18,36
Those factors which are odd = 1,3,9
Odd Factors which are multiple of 3 = 3,9
So, these are the two numbers Margret might be thinking of.
Answer:
we need an attachment we can’t see the question ma’am.
Step-by-step explanation:
