Nice, even if it appears having issues with cases in which one of the bounces isn't strictly > of window, like this:
assertEquals(1, BouncingBall.bouncingBall(2.0, 0.5, 1.0));

I like this idea too. the code is very clean

Impotent to notice here this solution isn't performance-wise.
It allocates in memory lots of intermediate arrays. That might be costly and has to be avoided.

very nice

You should do a very simple code(KISS principle). May be after 5-10 years you would do it like this, may be not.
imho it is not necessary.

Something like this:
int[] a = {3, 2147483646};
int[] b = {9, 4};
returns true...

ну ты гнида

i think that this code work very slow on big numbers

how can i learn to code like this?

1 is not prime and 2 is prime. Your isPrime is incorrect.