Hi guys, have a big question abt this mathematical problem, dont rly know to witch kind of math capitol it suppouse to fit.
So the problem is: in isolated square or rectangle by size m*x meters and lays only on x,y axis, on this x,y axis somewhere is a satelite (cant be in a corner), witch can move inside of this area and bounce from "walls", also size of satelit is matter and angel "a" is in range (0deg, equal or bigger then "a" < 360 deg.)
and here is to quesions what i have left with
1.
We have a specified maximum distance D that the satellite can travel. Depending on D, determine
how many different pairs of (d, α) exist, where d ≤ D denotes the distance traveled by the satellite and α
the angle at which it starts to move, such that the satellite stops exactly in one of the corners
rectangle?
2. We have specified the maximum number of satellite reflections N . Let's assume that the reflection by the corner of the rectangle counts
for two bounces. How many different pairs of (n, α) exist, where n ≤ N denotes the number of satellite reflections
o the edge of the rectangle and α the angle at which it starts to move, such that the satellite moves exactly n
will the reflections stop just at the corner of the rectangle?
I will be glad for any help or tip/trick how to get what i need to do.
Thanks ❤️