• anonymous
Fool's problem of the day ( on request of asnaseer), probably easy , I haven't thought much, Let $$A = \{a_1, a_2 \cdots a_k\}$$ be any set of $$k$$ composite numbers such that $$1 \le a_i \le 120$$ for all $$i$$ such that $$1 \le i \le k$$. Find the least value of $$k$$ such that there exists at least one pair $$(a_i, a_j)$$, $$1\le  i, j \le  k$$ in $$A$$ which is not co prime ?
Mathematics

Looking for something else?

Not the answer you are looking for? Search for more explanations.