Problems(1)
A prime is called perfect if there is a permutation a1,a2,⋯,a2p−1,b1,b2,⋯,b2p−1 of 1,2,⋯,p−1 satisfies bi≡ai+ai1(modp) for all 1≤i≤2p−1. Show that there are infinitely many primes that are not perfect.Proposed By - CSJL number theoryIMOC