Using pseudo-code, describe a recursive algorithm to find n! mod m, when m, n ? Z+.
1 answer:
You might be interested in
Ok
y=-0.04x^2+8.3x+4.3
when the rocket reaches the ground (when height=0, ie when y=0), then the rocket will land, find the x coordinate
set y=0
0=-0.04x^2+8.3x+4.3
use quadratic formula
if you have ax^2+bx+c=0, then
x=
a=-0.04
b=8.3
c=4.3
x=
x=208.017 or -0.516785
xrepresents horizontal distance
you cannot have a negative horizontal distance unless you fired and theh wind blew it backwards
therefor x=280.017 is the answer
208.02 m
y=-0.04x^2+8.3x+4.3
when the rocket reaches the ground (when height=0, ie when y=0), then the rocket will land, find the x coordinate
set y=0
0=-0.04x^2+8.3x+4.3
use quadratic formula
if you have ax^2+bx+c=0, then
x=
a=-0.04
b=8.3
c=4.3
x=
x=208.017 or -0.516785
xrepresents horizontal distance
you cannot have a negative horizontal distance unless you fired and theh wind blew it backwards
therefor x=280.017 is the answer
208.02 m