62.25 + 1 - 1 cause that's just 62.25 + 0 which is 62.25
Answer:
y = 1/2x - 9/2
Step-by-step explanation:
First, let’s begin with part A of the question. To find the mean, we must find the average of Rolinda’s test scores by adding them all together and then dividing the sum by 5 (the number of test scores). This is shown below:
(85 + 85 + 60 + 62 + 59) / 5
351/5
70.2
Therefore, the mean of Rolinda’s test scores is 70.2.
Next, we should find the median, or the middle number of the sequence after we order the numbers from smallest to largest. This is shown below:
59, 60, 62, 85, 85
Since 62 is the middlemost number in the list, the median is 62.
Finally, we must find the mode, or the most common number in the list. Since 85 is the only number that occurs more than once, we know that the mode is 85.
Next, we move on to Part B. The measure that supports Rolinda’s claim that she is doing well in her Spanish class is the mode, because it is the highest measure out of the three.
The answer to Part C is as follows: This is misleading because the mode is not an accurate representation of all of Rolinda’s test scores and the range that they cover, it only represents Rolinda’s highest score, which she happened to score twice.
Hope this helps!
Answer:
D. No, because the differential equation does not have constant coefficients.
Step-by-step explanation:
The undetermined coefficient method cannot be applied to non homogeneous variables. The differential equation does not have constant variables therefore the method of undetermined superposition can not be applied. To complete a solution of non homogeneous equation the particular solution must be added to the homogeneous equation.
Answer:
1) How does "Abe" relate to the merry-go-round? (The problem doesn't seem to say.)
2) How many people did each person provide for? So how many dozens were brought? How many are in a dozen? So how many cookies were brought?
Step-by-step explanation:
nm the top
There are n seats on a merry- go-round. A boy takes n rides. Between each ride, he moves clockwise a certain number of places to a new horse. Each time he moves a different number of places. Find all n for which the boy ends up riding each horse.
2) So if there are n horses, first the boy could move by one place then he could move by n+1 places then by 2n+1 so on and so forth, until he moves (n−2)n+1 places, in which case he'd would have been ridden each horse only one time and taken unique number of steps, which implies that all n's satisfy given condition.
1) I don't know how to cancer this let me resheerch and ill get back to you
P>S let this be help only if you need to annotate or reword thx
