摘要
能否把1,1,2,2,…,n,n这些数排成一行,使两个i(i=1,2,…,n)之间夹着i个数?已知必要条件是n≡0或3(mod4),本文引进了格阵的概念,运用格阵排数的一些规律,找到n≡0或3(mod4)时排数的一种统一方法。
Can the numbers 1,1,2,2,3,3,…,n,n be arranged in a row such that there are i numbers between two i' s, and i takes every value of 1, 2, …,,n?According to previous results obtained by Chang Gengzhe and Hu Weihua, the requirement is that n≡0 or 3 (mod4). Based on the idea of square permutation, this paper has given a standardized way to arrage numbers by using some rules in the square permutation.
出处
《湖南教育学院学报》
1995年第5期48-55,共8页
Journal of Hunan Educational Institute
关键词
双自然数列
和谐排列
格阵
排数
排列
double numbers
harmonious permutation
square permutation
