𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A bound for wilson's theorem (I)

✍ Scribed by Chang Yanxun

Publisher
John Wiley and Sons
Year
1995
Tongue
English
Weight
571 KB
Volume
3
Category
Article
ISSN
1063-8539

No coin nor oath required. For personal study only.

✦ Synopsis

In 1975, Richard M. Wilson proved: Given any positive integers k 2 3 and A, there exists a constant vo = vo(k,A) such that v E B(k,A) for every integer v 2 YO that satisfies

The proof given by Wilson does not provide an explicit value of VO. We try to find such a value vo(k,A). In this article we consider the case A = 1 and v = l[mod k(kl)]. We show that: if k 2 3 and v = l[mod k(kl)] where v > kkt5, then a B(v, k , 1) exists.

πŸ“œ SIMILAR VOLUMES

A bound for Wilson's theorem (III)
A bound for Wilson's theorem (III)
✍ Yanxun Chang πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 486 KB πŸ‘ 1 views

In this article we prove the following statement. For any positive integers k 2 3 and A, let &A) =exp{exp{k'\*}}. If Av(v -1) = 0 (mod k(k -I)) and A(v -1) = 0 (mod k -1) and v > c ( k , A), then a B(v, k , A) exists. o 1996 John Wiley & Sons, Inc. ## 1. Introduction A painvise balanced design (or

A bound for Wilson's theorem (II)
A bound for Wilson's theorem (II)
✍ Yanxun Chang πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 572 KB

In this article we prove the following theorem. For any ) ) and v -1 = 0 (mod k-1) and v > c ( k , l), then a B ( v , k , 1) exists.

A lower bound for Ramsey's theorem
A lower bound for Ramsey's theorem
✍ Joram Hirschfeld πŸ“‚ Article πŸ“… 1980 πŸ› Elsevier Science 🌐 English βš– 291 KB

For every integer tz we denote by n the set {O, 1, . . . , n -1). We denote by En]" the collection of subsets of with exactly k elements. We call the elements of [n]" k-tuples and write thein dlown as (a,, . . . , a,) in the natural order: a, < a, c l . l < ak < n. A colouting 04 [nlk by r colours i