scientific article; zbMATH DE number 3573945
[For the entire collection see Zbl 0345.00007.] Most of the problems posed in this French paper also appear in the collection discussed in the previous review. One problem not in the above collection is the following. Let \(1\leq a_1< a_2< \dots< a_k\leq n\) be a sequence of \(k\) integers in which one cannot find \(r\) numbers \(a_1\) which are pairwise relatively prime. Then one obtains the largest possible value of \(k\) by considering all numbers which have at least one prime factor \(\leq p_{r-1}\), where 2,3,..., \(p_{r-1}\) are the first \(r-1\) prime numbers. The case \(r = 2\) is well known.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4145771)