You are on page 1of 1

13/4/2019 Binary String

Search Results for binary string Search Community M

Binary String G H J
Arithmetic Progression counting L B Bookmark N Reply
Reason: added inequality G

Apr 8, 2016, 2:04 am #2


suli
We will prove this for . This follows by listing out all strings and verifying for
1479 posts
each one. (jk I will try to find a legit solution)

EDIT: oops, works

EDIT 2: Assuming distinct:

Let the positions be from left to right. Let be bit in position


.

Without loss of generality let there be at least 's.

Case 1. At least 1s.

Consider the three groups ; ; . By the Pigeonhole principle at least one


group has 's in all three positions. Then we are done.

Case 2. Exactly 1s.

Considering the same groups, we must have split. There are possible
cases, and they all fail.

Case 3. Exactly 1s.

Considering the same groups, we must have split. There are possible
cases, and they all fail.
This post has been edited 2 times. Last edited by suli, Apr 8, 2016, 2:18 am

Apr 8, 2016, 9:33 am #3 H


Copyright © 2019 Art of Problem Solving

https://artofproblemsolving.com/community/q1h1224124p6142338 1/1