Answer:
girllll
Step-by-step explanation:
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.
49 increased by d is 49 + d but I feel that this isn't the whole statement...?
Answer:
C
Step-by-step explanation:
Hey There!
So if you didn't know in an isosceles trapezoid the non parallel sides are congruent
So given the base lengths and the perimeter we subtract the given length from the perimeter and divide that by 2
40-10=40
30-14=16
16/2=8
so the lengths of the non parallel sides would be 8 cm and 8 cm
The least common multiple of 9 and 21 is 63
