The greatest number of skateboards that can be stored would be the number that is the highest common factor of 8, 12, and 16
Factors of 8 = 1, 2, 4, 8
Factors of 12 = 1, 2, 3, 4, 6, 12
Factors of 16 = 1, 2, 4, 8, 16
The highest common factor = 4
Hence, the greatest numbers of skateboard that can be stored in each section is 4
Answer:
1/6
Step-by-step explanation:
Answer:
n(A) = 7
Step-by-step explanation:
Let set A be A = {a,b,c}
We can say n(A) = 3
So basically n(A) means the "number of elements (unique) in set A"
They have to be unique.
For this problem, set A is:
A = {-3,-1,1,3,5,7,9}
If we count, there are 7 unique elements in this set. Thus:
n(A) = 7
Answer: The equation of motion is
s(t) = (1/2)a·t² +v₀·t +s₀
Step-by-step explanation: Hope this helped!
