So there are possible odd values and possible even values for and possible odd values and possible even values for Every pair of lines described above will yield a valid accessible point for all pairs of and with the same parity, and the number of points is thus. To count the number of such points in the region we first note that any such point will lie on the intersection of one line of the form and another line of the form The intersection of two such lines will yield the point which will be integral if and only if and have the same parity. But the parity of can then be adjusted by adding or subtracting until it is identical to the parity of as chosen before, so we conclude that it is always possible to find an integer solution for and thus any point that satisfies and can be reached by the frog. The parity of is completely dependent on so the parities of and must be chosen to match this value. Now in order for an integral solution to exist, there must always be a way to ensure that the pairs and and and have identical parities. Similarly, implies that and have the same parity. So we know that any point the frog can reach will satisfy andĪny point such that there exists 2 integers and that satisfy and is reachable.ĭenote the total amounts of each specific transformation in the frog's jump sequence to be and respectively. Find the remainder when is divided by Solutionįirst of all, it is easy to see by induction that for any in the frog's jump sequence, will be a multiple of and will be a multiple of The base case obviously satisfies the constraints and if and any of the four transformations will sustain this property:

A frog begins at and makes a sequence of jumps according to the following rule: from the frog jumps to which may be any of the points or There are points with that can be reached by a sequence of such jumps.

Frog leap solution