The official editorial of the Half Sequence says
This
Reason they give
But, what is the proof behind it? I mean what is the intution behind saying this? Can someone give a formal proof for it.
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 142 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 135 |
| 8 | BledDest | 132 |
| 8 | maroonrk | 132 |
| 10 | qwexd | 129 |
What is the proof behind Half Sequence's Solution (Codechef Cook-Off) ?
The official editorial of the Half Sequence says
For N > 18 (practically, even 16), remove all odd numbers from the input. If we have atleast (N+1)/2 elements remaining and if their GCD is 1 then we have a solution.
Observe that any single number (<=10^9) can be made up of atmost 9 distinct prime numbers. This means that if GCD([B_0, B_1,..., B_N]) = 1, then there must exist atleast one subset of length at most 9 whose elements have GCD=1.
But, what is the proof behind it? I mean what is the intution behind saying this? Can someone give a formal proof for it.
| Name |
|---|


