Question

Pigeonhole Principle: How many three-digit bit strings must we choose to be sure two of them agree on at least one digit?

score 175 · Answer 1 · 2017-12-10 04:23:16

175

Views

Pigeonhole Principle: How many three-digit bit strings must we choose to be sure two of them agree on at least one digit?

Published on 10 Dec 2017 - 4:23

score 121 · Answer 2 · 2017-12-10 05:13:42

121

Views

Show that there are two distinct positive integers such that: $1394|2^a-2^b$

Published on 10 Dec 2017 - 5:13

score 818 · Answer 3 · 2017-12-10 10:34:52

818

Views

Existence of a Fibonacci number divisible by $10^n$

Published on 10 Dec 2017 - 10:34

score 66 · Answer 4 · 2017-12-11 07:00:37

66

Views

Pigeon Hole Principle problem

Published on 11 Dec 2017 - 7:00

score 63 · Answer 5 · 2017-12-12 07:54:12

63

Views

What is the smallest number of integers in a list to guarantee two subsets of the integers have the same sum?

Published on 12 Dec 2017 - 7:54

score 490 · Answer 6 · 2026-03-29 05:49:53

490

Views

Pigeonhole principle with primes

Published on 29 Mar 2026 - 5:49

score 518 · Answer 7 · 2017-12-14 08:12:52

518

Views

Given 7 arbitrary integers,sum of 4 of them is divisible by 4

Published on 14 Dec 2017 - 8:12

score 468 · Answer 8 · 2017-12-14 16:59:43

468

Views

Different approach to classic pigeonhole principle problem yields different results. Why?

Published on 14 Dec 2017 - 16:59

score 71 · Answer 9 · 2017-12-14 18:11:44

71

Views

Among $26$ divisors of $120^4$ there is a pair that one of them divides the other

Published on 14 Dec 2017 - 18:11

score 739 · Answer 10 · 2017-12-15 05:39:11

739

Views

Among any $11$ integers, sum of $6$ of them is divisible by $6$

Published on 15 Dec 2017 - 5:39

score 1.4k · Answer 11 · 2026-04-02 07:09:59

1.4k

Views

Perfect square product among 17 integers

Published on 02 Apr 2026 - 7:09

score 536 · Answer 12 · 2017-12-15 18:58:45

536

Views

Maximum size of a subset S of $\{1,2,...,9\}$ such that sum of each of two members are distinct

Published on 15 Dec 2017 - 18:58

score 453 · Answer 13 · 2017-12-16 10:03:43

453

Views

Subset containing a power of 2 or two members having a sum equal to a power of 2

Published on 16 Dec 2017 - 10:03

score 2.6k · Answer 14 · 2017-12-16 17:32:15

51 points lie inside a square of side 1. Prove that it's possible to draw a circle of radius $\frac17$ so that it covers at least 3 of the points.

score 43 · Answer 15 · 2017-12-16 19:30:09

43

Views

Area of occluded carpets

Published on 16 Dec 2017 - 19:30

List Question

Pigeonhole Principle: How many three-digit bit strings must we choose to be sure two of them agree on at least one digit?

Show that there are two distinct positive integers such that: $1394|2^a-2^b$

Existence of a Fibonacci number divisible by $10^n$

Pigeon Hole Principle problem

What is the smallest number of integers in a list to guarantee two subsets of the integers have the same sum?

Pigeonhole principle with primes

Given 7 arbitrary integers,sum of 4 of them is divisible by 4

Different approach to classic pigeonhole principle problem yields different results. Why?

Among $26$ divisors of $120^4$ there is a pair that one of them divides the other

Among any $11$ integers, sum of $6$ of them is divisible by $6$

Perfect square product among 17 integers

Maximum size of a subset S of $\{1,2,...,9\}$ such that sum of each of two members are distinct

Subset containing a power of 2 or two members having a sum equal to a power of 2

51 points lie inside a square of side 1. Prove that it's possible to draw a circle of radius $\frac17$ so that it covers at least 3 of the points.

Area of occluded carpets

Trending Questions

Popular # Hahtags

Popular Questions