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 ?
I should go to bed now, Enjoy guys :)
good night FFM
and thanks for the post
You are always welcome :)
I guess k=4.
isn't it k=2 --> {1,2} are 1 and 2 considered to be co prime?
2 is not composite.
ah! - of course - thx for pointing that out Mr.Math
Neither is 1.
I thought 1 is coprime?
but not composite
Two integers a and b are said to be coprime (also spelled co-prime) or relatively prime if the only positive integer that evenly divides both of them is 1.
What about \(A=\{4,6\}?\), that's k=2.
but 2 divides 4 and 6?
Yep, so they are NOT coprime.
As the question asked.
note to self: must learn to read the question properly!
then your answer seems to be correct.
I think so, but that was too easy. Congrats on being a moderator, they couldn't have chosen any better :-)
thx Mr.Math - I am very humbled to have been chosen. FFM did say this is quite easy, but you are right - it seems TOO easy :-)
Plus, he always says that even when it's TOO difficult. So I never trust his judgement. :D
he he - yes - I concur. I'll have to mull over this one tomorrow. it's quite late here so I need to get some sleep. bye for now...
Good night.
Oh well not that easy ;) Does \( K=2 \) or\( K=4 \) works for any co-prime in\( 1\le a_i \le 120 \) ?
Whenever I say that the problem is easy, it means that there exists a very short solution for that problem which may or may not use some well known theorems or results, and if I remember correctly I have posted only one too difficult problem here.
and now I have solved this one, I would say this is a easy problem ;)
Join our real-time social learning platform and learn together with your friends!