On the coloring of 3-element subsets
Abstract
In this paper we prove that for numbers n = 8k+1, such that 8k-1 is prime, there exists the coloring of all 3-element subsets of 1, ..., n such that any sets A, B: |A B|=2 have different colors.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.