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:
0.3188646
Step-by-step explanation:
an=a×r^n-1
a6=0.6×0.9^5
=0.354294
1st swing: 0.6
2nd swing: 0.9×0.6=0.54
3rd swing: 0.9×0.54= 0.486
4th 0.9×0.486= 0.4374
5th 0.9×0.4374= 0.39366
6th 0.9×0.39366=0.354294
Brainliest please~
What is the interquartile range of this data set?<br>
2,5,9,11,18, 30, 42, 48, 55, 73, 81
Lubov Fominskaja [6]
Answer:
46
Step-by-step explanation:
55-9=46
2=min
9=Lq
30=median
55= Uq
81= max
Answer:
x=9 is the answer
Step-by-step explanation:
you do 2^2 then 2-2 you add those two answer together than subtract from 15