Can minimum number of rotations required to get the same string be greater than len/2 ever?

Правка en2, от yesnomaybe, 2020-05-02 19:07:47

Given string S, and let K be the minimum number of rotations required to get the same string.

For Example: (1) For S = "aaaa", K = 1 (2) For S = "abcabc", K = 3 (3) For S = "abcdef", K = 6

Now my question is, can there be any string for which K > len(S)/2 and K < len(S) ? If not, can someone please help me prove it?

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский yesnomaybe 2020-05-02 19:27:57 18
en2 Английский yesnomaybe 2020-05-02 19:07:47 15 Tiny change: ' len(S)/2 ? If not,' -> ' len(S)/2 and K < len(S) ? If not,'
en1 Английский yesnomaybe 2020-05-02 18:56:37 402 Initial revision (published)