title: Proof for minimum number of String Rotation Problem
body: <p>Let's say we are rotating a string one at a time ("abcd" -> "bcda"). After some t rotations we get the same string. Let t be the minimum such number of rotations.</p>
  
  <p>For ex:</p>
  
  <ol>
  <li>For S = "aaaa", t = 1</li>
  <li>For S = "abcabc", t = 3</li>
  <li>For S = "abcdef", t = 6</li>
  </ol>
  
  <p>Now my question is, can there be any string for which this condition holds : t > len(S)/2 and t &lt; len(S)? If not can you please explain why?</p>