Here's the problem (IMO 2013 Problem 1): Assume that k and n are two positive integers. Prove that there exist positive integers m1, ... , mk such that
# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 167 |
2 | awoo | 163 |
3 | adamant | 162 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
5 | nor | 151 |
7 | atcoder_official | 147 |
8 | TheScrasse | 146 |
9 | Petr | 145 |
10 | pajenegod | 143 |
Segment Tree Math Problem
Here's the problem (IMO 2013 Problem 1): Assume that k and n are two positive integers. Prove that there exist positive integers m1, ... , mk such that
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en13 |
![]() |
wfe2017 | 2017-02-08 19:48:16 | 71 | ||
en12 |
![]() |
wfe2017 | 2017-02-04 20:08:33 | 144 | ||
en11 |
![]() |
wfe2017 | 2017-02-04 19:35:37 | 69 | ||
en10 |
![]() |
wfe2017 | 2017-02-04 19:33:57 | 407 | ||
en9 |
![]() |
wfe2017 | 2017-02-04 14:52:33 | 604 | ||
en8 |
![]() |
wfe2017 | 2017-02-04 14:17:42 | 365 | ||
en7 |
![]() |
wfe2017 | 2017-02-04 11:16:24 | 7 | Tiny change: ' $l \leq 2\ceil(log_2' -> ' $l \leq 2 \times ceil(log_2' | |
en6 |
![]() |
wfe2017 | 2017-02-04 11:15:55 | 12 | Tiny change: 'd $l \leq log_2(k)+1$. \n\nCha' -> 'd $l \leq 2\ceil(log_2(k/2+1))$. \n\nCha' | |
en5 |
![]() |
wfe2017 | 2017-02-04 11:13:54 | 6 | Tiny change: 'er and $l <= log_2(k)+' -> 'er and $l \leq log_2(k)+' | |
en4 |
![]() |
wfe2017 | 2017-02-04 11:13:32 | 211 | ||
en3 |
![]() |
wfe2017 | 2017-02-04 11:11:40 | 1307 | (published) | |
en2 |
![]() |
wfe2017 | 2017-02-04 11:03:39 | 7 | ||
en1 |
![]() |
wfe2017 | 2017-02-04 11:03:15 | 271 | Initial revision (saved to drafts) |
Name |
---|