This is too easy for 6 kyu

i) your code doesnt run
ii) checking for divisors up to candidate^0.5 is sufficient do determine if it's a prime
iii) why print your result? return it!
iv) you don't have any testcases
v) happy coding

http://giyf.com

Untested specs is an issue

Using the same case in example, test case and validators is also an issue (intvites to hard-code answers).

So here comes my first suggestion: Hankuna matata!

Kind of tough for a 5 kyu (because of performance requirements). But fun!

Lol, ticket open, ticket closed :)

I disagree. The original was not ambiguous.

This seems inefficient as it continues creating and comparing rotations even if a missing rotation has already been identified.

No test pre-test-test-cases