Answer:
1. Proved down
2. proved down
3. f(10) = -20 - 5 - 5 - 5 - 5 - 5 - 5 - 5 - 5 - 5 - 5
Step-by-step explanation:
Let us explain how to solve the question
∵ f(0) = -20, f(n) = f(n - 1) - 5 for n > 1
→ That means we have an arithmetic sequence with constant
difference -5 and first term -20
1. → f(1) means we need to find the second term, which equal the
term - 5
∵ f(1) means n = 1
∴ f(1) = f(1 - 1) - 5
∴ f(1) = f(0) - 5
∵ f(0) = -20
∴ f(1) = -20 - 5 → Proved
2. → f(3) means we need to find the third term, which equal the
second term - 5
∵ f(3) means n = 3
∴ f(3) = f(3 - 1) - 5
∴ f(3) = f(2) - 5
→ f(2) = f(1) - 5
∵ f(1) = -20 - 5
∴ f(2) = [-20 - 5] - 5 = -20 - 5 - 5
∴ f(3) = [-20 - 5 - 5] - 5
∴ f(3) = -20 - 5 - 5 - 5 → Proved
3. → From 1 and 2 we notice that the number of -5 is equal to n,
at n = 1 there is one (-5), when n= 3 there are three (-5)
∵ n = 10
∴ There are ten (-5)
∴ f(10) = -20 - 5(10)
∴ f(10) = -20 - 5 - 5 - 5 - 5 - 5 - 5 - 5 - 5 - 5 - 5 → Proved
*see attachment showing the two polygons in a grid.
Answer:
No, PQRST is not a scale copy of ABCDE because we the sides are not increased proportionally.
Step-by-step explanation:
A polygon can be said to be a scaled copy of another polygon, if the the same scale factor is used in scaling every segment of the preimage or original image to get the length of the corresponding segments of the scale copy or image. In order words, all segments must be scaled proportionally.
Polygon PQRST, which is the new image, has different scale factors used in scaling the various segments of the preimage. In simple terms, the sides of PQRST were not increased proportionally. Therefore, PQRST is not a scaled copy of ABCDE.
n(AxB) = 25
Step-by-step explanation:
AxB in sets is called Cartesian product. And is defined as a set of ordered pairs (a,b) where a belongs to A and b belongs to B.
Given
A = {a,b,c,d,e}
B = {1,2,3,4,5}
The number of elements for Cartesian product of two sets is determined by:
Here
So,
Hence,
n(AxB) = 25
Keywords: Sets, Cartesian Product
Learn more about sets at:
#LearnwithBrainly
There are 720 total different combinations, and 24 of those will have the letters DAY consecutively within all those combinations.
<u>Explanation:</u>
FRIDAY is a six letter word.
To form all combinations of letters, we would have six choices of letters to fill the first spot. Whatever letter you choose for the first spot, you then have five choices of letters to fill the second spot. Four choices of letters to fill the third spot. And so on.
So, the total number of different combinations of the six letters would be 6!
6! = 6 X 5 X 4 X 3 X 2 X 1
= 720
DAY could appear consecutively starting in 4 different spots: the 1st, 2nd, 3rd, and 4th spots of all combinations. DAY will appear consecutively 6 times in each of those 4 starting spots.
6 X 4 = 24.
So, there are 720 total different combinations, and 24 of those will have the letters DAY consecutively within all those combinations.
