Intereting Posts

If a topological space $X$ is $E_{2}$ (second-countable), then it's separable.
Consider the function, f and its second derivative:
Visibility and Kernel of Polygon
An interesting identity involving powers of $\pi$ and values of $\eta(s)$
definition of winding number, have doubt in definition.
Does “continuous + only at countable many points not differentiable (with bounded derivative)” imply Lipschitz-continuity?
Trying to get a bound on the tail of the series for $\zeta(2)$
Prove that $ x_1+ \dotsb + x_k=n, \frac1{x_1}+ \dotsb + \frac1{x_k}=1$
Can the real numbers be forced to have arbitrary cardinality?
The Determinant of an Operator Equals the Product of Determinants of its Restrictions
Isotropy over $p$-adic numbers
Formula for trace of compact operators on $L^2(\mathbb{R})$ given by integral kernels?
Calculus of residue of function around poles of fractional order (complex analysis)
Kostrikin's Definition of Tensor Product
how many ways can the letters in ARRANGEMENT can be arranged

A certain chessboard is infinite in size. There is a frog sitting in the center of every square. After a certain time, all the frogs jump such that

- They may jump to any possible square in the infinite chessboard
- They may jump and land at the same square again

Prove that its possible for all the frogs to jump simultaneously such that there are exactly two frogs per square after the jump.

Let there be n frogs sitting on n squares where $n\rightarrow \infty$

- how many distinct values does it have?
- Transversals of Latin Squares
- Proofs of $\lim\limits_{n \to \infty} \left(H_n - 2^{-n} \sum\limits_{k=1}^n \binom{n}{k} H_k\right) = \log 2$
- How are the pigeonholes calculated in this pigeon-hole problem?
- Arrange $n$ people so that some people are never together.
- The number of ways to write a positive integer as the sum of distinct parts with a fixed length

Lets choose our king frog who’s sitting at a particular square, now

CASE I: King frog wants to stay at his original square, then its probability is $\frac { 1 }{ n } $. Then we are left with n-1 frogs who have n squares left. I am stuck at this point, I know the probability of remaining frogs to choose king’s square is $\frac { n-1 }{ n }$ but how to proceed after that?

CASE II: King frog doesn’t want to stay at his original square, then he has $n-1$ ways to go, also the probability of remaining of the n-1 frogs to land at king’s square is $\frac { n-1 }{ n } $. So we have

$$\lim _{ n\rightarrow \infty }{ \frac { n(n-1) }{ n } } $$

- Pólya’s Enumeration Theorem and chemical compounds
- Limit of alternating sum with binomial coefficient
- Should you ever stop rolling, THE SEQUEL
- Counting two ways, $\sum \binom{n}{k} \binom{m}{n-k} = \binom{n+m}{n}$
- Sum of differences of permutation in circle
- Proving a binomial sum identity $\sum _{k=0}^n \binom nk \frac{(-1)^k}{2k+1} = \frac{(2n)!!}{(2n+1)!!}$
- conditional probability of an ace being drawn and then a king
- The number of equivalence classes of finite symmetric difference relation
- Expanding and understanding the poison pills riddle
- Showing $\cos(t^2)$ is not a Characteristic Function

Suppose you describe the squares of the board $B$ using integer coordinates:

$$

B

= \{(x,y) \mid x,y \in \mathbb{N}\}.

$$

Use the following map, which I will describe in steps: first map

$$

(x,0),(x,1) \mapsto (x,0) \quad \forall x \geq 0;

$$

this takes care of the first row, each square of which now has exactly $2$ frogs occupying it. Next map

$$

(x,2),(x,3) \mapsto (x,1) \quad \forall x \geq 0;

$$

this takes care of the second row, each square of which now has exactly $2$ frogs occupying it. In general, the map is

$$

(x,2i),(x,2i+1) \mapsto (x,i) \quad \forall x \geq 0, i \geq 0.

$$

I think you can see this will have exactly the property you want!

This problem has nothing to do with probability, but your idea of picking a king frog is useful. Starting with the king frog, enumerate both frogs and squares in a spiral (like the starting point for Ulam’s spiral). Then simply have frogs 1 and 2 jump to square 1, frogs 3 and 4 jump to square 2, and so forth.

Think about doing it for one layer of the chess board. It may be helpful to split the layer into two parts. I.e consider the split line being the natural numbers. Tell 0 to jump and 1 to move 1 left. Tell 2 to move 1 left and 3 to move 2 left…. tell $2n$ to move n left and $2n+1 $to move $n+1$ left.

Find a similar algorithm for $\{-1,-2,-3,\ldots\}$. And then just order that this rule should be followed on all levels of the chess board.

- Computing the order of $dx$ at the infinity point of an elliptic curve
- Showing that $f = 0 $ a.e. if for any measurable set $E$, $\int_E f = 0$
- Find $B$ if $AB=BC$ and $A,C$ are invertible
- Book to prepare for university math?
- Notation for modulo: congruence relation vs operator
- Prove the following series $\sum\limits_{s=0}^\infty \frac{1}{(sn)!}$
- Necessary and sufficient condition for Integrability along bounded variation
- Uniform convergence problem
- Proof on a conjecture involving $d(N)$
- Open mapping theorem and second category
- What is the outer measure of Vitali set?
- Closed-Form Solution to Infinite Sum
- Find all integers satisfying $m^2=n_1^2+n_1n_2+n_2^2$
- Does the symmetry of a parabola in finding the maximum area of a rectangle under said parabola matter?
- Problem with counting method – full house