In this paper, the character matrix x n is studied, fast construction method of matrix X 2m is provided. And it is proved that the lower bound estimate of the number of an Latin squares matrix D[X m] is2m(2m)!+...In this paper, the character matrix x n is studied, fast construction method of matrix X 2m is provided. And it is proved that the lower bound estimate of the number of an Latin squares matrix D[X m] is2m(2m)!+∑mi=2[(2m)!] 2∏ij=1K j!∏rj=1b j!.展开更多
This paper introduces a method of sieve which can be to calculate the number of residues of the integers 1,2,...,2a sifted by n paiwise coprime numbers.
In this paper, the character matrix x n is studied, fast construction method of matrix X 2m is provided. And it is proved that the lower bound estimate of the number of an Latin squares matrix D[X m] is2m(2m)!+...In this paper, the character matrix x n is studied, fast construction method of matrix X 2m is provided. And it is proved that the lower bound estimate of the number of an Latin squares matrix D[X m] is2m(2m)!+∑mi=2[(2m)!] 2∏ij=1K j!∏rj=1b j!.展开更多
文摘In this paper, the character matrix x n is studied, fast construction method of matrix X 2m is provided. And it is proved that the lower bound estimate of the number of an Latin squares matrix D[X m] is2m(2m)!+∑mi=2[(2m)!] 2∏ij=1K j!∏rj=1b j!.
文摘This paper introduces a method of sieve which can be to calculate the number of residues of the integers 1,2,...,2a sifted by n paiwise coprime numbers.
文摘In this paper, the character matrix x n is studied, fast construction method of matrix X 2m is provided. And it is proved that the lower bound estimate of the number of an Latin squares matrix D[X m] is2m(2m)!+∑mi=2[(2m)!] 2∏ij=1K j!∏rj=1b j!.
