Premium
A bound for Wilson's theorem (II)
Author(s) -
Chang Yanxun
Publication year - 1996
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/(sici)1520-6610(1996)4:1<11::aid-jcd3>3.0.co;2-2
Subject(s) - mathematics , combinatorics , integer (computer science) , mod , value (mathematics) , constant (computer programming) , discrete mathematics , statistics , computer science , programming language
In this article we prove the following theorem. For any k ≥ 3, let c ( k , 1) = exp{exp{ k k 2 }}. If v ( v − 1) ≡ 0 (mod k ( k −1)) and v − 1 ≡ 0 (mod k −1) and v > c ( k , 1), then a B ( v,k , 1) exists. © 1996 John Wiley & Sons, Inc.