Vrijeme: 22:16
Pa to je strašno | Well that's scary. #4
Neka je
prirodan broj i neka je
najmanji prirodan broj tako da za svaki pozitivan prirodan broj
, u bilo kojem podskupu od
elemenata od skupa
postoji barem 3 po parovima relativno prosta broja.
Odredi
.





Odredi

Let
be a positive integer and let
be the smallest number such that for every positive integer
, in any subset of
elements of the set
there exist 3 pairwise relatively prime numbers.
Determine
.





Determine
