Question

way to arrangement of number from 9 digits from 1 to 9

score 56 · Answer 1 · 2026-04-16 11:08:57

56

Views

way to arrangement of number from 9 digits from 1 to 9

Published on 16 Apr 2026 - 11:08

score 112 · Answer 2 · 2026-04-09 02:40:11

112

Views

Constant weight vectors and their linear independence

Published on 09 Apr 2026 - 2:40

score 252 · Answer 3 · 2026-03-26 04:30:42

252

Views

How can I prove the following equality?

Published on 26 Mar 2026 - 4:30

score 83 · Answer 4 · 2026-04-12 04:35:45

83

Views

The numbers $n$ such that every sum of consecutive positive numbers ending in $n$ is not prime or A138666?

Published on 12 Apr 2026 - 4:35

score 108 · Answer 5 · 2026-04-10 21:40:37

108

Views

Alexander takes the train

Published on 10 Apr 2026 - 21:40

score 150 · Answer 6 · 2026-04-14 21:54:52

150

Views

Correct permutations of 4 pairs of parentheses

Published on 14 Apr 2026 - 21:54

score 599 · Answer 7 · 2026-04-09 21:58:50

599

Views

Is a perfect game of Set always possible?

Published on 09 Apr 2026 - 21:58

score 95 · Answer 8 · 2026-04-15 09:57:33

95

Views

Alexander goes cafeteria

Published on 15 Apr 2026 - 9:57

score 246 · Answer 9 · 2026-04-15 04:24:22

246

Views

Probabilistic/combinatoric proof of $\sum_{k=0}^{n}\binom{tk+r}{k}\binom{t(n-k)+s}{n-k}\frac{r}{tk+r}=\binom{tn+r+s}{n}$

Published on 15 Apr 2026 - 4:24

score 147 · Answer 10 · 2026-03-25 19:05:32

147

Views

If $A,B$ are in relation iff $\min A+\max B=\min B + \max A$ how many equivalence classes are in the relation?

Published on 25 Mar 2026 - 19:05

score 91 · Answer 11 · 2026-04-09 07:42:38

91

Views

Choosing a balanced subsequence

Published on 09 Apr 2026 - 7:42

score 109 · Answer 12 · 2026-04-12 08:05:05

109

Views

Hardy-Littlewood circle method applied to the binary problem

Published on 12 Apr 2026 - 8:05

score 574 · Answer 13 · 2026-04-16 00:13:06

574

Views

Number of distinct sums possible for this card question?

Published on 16 Apr 2026 - 0:13

score 321 · Answer 14 · 2026-04-11 21:02:55

321

Views

How many ways are there to choose strings of length $3$ from $S=\{1,2,3,4\}$ for $3$ people if each each digit from $S$ has to appear at least once?

Published on 11 Apr 2026 - 21:02

score 396 · Answer 15 · 2026-03-26 16:14:12

396

Views

A combinatorial identity: $\sum_{k=0}^j (-1)^k \frac{n-2k}{n-j-k} \binom{n}{k} \binom{n-j-k}{j-k} = 0$

Published on 26 Mar 2026 - 16:14

List Question

way to arrangement of number from 9 digits from 1 to 9

Constant weight vectors and their linear independence

How can I prove the following equality?

The numbers $n$ such that every sum of consecutive positive numbers ending in $n$ is not prime or A138666?

Alexander takes the train

Correct permutations of 4 pairs of parentheses

Is a perfect game of Set always possible?

Alexander goes cafeteria

Probabilistic/combinatoric proof of $\sum_{k=0}^{n}\binom{tk+r}{k}\binom{t(n-k)+s}{n-k}\frac{r}{tk+r}=\binom{tn+r+s}{n}$

If $A,B$ are in relation iff $\min A+\max B=\min B + \max A$ how many equivalence classes are in the relation?

Choosing a balanced subsequence

Hardy-Littlewood circle method applied to the binary problem

Number of distinct sums possible for this card question?

How many ways are there to choose strings of length $3$ from $S=\{1,2,3,4\}$ for $3$ people if each each digit from $S$ has to appear at least once?

A combinatorial identity: $\sum_{k=0}^j (-1)^k \frac{n-2k}{n-j-k} \binom{n}{k} \binom{n-j-k}{j-k} = 0$

Trending Questions

Popular # Hahtags

Popular Questions