Imagine the unit square in the plane to be a carrom board. Assume the striker is just a point, moving with no friction (so it goes forever), and that when it hits an edge, the angle of reflection is equal to the angle of incidence, as in real life. If the striker ever hits a corner it falls into the pocket and disappears. The trajectory of the striker is completely determined by its starting point (x,y) and its initial velocity (p,q). If the striker eventually returns to its initial state (i.e. initial position and initial velocity), we define its bounce number to be the number of edges it hits before returning to its initial state for the 1st time. For example, the trajectory with initial state [(.5,.5);(1,0)] has bounce number 2 and it returns to its initial state for the 1st time in 2 time units. And the trajectory with initial state [(.25,.75);(1,1)] has bounce number 4.<spanclass=′latex−bold′>(a)</span> Suppose the striker has initial state [(.5,.5);(p,q)]. If p>q⩾0 then what is its velocity after it hits an edge for the 1st time ? What if q>p⩾0 ?<spanclass=′latex−bold′>(b)</span> Draw a trajectory with bounce number 5 or justify why it is impossible.<spanclass=′latex−bold′>(c)</span> Consider the trajectory with initial state [(x,y);(p,0)] where p is a positive integer. In how much time will the striker 1st return to its initial state ?<spanclass=′latex−bold′>(d)</span> What is the bounce number for the initial state [(x,y);(p,q)] where p,q are relatively prime positive integers, assuming the striker never hits a corner ? CMIChennai Mathematical Institute2018logicindia