Question

combinatorics - permutations question, possibly with pigeon hole

score 79 · Answer 1 · 2014-02-07 17:06:18

79

Views

combinatorics - permutations question, possibly with pigeon hole

Published on 07 Feb 2014 - 17:06

score 250 · Answer 2 · 2014-02-08 13:50:50

250

Views

Choosing $2n-1$ points from $n\times n$ grid such that $3$ points always form a right triangle

Published on 08 Feb 2014 - 13:50

score 714 · Answer 3 · 2014-02-09 08:19:57

714

Views

Prove a number is even using the Pigeonhole Principle

Published on 09 Feb 2014 - 8:19

score 159 · Answer 4 · 2014-02-09 18:24:26

159

Views

Prove, that in the subset of $\{1,\ldots,150\}$ there are two disjoint pairs with the same sums.

Published on 09 Feb 2014 - 18:24

score 1.6k · Answer 5 · 2014-02-09 23:37:10

1.6k

Views

Proving the Chinese Remainder Theorem using the Pigeonhole Principle

Published on 09 Feb 2014 - 23:37

score 649 · Answer 6 · 2014-02-11 13:33:05

649

Views

What Does "less than or equal to 1 apart" Mean?

Published on 11 Feb 2014 - 13:33

score 228 · Answer 7 · 2026-03-27 18:08:21

228

Views

Combinatorial Question using ramsey's theory or pigeonhole principle??

Published on 27 Mar 2026 - 18:08

score 305 · Answer 8 · 2014-02-12 07:47:46

305

Views

If $n\nmid a,a+d,a+2d. . . a+(n-1)d$,then $(n,d)=1$

Published on 12 Feb 2014 - 7:47

score 3.9k · Answer 9 · 2014-02-12 21:10:53

3.9k

Views

If n is an odd integer, show there exists a positive integer k such that 2^k mod n = 1.

Published on 12 Feb 2014 - 21:10

score 12.3k · Answer 10 · 2014-02-13 22:40:31

12.3k

Views

if there are 5 points on a sphere then 4 of them belong to a half-sphere.

Published on 13 Feb 2014 - 22:40

score 510 · Answer 11 · 2014-02-14 12:09:37

510

Views

If one eats $100$ chocolates in $58$ days,then he must be eating exactly 15 chocolates in some consecutive days

Published on 14 Feb 2014 - 12:09

score 159 · Answer 12 · 2014-02-15 00:49:22

159

Views

Proving something using Pigeonhole Principle

Published on 15 Feb 2014 - 0:49

score 534 · Answer 13 · 2014-02-15 19:27:12

534

Views

$n$ be an odd integer and $f$ be a permutation of $\{1,2,\dots,n\}$.Show that the number $x = (1-f(1))\cdot(2-f(2))\cdot...(n-f(n))$ is even.

Published on 15 Feb 2014 - 19:27

score 1.4k · Answer 14 · 2014-02-17 15:49:01

1.4k

Views

pigeonhole principle For 1-1 and onto function

Published on 17 Feb 2014 - 15:49

score 327 · Answer 15 · 2014-02-18 05:18:32

327

Views

$2^n$ modulo n where n is odd always yields either an even or $1$

Published on 18 Feb 2014 - 5:18

List Question

combinatorics - permutations question, possibly with pigeon hole

Choosing $2n-1$ points from $n\times n$ grid such that $3$ points always form a right triangle

Prove a number is even using the Pigeonhole Principle

Prove, that in the subset of $\{1,\ldots,150\}$ there are two disjoint pairs with the same sums.

Proving the Chinese Remainder Theorem using the Pigeonhole Principle

What Does "less than or equal to 1 apart" Mean?

Combinatorial Question using ramsey's theory or pigeonhole principle??

If $n\nmid a,a+d,a+2d. . . a+(n-1)d$,then $(n,d)=1$

If n is an odd integer, show there exists a positive integer k such that 2^k mod n = 1.

if there are 5 points on a sphere then 4 of them belong to a half-sphere.

If one eats $100$ chocolates in $58$ days,then he must be eating exactly 15 chocolates in some consecutive days

Proving something using Pigeonhole Principle

$n$ be an odd integer and $f$ be a permutation of $\{1,2,\dots,n\}$.Show that the number $x = (1-f(1))\cdot(2-f(2))\cdot...(n-f(n))$ is even.

pigeonhole principle For 1-1 and onto function

$2^n$ modulo n where n is odd always yields either an even or $1$

Trending Questions

Popular # Hahtags

Popular Questions