A supercalifragilisticexpialidocious problem

Revision en3, by jhknmj, 2021-03-29 12:15:46

Find the number of such sequence A[0...n-1] that satisfies A[i] equals the number of i in A[0...n-1].

For example , if n = 9, there is only one solution [5, 2, 1, 0, 0, 1, 0, 0, 0]. (We use bruteforce to prove it)

We guess that if n > 6, there is only one solution and it takes the form of [n-4, 2, 1, 0, 0, ..., 1, ...,0, 0].

We want to know whether it is right.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English jhknmj 2021-03-29 12:15:46 33
en2 English jhknmj 2021-03-29 12:08:40 30
en1 English jhknmj 2021-03-29 12:07:55 412 Initial revision (published)