Question

proof using pigeonhole principle

score 333 · Answer 1 · 2013-05-10 18:21:25

333

Views

proof using pigeonhole principle

Published on 10 May 2013 - 18:21

score 1.2k · Answer 2 · 2013-05-15 17:00:04

1.2k

Views

how to apply hint to question involving the pigeonhole principle

Published on 15 May 2013 - 17:00

score 143 · Answer 3 · 2013-05-20 17:23:24

143

Views

Pigeon holes principle

Published on 20 May 2013 - 17:23

score 1.8k · Answer 4 · 2013-05-21 13:42:29

1.8k

Views

Difference of two powers of $3$ divisible by $2011$

Published on 21 May 2013 - 13:42

score 142 · Answer 5 · 2013-05-23 10:35:14

142

Views

There are 50 rooms in a line. If there are 26 rooms with girls, prove there are two girls exactly 5 rooms apart.

Published on 23 May 2013 - 10:35

score 276 · Answer 6 · 2013-05-24 09:05:08

276

Views

One of $2^1-1,2^2-1,...,2^n-1$ is divisible by $n$ for odd $n$

Published on 24 May 2013 - 9:05

score 4.1k · Answer 7 · 2013-05-25 04:38:17

For any arrangment of numbers 1 to 10 in a circle, there will always exist a pair of 3 adjacent numbers in the circle that sum up to 17 or more

score 611 · Answer 8 · 2013-05-27 18:00:17

611

Views

Pigeonhole principle application sums and differences

Published on 27 May 2013 - 18:00

score 449 · Answer 9 · 2013-05-31 12:05:09

449

Views

An interesting problem using Pigeonhole principle

Published on 31 May 2013 - 12:05

score 2.8k · Answer 10 · 2013-06-09 17:26:11

2.8k

Views

Pigeonhole principle for a triangle

Published on 09 Jun 2013 - 17:26

score 320 · Answer 11 · 2013-06-11 11:33:24

320

Views

Lower bound for the number of coin weightings

Published on 11 Jun 2013 - 11:33

score 240 · Answer 12 · 2013-06-11 12:32:12

240

Views

Pigeonhole Principle Question...Fifteen different integers from 100 to 199 are given.

Published on 11 Jun 2013 - 12:32

score 972 · Answer 13 · 2013-06-15 12:17:35

972

Views

Given n numbers, prove that difference of at least one pair of these numbers is divisible by n-1

Published on 15 Jun 2013 - 12:17

score 508 · Answer 14 · 2013-06-16 02:34:53

508

Views

In a sequence of $n$ integers, must there be a contiguous subsequence that sums to a multiple of $n$?

Published on 16 Jun 2013 - 2:34

score 1.2k · Answer 15 · 2013-06-26 16:03:56

1.2k

Views

Pigeonhole principle exercises

Published on 26 Jun 2013 - 16:03

List Question

proof using pigeonhole principle

how to apply hint to question involving the pigeonhole principle

Pigeon holes principle

Difference of two powers of $3$ divisible by $2011$

There are 50 rooms in a line. If there are 26 rooms with girls, prove there are two girls exactly 5 rooms apart.

One of $2^1-1,2^2-1,...,2^n-1$ is divisible by $n$ for odd $n$

For any arrangment of numbers 1 to 10 in a circle, there will always exist a pair of 3 adjacent numbers in the circle that sum up to 17 or more

Pigeonhole principle application sums and differences

An interesting problem using Pigeonhole principle

Pigeonhole principle for a triangle

Lower bound for the number of coin weightings

Pigeonhole Principle Question...Fifteen different integers from 100 to 199 are given.

Given n numbers, prove that difference of at least one pair of these numbers is divisible by n-1

In a sequence of $n$ integers, must there be a contiguous subsequence that sums to a multiple of $n$?

Pigeonhole principle exercises

Trending Questions

Popular # Hahtags

Popular Questions