The sides must be long enough to make a triangle. (If the sides are not long enough, they won't meet, so cannot form a triangle.)
_____
If your version of the triangle inequality includes the "or equal to" case, then the segments must be long enough to meet, even though the result may look like a line segment.
Answer:
See definition below
Step-by-step explanation:
Since we have to give a recursive definition, we must give a initial value f(0). Additionally, the value of f(n) must depend on the value of f(n-1) for all n≥1.
The required value of f(0) is (0+1)!=1!=1.
Now, the factorial itself is a recursive function, because (n+1)!=(n+1)n!. In terms of f, this means that f(n)=(n+1)f(n-1) for all n≥1.
Then, our definition is: f:N→N is defined by
- f(0)=1.
- For n≥1, f(n)=(n+1)f(n-1).
Answer:
c
Step-by-step explanation:
subtract b from both sides
divide by x
Given:
Speed = 6 miles per second
If the Saturn revolves 6 miles in 1 second then the speed is:
So speed in minutes is 360 miles per min.
In 3 minutes traveling distance is:
Answer:
D 49.1
Step-by-step explanation:
Hope it helps
have a great day
