For questions about the study of finite or countable discrete structures, specifically how to count or enumerate elements in a set (perhaps of all possibilities) or any subset. It includes questions on permutations, combinations, bijective proofs, and generating functions.

learn more… | top users | synonyms (4)

3
votes
1answer
71 views

A Combinatorial Sum!

Is there a closed form formula for the following sum \begin{equation} F(x;n,m)=\sum_{k=0}^{\min\{n,m\}} {n \choose k}{m \choose k}k!\ x^{k}=n! \, m!\sum_{k=0}^{\min\{n,m\}}\frac{1}{k!(n-k)!(m-k)!} ...
9
votes
2answers
210 views
+200

Finding real money on a strange weighing device

You have 50 coins which each weigh either 20 grams or 10 grams. Each is labelled from 0 to 49 so you can tell the coins apart. You have one weighing device as well. At the first turn you can put as ...
0
votes
0answers
13 views

Enumerating Subspaces that Do Not Intersect a Given Subset

Consider the $n$-dimensional vector space $\mathbb F_2^n$ of $n$-tuples of elements of $\mathbb F_2$. Suppose I have a subset (not necessarily a subspace) $S\subseteq\mathbb F_2^n$ and a positive ...
1
vote
0answers
25 views

Notation for indexing the factorizations of a number?

Background Given any $n \in \mathbb{N}$, the ordered factorization count of $n$ can be computed and is traditionally written $H(n)$. This is, essentially, the number of unique decompositions of $n$ ...
0
votes
1answer
23 views

Name of the numbers defined by $T(p,q) = T(p-1,q) + T(p,q-1)$?

I came across these numbers : $$ T(p,q)= \sum_{k=0}^{q-1} {p+k-1 \choose p-1} + \sum_{l=0}^{p-1} {q+l-1 \choose q-1} \quad p,q \in \mathbb{N} $$ While trying to solve this recurrence relation : $$ ...
1
vote
2answers
20 views

Probability theory combinatoric problem

A total of $n$ bar magnets are placed end to end in a line with random independent orientations. Adjacent ends with equal polarities repel each other, and adjacent ends with opposite polarities ...
1
vote
2answers
75 views

Proving inequalities using Calculus

In general how do you prove inequalities using calculus, I believe it is using maxima or minima right? For example $$a^2b+b^2c+c^2a \le 3, \qquad a,b,c \ge 0,\quad a+b+c=3.$$ How would you use ...
4
votes
2answers
130 views

Proof sought for a sum involving binomials that simplifies to 1/2

A proof of: $$\begin{align*}(1/2)^{2m+1} \sum_{k=0}^{m} \binom{m}{k} \sum_{j=0}^{k} \binom{m+1}{j} = \frac{1}{2} \end{align*} $$ Conjecture based on the following Maple code: ...
0
votes
0answers
20 views

Mixing up seating charts: Measuring “mixedness” over time

Background: My class has $10$ students and $3$ tables; naturally, the students are distributed with $3, 3,$ and $4$ seated at the individual tables. On the second day of class, students sat in the ...
3
votes
2answers
43 views

Simplifying a combinatorial expression

Find \begin{eqnarray} \sum_{i=1}^{k-1}i(2k-2-i)\binom{2k}{2i+1} \end{eqnarray} I know how to find $\sum_{i=1}^{k-1}a_i\binom{2k}{2i+1}$ if $a_i$ is linear in $i$, but got stuck when $a_i$ is ...
8
votes
4answers
9k views

Proof a graph is bipartite if and only if it contains no odd cycles

How can we prove that a graph is bipartite if and only if all of its cycles have even order? Also, does this theorem have a common name? I found it in a maths Olympiad toolbox.
0
votes
0answers
29 views

Converting base 10 to base 52 using a bijective function

I was recently asked in an interview the following question: "How would you design a URL shortener?" My response was to store the URL into a database which provides a unique key of maximum length 10 ...
0
votes
0answers
26 views

Number of permutations on nearest neighbors

Consider a finite connected set $A \subset \mathbb{Z}^d$ and let $S_A$ be the set of permutations on nearest neighbors. Namely, the elements of $S_A$ are bijections $\pi : \, A \rightarrow A$ such ...
5
votes
3answers
85 views

Number of ways through a modified grid

I was in math class listening to my teacher blather on about solids of revolution when my friend passed me a note with a puzzle on it. It looked something like this: How many different ways can you ...
0
votes
2answers
2k views

Outcome possibilities with three teams and three outcomes for each game

So there are six teams (let's say: 1,2,3,4,5,6), and they pair up to face each other, (so three games in total). In each game, one team either wins or their is a tie. Let's set up the teams and their ...
1
vote
1answer
21 views

Cartesian product with all elements

I have two sets A and B with $A = \{1,2,3\} \\ B = \{ A, B, C, D, E \}$ Now I need to get something similar to the Cartesian product. If my understanding is correct, the Cartesian product would ...
0
votes
0answers
44 views

Number of graphs with 5 vertices

Let $v_i$ where $i=1,2,3,4,5$ be vertices of a graph. Each vertex makes only one directed edge to any other vertex. For instance $v_1 \to v_2 \to v_3 \to v_4 \to v_5 \to v_1$ and $v_1 \to v_3 \to v_4 ...
1
vote
1answer
32 views

Permutations for a set of rules

The question is from - http://www.iarcs.org.in/inoi/2015/zio2015/zio2015-question-paper.pdf - Q.2 I tried solving it but I have no clue how to go about doing it. The question says that a railway ...
5
votes
1answer
46 views

Number of representatives from states to from a comittee?

Among the three representatives to a conference from each of the fifty states, either none, one, or two of the representatives will be chosen for a large special committee. How many ways can this ...
5
votes
1answer
58 views

Function equation, find the function evaluated at the certain point.

Let $f(x)$ be a polynomial with real coefficients such that $f(0) = 1,$ $f(2)+f(3)=125,$ and for all $x$, $f(x)f(2x^{2})=f(2x^{3}+x).$ Find $f(5).$ The constant term, $a_0 = f(0) = 1$. Let: ...
0
votes
1answer
27 views
0
votes
4answers
43 views

All possible combinations

I have two sets (1,2,3) and (A,B,C,D,E). I want to calculate all possible combinations. This would be my approach: combinations with a single 1: ...
5
votes
1answer
87 views

The vertices of the $n$-cube are painted in two colors

The vertices of the $n$-dimensional cube are painted in two colors. The number of vertices of each color is the same ($2^{n-1}$). Prove that at least $2^{n-1}$ edges connect vertices of different ...
10
votes
3answers
309 views

Proof of the identity $\sum_{k=0}^{\min[p,q]}{p\choose k}{q\choose k}{n+k\choose p+q}={n\choose p}{n\choose q}$

Prove the identity: $$\sum_{k=0}^{\min[p,q]}{p\choose k}{q\choose k}{n+k\choose p+q}={n\choose p}{n\choose q}.$$
3
votes
2answers
123 views

Proving the combinatorial identity: $\sum_{k=0}^m (-1)^k 2^{2k-1}\left[{m+k-1\choose 2k}+{m+k\choose 2k}\right]=(-1)^m$

Let $m$ be a positive integer. I have trouble proving that $$\sum_{k=0}^m (-1)^k 2^{2k-1}\left[{m+k-1\choose 2k}+{m+k\choose 2k}\right]=(-1)^m$$ Anyone?
1
vote
0answers
42 views

How to give a rigorous proof of a fact about convex polygon?

I claim that there exists universal constants $0<\delta_1(m), \delta_2(m)<1$ such that for any convex polygon $P$ in $\mathbb{R}^n$ with $m$ faces, \begin{equation} \frac{\mathcal{H}^{n-1}(\{x ...
1
vote
3answers
50 views

What is the number of mappings?

It is given that there are two sets of real numbers $A = \{a_1, a_2, ..., a_{100}\}$ and $B= \{b_1, b_2, ..., b_{50}\}.$ If there is a mapping $f$ from $A$ to $B$ such that every element in $B$ has an ...
9
votes
2answers
207 views
+50

How do I prove this combinatorial identity using inclusion and exclusion principle?

$$\binom{n}{m}-\binom{n}{m+1}+\binom{n}{m+2}-\cdots+(-1)^{n-m}\binom{n}{n}=\binom{n-1}{m-1}$$ Note that we can show this with out using inclusion and exclusion principle by using Pascal's Identity ...
5
votes
5answers
185 views

Binomial coefficients in Geometric summation

Guys please help me find the sum given below. $$\sum_{k=j}^i\binom{i}{k}\binom{k}{j}\cdot 2^{k-j}$$ (NOTE):The two coefficients are multiplied by 2 power (k-j) I am using the formula: ...
1
vote
1answer
19 views

Optimize order of a list based on time to complete, probability of success

I'm a programmer participating in a coding challenge, but I'm not up on my advanced math. I'm currently working on a solution to a problem, and have a semi-functional program, but I'm still missing a ...
0
votes
0answers
18 views

Determine $ex(n,P_k)$ for each pair of n and k

I have to find the maximum number of edges in $P_k$ free graph where $P_k$ is path of length $k$. I know the result that a graph on $n$ vertices with no path of length $k$ has edges$\ \le ...
1
vote
0answers
32 views

How to manipulate the bound on the summation

$$ B_n^{f^2}(x) = \sum_{k=1}^n\sum_{j=0}^{n-k} 2^{k-j} {j+k \choose j} \frac{d^j}{df^j}[f^k] B_{n,j+k}^f(x) $$ I am looking to have the bounds switched, can someone show me exactly how this is done? ...
0
votes
1answer
33 views

Chains of people names

Consider the set $X$ of possible names for people. Let $(x, y) \in P$ (in the partial order) if and only if $x$ ends in a consonant and $y$ ends in a vowel. What is the length of the longest ...
0
votes
0answers
16 views

Minimal posets and chains [on hold]

Given a poset (X, P ) we can say that an element x ∈ X is minimal if it doesn’t cover any other element y ∈ X. Think about the relation between finding a maximal chain and the minimal elements. Isn't ...
3
votes
2answers
75 views

Partitioning $\{1,2,\cdots ,n\}$ into $2$ sets guarantees $3$ numbers $a,b,c$ in the same set with $ab=c$ for some $n$

(ISL-20-$1988$) Find the least natural number $ n$ such that, if the set $ \{1,2, \ldots, n\}$ is arbitrarily divided into two non-intersecting subsets, then one of the subsets contains 3 distinct ...
3
votes
1answer
27 views

How many ways can I connect labeled trees into a tree.

Suppose I have the labeled trees $T_{1}, \ldots, T_{n}$ with $b_{1}, \ldots, b_{n}$ vertices respectively. I would like to know how many ways I can compose a tree from these trees by using all trees? ...
2
votes
1answer
112 views

Catalan's number with a twist

We all know that $$C_n = \frac{1}{n+1} {2n \choose n} $$ But what if I want to calculate the same property of catalan, but with number of zeros is $s$ and number of ones is $t$ when $s\neq t$? As ...
10
votes
4answers
1k views

N gunmen in a field

Let n be an odd integer. In some field, n gunmen are placed such that all pairwise distances between them are different. At a signal, every gunman takes out his gun and shoots the closest gunman. ...
-1
votes
1answer
42 views

Probability of winning consecutively [on hold]

India and USA play $7$ football matches. No match ends in a draw. Both the countries are of same strength. Find the probability that India wins at least $3$ consecutive matches.
0
votes
1answer
53 views

Number of combinations where the sum of values must be the same

My question is as follows: let there be $n$ different numbers $a_i$ in a set $A$, where each $a_i$ is a number between 0 and 1. How many different sets of values can I have that fulfill the condition ...
7
votes
2answers
145 views

Expand $\binom{xy}{n}$ in terms of $\binom{x}{k}$'s and $\binom{y}{k}$'s

Motivated by this question, I want to find a complete set of relations for the ring of integer-valued polynomials, where the generators are the polynomials $\binom{x}{n}$ for $n\in \mathbb{N}$. The ...
4
votes
2answers
61 views

No Adjacency Combinatorics Problem via Generating Function

I would like to find the generating function solution for the following combinatorics/probability problem. I have a combinatorial solution and the generating function deduced thereof. But I can not ...
3
votes
4answers
63 views

How to solve this combinatorics problem?

As a tourist in NY, I want to go from the Grand Central Station (42nd street and 4th Avenue) to Times Square (47th street and 7th Avenue). I needed my morning coffee, and wanted to go to a Starbucks ...
1
vote
1answer
25 views

What is this 2-D array of numbers called?

Define $c(n,r)$ ($n\in\Bbb N;r\in\Bbb Z$) by setting $c(0,-1)=-1$, $c(0,0)=1$, and $c(0,r)=0$ otherwise, with all further $c(n, r)$ given recursively by $$c(n+1,r)=rc(n,r-1)-(r+1)c(n,r)$$(rather in ...
1
vote
0answers
32 views

Combination estimation

I am looking at a proof where part of it derives an estimation for the number of combinations and I cant understand how the following step is derived: $\varepsilon^{-\varepsilon L}\underset{j \leq ...
4
votes
3answers
331 views

Students in a class, girls sitting with boys and boys sitting with girls

This is a very interesting word problem that I came across in an old textbook of mine. So I mused over this problem for a while and tried to look at the different ways to approach it but unfortunately ...
0
votes
2answers
65 views

Summation of special series

Does anybody know how to evaluate $$\sum_{i=2}^n(i^2)\cdot{i\choose2}$$ How about the general case of $(i^k)*{i\choose2}$? A nice formula would be great!
1
vote
3answers
102 views

Binomial Sum: Values

I need this as lemma. Regard the sums: $$S_k:=\sum_{n=0}^N\binom{N}{n}(-1)^{N-n}n^k\quad(k\in\mathbb{N}_0)$$ Then it holds: $$S_k\stackrel{k<N}{=}0\quad S_k\stackrel{k=N}{=}N!$$ How can I check ...
1
vote
0answers
98 views

Maths puzzle 1: smart play with sets

Let $$X=\{ a, b, c, d, e, f, {ab}, {ac}, {ad}, {ae}, {af}, {bc}, {bd}, {be}, {bf}, {cd}, {ce}, {cf}, {de}, {df}, {ef}, {abc}, {abd}, {abe}, {abf}, {acd}, {ace}, {acf}, {ade}, {adf}, {aef}, {bcd}, ...
2
votes
0answers
11 views

There are $m$ distinct sets of $k$ positive integers such that no two form a fat pair, show that $m<n^{k-1}$.

[ELMO 2015] Let $m, n, k > 1$ be positive integers. For a set $S$ of positive integers, define $S(i,j)$ for $i<j$ to be the number of elements in $S$ strictly between $i$ and $j$. We say two ...