Hey /sci/, I have been given this puzzle and did some joggin the old noggin, but I can't for the life of me figure it out. My only guess is that it has to do something with prime numbers but that's not much.

>Consider the domain of all integer numbers in the interval (-?, ?). A hypothetical bunny starts hopping from one unknown integer number to another with a fixed integer hop size. Every time the bunny hops to a new integer number you can investigate only one number to check if the bunny is there. The step size of the hop is fixed and both the starting point of the bunny and the hop size are unknown to you.
>You like bunnies and you would like to catch and pet it. Devise a strategy which given enough processing and storage power, assuming an infinite amount of time and therefore bunny hops, you will always be able to catch the bunny in a finite number of hops.
Any ideas?