MathDB

Partition of {2,3,...,k} into two product free sets

Source: 2019 Baltic Way P7

November 18, 2019

combinatorics

Problem Statement

Find the smallest integer

k \geq 2

such that for every partition of the set \{2, 3,\hdots, k\} into two parts, at least one of these parts contains (not necessarily distinct) numbers

a

b

and

c

with

ab = c