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:
The slope intercept form is y=-7x+59
Step-by-step explanation:
y-y=m(x-x1)
y-3=-7(x-8)
y-3=-7x+56
+3 +3
y=-7x+59
Answer:
90
Step-by-step explanation:
30x3=90
Answer:
The geometric mean of 2 and 8 comes out to equal 4.
Step-by-step explanation:
Answer:
C and E
Step-by-step explanation:
To answer this question, we plug in the X values of the coordinates into the equation to see if they'll give us the corresponding Y value.
(X, Y)
Example:
Y = 5X
6 != 5 * 3
We do this for every coordinate point. If the problem doesn't make sense, it doesn't fall on the line. Let's test every one of these.
B. (0, 1)
1 != 5 * 0
C. (3, 15)
15 = 5 * 3
D. (4, 2)
2 != 5 * 4
E. (-1, -5)
-5 = 5 * -1
F. (-1, 5)
5 != 5 * -1
* For those who don't know, the != is how to say "not equal to" in computer science.
