Advance P-4(BOMC-2)
-
- Posts:461
- Joined:Wed Dec 15, 2010 10:05 am
- Location:Dhaka
- Contact:
Set $S$ = {$105, 106, . . . , 210$}. Determine the minimum value of $n$ such that any $n$-element subset $T$ of $S$ contains at least two non-relatively prime elements.
You spin my head right round right round,
When you go down, when you go down down......(-$from$ "$THE$ $UGLY$ $TRUTH$" )
When you go down, when you go down down......(-$from$ "$THE$ $UGLY$ $TRUTH$" )
Re: Advance P-4(BOMC-2)
Isn't it quite bruteforce?
Please read Forum Guide and Rules before you post.
Use $L^AT_EX$, It makes our work a lot easier!
Nur Muhammad Shafiullah | Mahi
Use $L^AT_EX$, It makes our work a lot easier!
Nur Muhammad Shafiullah | Mahi
-
- Posts:461
- Joined:Wed Dec 15, 2010 10:05 am
- Location:Dhaka
- Contact:
Re: Advance P-4(BOMC-2)
I don't think so. A small effective trick really kills the problem
First intuition
Trick
First intuition
You spin my head right round right round,
When you go down, when you go down down......(-$from$ "$THE$ $UGLY$ $TRUTH$" )
When you go down, when you go down down......(-$from$ "$THE$ $UGLY$ $TRUTH$" )
Re: Advance P-4(BOMC-2)
Nevermind, but that seemed trivial to me, even then (maybe because I'm too lazy) it seemed to me that finding the final set was bruteforce.
Please read Forum Guide and Rules before you post.
Use $L^AT_EX$, It makes our work a lot easier!
Nur Muhammad Shafiullah | Mahi
Use $L^AT_EX$, It makes our work a lot easier!
Nur Muhammad Shafiullah | Mahi
- Niloy Da Fermat
- Posts:33
- Joined:Wed Mar 21, 2012 11:48 am
Re: Advance P-4(BOMC-2)
is there any tricky solution?i did tedious job like
the answer is
kame......hame.......haa!!!!
Re: Advance P-4(BOMC-2)
@Niloy-
I don't think so. I think that was the least tedious way of solving this problem.
I don't think so. I think that was the least tedious way of solving this problem.
Please read Forum Guide and Rules before you post.
Use $L^AT_EX$, It makes our work a lot easier!
Nur Muhammad Shafiullah | Mahi
Use $L^AT_EX$, It makes our work a lot easier!
Nur Muhammad Shafiullah | Mahi