MathDB

another nice 4-th problem proposed by Romania, not so hard

Source: bmo 1990

April 23, 2007

functioncombinatorics proposedcombinatorics

Problem Statement

Find the least number of elements of a finite set

A

such that there exists a function

f : \left\{1,2,3,\ldots \right\}\rightarrow A

with the property: if

i

and

j

are positive integers and

i-j

is a prime number, then

f(i)

and

f(j)

are distinct elements of

A