The 2 min Solution
1. Decode the Jump: A jump of length 5 landing on integer coordinates means the change in x and y for each jump (let’s call them ‘a’ and ‘b’) must be integers that satisfy the distance formula: a^2 + b^2 = 5^2, or a^2 + b^2 = 25. This is a classic Pythagorean triple. The only integer pairs for (a,b) are combinations of (+/-3, +/-4) and (+/-5, 0).
2. The Parity Hack (Odd/Even Trick): Look at the possible changes for x and y: {0, 3, 4, 5}. In every valid jump vector, one component is odd (3 or 5) and the other is even (0 or 4).
• Start Point: (0, 0) -> (Even, Even)
• After 1 jump: (Even, Even) + (Odd, Even) = (Odd, Even). The frog’s coordinates are now one odd, one even.
• After 2 jumps: (Odd, Even) + (Odd, Even) = (Even, Even). The frog is back to having two even coordinates.
• Destination: (1, 0) -> (Odd, Even)
3. Eliminate and Conclude: The frog can only be at a location with (Odd, Even) coordinates after an odd number of jumps. This instantly eliminates answer choices A (2 jumps), C (4 jumps), and E (6 jumps). The smallest possible answer remaining is B (3).
(Self-Correction/Verification: Is 3 actually possible? Yes. Consider the jumps: (+3, +4), (+3, -4), and (-5, 0). The total change in x is 3 + 3 - 5 = 1. The total change in y is 4 - 4 + 0 = 0. This path works, confirming 3 is the minimum.)