Skip to main content
AspiringMat's user avatar
AspiringMat's user avatar
AspiringMat's user avatar
AspiringMat
  • Member for 8 years, 6 months
  • Last seen this week
8 votes
Accepted

Proof that a Kernel of a Linear Mapping is a Subspace

7 votes
Accepted

Arithmetic or Geometric sequence?

7 votes

Prove ${2n \choose n+i} \geq e^{-8 i^2/n} {2n \choose n}$

6 votes

Black queens on $n\times n$ board

5 votes

Proof by contraposition. Let $x$ be an integer. If $8$ does not divide $x^2-1$, then $x$ is even.

3 votes
Accepted

Suppose that $1< b< 2$ is a fixed constant, show that $n^b \times \prod_{k=2}^{n} (1-\frac{b}{k} ) \space \space \forall n\ge 2$ is bounded.

3 votes
Accepted

Is a mean of two expectation value still an expectation value?

3 votes

how to make the objective value of primal program close to zero

3 votes
Accepted

ISBN show that $x_{10}=\sum^{9}_{i=1} ix_i$

3 votes
Accepted

Upper bound on $x_{i+1} = x_i (1-(1-\frac{1}{n})^{x_{i}-1})$ with $x_0=n$

3 votes

A $a\times b \times c$ cube formed by small $1^3$ cubes. If a laser beam travels along the diagonal of the cube, how many small cubes does it cross?

3 votes

Intermediate Value theorem inequality problem

2 votes

What is a Jacobian?

2 votes

number coefficients of an infinite root of 2

2 votes

How can you prove that $\lim_{x \to \infty} \frac{x^{100}}{1.01^x} = 0$ using definition of limit?

2 votes
Accepted

Determine the biggest summand of a special sum of binomial coeffients

2 votes
Accepted

Stable marriage problem with all men having the same preference (2)

2 votes
Accepted

Interesting combinatorics problem from 1977 All Soviet Union Mathematical Olympiad

2 votes

Prove that the following inequality is true for all $m \in (0, 3)$

1 vote

Inequality proof $\prod_{cyc} (ab+1)$

1 vote

Distance between a given point and a convex polytope

1 vote

I need the combinatorial proof for the following identity

1 vote
Accepted

Given an $n$-element family $\mathcal{S}$ of average size $r$, is $\sum |S_i \cap S_j|\geq n\binom{r}{2}$?

1 vote

In how many ways can 30 identical balls be distributed into 6 distinct boxes (numbered box 1, ... , box 6) where each box gets an odd number of balls?

1 vote
Accepted

Equality between maximal matching and minimum vertex cover

1 vote

Minimize $\text{Cost}(j_1, ..., j_n)=\sum_{i=1}^{n-1}T_{j_i}\left( \sum_{k=i+1}^{n}L_{j_k} \right)$

1 vote

Dynamic programming algorithm

1 vote
Accepted

construct graph using max flow algorithm

1 vote

Dynamic Time Warping

1 vote

Necessary and sufficient condition for determining unique max flow