Intereting Posts

Every alternating permutation is a product of 3-cycles
Let $(s_n)$ be a sequence of nonnegative numbers, and $\sigma_n=\frac{1}{n}(s_1+s_2+\cdots +s_n)$. Show that $\liminf s_n \le \liminf \sigma_n$.
Poincaré lemma on a space with trivial homology group
Show $a_{n+1}=\sqrt{2+a_n},a_1=\sqrt2$ is monotone increasing and bounded by $2$; what is the limit?
Conditional expectation for a sum of iid random variables: $E(\xi\mid\xi+\eta)=E(\eta\mid\xi+\eta)=\frac{\xi+\eta}{2}$
Can a finite axiomatization of PA be expressed in a finitely axiomatizable first order set theory?
Integral $\int_0^\infty \log^2 x\frac{1+x^2}{1+x^4}dx=\frac{3 \pi^3}{16\sqrt 2}$
Intuition about the second isomorphism theorem
Prove that if f is a continuous strictly monotone function defined on an interval, then its inverse is also a continuous function.
Solving a Recurrence Relation/Equation, is there more than 1 way to solve this?
Trying to generalize an inequality from Jitsuro Nagura: Does this work?
Is the differentiation operator an open mapping?
What's the order of growth of the 'double-and-rearrange' numbers?
Associativity of norms in inseparable extensions
Area enclosed by an equipotential curve for an electric dipole on the plane

2 teams play a match of Volleyball

During the course of the game, each team gets points, and thus increases its score by 1.

The initial score is 0 for both teams.

- Combination problem distributing
- Tiling of regular polygon by rhombuses
- Number of subsets of size $k$ whose pairwise intersection is of given size j
- There are $6$ types of cookies. How many different packs of $3$ cookies can the baker package?
- Improvised Question: Combination of selection of pens
- Fixed sum of combinations

The game ends when:

- One of the teams gets 25 points and another team has < 24 points (

strictly less than 24). - If the score ties at 24:24, the teams

continue to play until the absolute difference between the scores is

2.

Given the final score of a game in the format *A*:*B* i.e., the first team has scored *A* points and the second has scored *B* points, can you print the number of different sequences of getting points by teams that leads to this final score?

- How many different combinations of a six sided die rolls equals n
- How many ways to put 20 things to different 4 boxes?
- Improvised Question: Combination of selection of pens
- How many solutions are there to $x_1 + x_2 + … + x_5 = 21$?
- How many 90 ball bingo cards are there?
- Distinct digits in a combination of 6 digits
- Classic 10 Balls into 4 boxes problem
- Interpretation of a combinatorial identity
- Balls in bins, probability that exactly two bins are empty
- How many $10$ digit number exists that sum of their digits is equal to $15$?

Yes, that is possible. Hint: for an arbitrary standing A:B, where it is not clear who made the last point, there are $\binom{A+B}{A}$ possibilities, if both A and B are below 25.

if one of them is equal to or more than 25, then there are some exceptions.

**Case 1**: 25:B with B<24, then we know the last point was from the winning team, so there are $\binom{24+B}{B}$ possibilities

**case 2**: B+2:B with B>23, then we know that at one point it was 24:24, so we have $\binom{48}{24} 2^{B-24}$ possibilites, because there are two options every two points.

Here’s a recursive programming solution in pseudo-code

Define NumScores(A,B):

If A=0 and B=0, return 1

Else If A<0 or B<0, return 0

Else If A<25 and B<25, return NumScores(A-1,B) + NumScores(A,B-1)

Else If |A-B|>1, return 0

Else return NumScores(A-1,B) + NumScores(A,B-1)

This should work so long as for your initial input for A and B you subtract 1 from the winning score, since that was the only possible previous score.

- Let $f : X \to Y$ be a function and $E \subseteq X$ and $F \subseteq X$. Show that in general
- Probability a die will come up 6 at least twice in twelve rolls
- Understanding an example from Hatcher – cellular homology
- Working with Equivalence Classes and Quotient Sets
- (Anti-) Holomorphic significance?
- Probability of 20 consecutive success in 100 runs.
- Proving the Poincare Lemma for $1$ forms on $\mathbb{R}^2$
- A holomorphic function is conformal
- How to find the Laplacian Eigen Values of the given graph
- Restrictions on the faces of a $3$-regular planar graph
- Mean Value of a Multiplicative Function close to $n$ in Terms of the Zeta Function
- Derivative of Fourier transform: $F'=F$
- Coloring $\mathbb R^n$ with $n$ colors always gives us a color with all distances.
- Showing that a collection of sets is a $\sigma$-algebra: either set or complement is countable
- If H ≤ Z(G) ≤ G, where G is a finite group,Z(G) is its center, and (G:H) = p for some prime p, then G is abelian.