Intereting Posts

What are the sets $S_n=\omega-n$ called?
Minimal Degree of map $S^2\times S^2\mapsto \mathbb{CP}^2$
Uniqueness of prime ideals of $\mathbb F_p/(x^2)$
Why do those terms vanish if the metric is Hermitian?
How to justify unicyclic connected graphs formula?
How to properly use technology for back-of-the-envelope calculations?
where are my calculations wrong? Expected value
Probability vs Confidence
Lifting a homomorphism
Show that $\dfrac{d}{dt}\left(ml^2\dot\theta\right)+mgl\sin\theta=l\dfrac{d^2\theta}{dl^2}+2\dfrac{d\theta}{dl}+\dfrac{g}{v^2}\theta$
Conditional convergence and Riemann's series theorem
How many lists of 100 numbers (1 to 10 only) add to 700?
Are there any good ways to see the universal cover of $GL^{+}(2,\mathbb{R})$?
Small integral representation as $x^2-2y^2$ in Pell's equation
Demonstration: If all vectors of $V$ are eigenvectors of $T$, then there is one $\lambda$ such that $T(v) = \lambda v$ for all $v \in V$.

$N$ points are placed randomly according to a uniform distribution in a $1 \times 1$ square. If $M$ is the number of points that have a distance more than $c/\sqrt{N}$ to others, then prove $\exists c,\alpha>0$ such that

$$\lim\limits_{N\to \infty}\mathbb{P}(M>\alpha N)=1$$

Besides this question, please let me know if you can find the average of $M$.

This is follow up question for this problem

- Is there a non-constant function $f:\mathbb{R}^2 \to \mathbb{Z}/2\mathbb{Z}$ that sums to 0 on corners of squares?
- Maximum area of triangle inside a convex polygon
- Shooting Game for Fun
- Maximum number of acute triangles
- How many planar arrangements of $n$ circles?
- Covering all the edges of a hypercube?

- Give a Combinatorial proof to show $\sum_{i=1}^{n}{iC(n,i)}=n2^{n-1}$
- How many $n$-digit decimal sequences (using the digits $0 = 9$) are there in which the digits $1$, $2$ and $3$ all appear?
- Selection in Circular Table
- Proof of the summation $n!=\sum_{k=0}^n \binom{n}{k}(n-k+1)^n(-1)^k$?
- Derangement of n elements
- A mouse leaping along the square tile
- Probability that two randomly chosen permutations will generate $S_n$.
- Given K balls and N buckets what is the expected number of occupied buckets
- Can the Basel problem be solved by Leibniz today?
- A combinatorial proof of Euler's Criterion? $(\tfrac{a}{p})\equiv a^{\frac{p-1}{2}} \text{ mod p}$

Let $X_i$ be the indicator variable of the event that the $i$-th point “is free”, i.e., it has a distance more than $c/\sqrt{N}$ to all others.

Then, assuming $N$ is large and we ignore “border effects” (points near the border of the square),

$$P(X_i=1)=E(X_i)= 1- \pi \frac{c^2}{N}$$

Then the expected number of total “free” points is

$$E(Y)=\sum_i E(X_i)= N -\pi c^2$$

Update: This answer was writen before the OP edited the question: This is useless now

- Is “being an integral domain” a local property?
- About sparse polynomial squares
- Cartesian Equation for the perpendicular bisector of a line
- Weird $3^n$ in an identity to be combinatorially proved
- Classification of connected subsets of the real line (up to homeomorphism)
- Characterization of Compact Space via Continuous Function
- Equivalence of induced representation
- Applying rotation invariant linear operators to spherical harmonics
- Solve a matrix equation
- Proving inequality $(a+\frac{1}{a})^2 + (b+\frac{1}{b})^2 \geq \frac{25}{2}$ for $a+b=1$
- Why do we use a Least Squares fit?
- Proof explanation of Stone-Weierstrass theorem
- Rotating x,y points 45 degrees
- Have I found an example of norm-Euclidean failure in $\mathbb Z $?
- How to change variables in a surface integral without parametrizing