A method that is easier to understand and does not make use of the sin function is based on the fact that if $X\sim U(0,1)$ et $Y\sim U(0,1)$ then $P[X^2+Y^2\leq 1] = \pi/4$ [Mont carlo method](https://en.wikipedia.org/wiki/Monte_Carlo_method). The following code uses this approach:
A method that is easier to understand and does not make use of the sin function is based on the fact that if $X\sim U(0,1)$ et $Y\sim U(0,1)$ then $P[X^2+Y^2\leq 1] = \pi/4$ [Mont carlo method](https://en.wikipedia.org/wiki/Monte_Carlo_method). The following code uses this approach:
It is therefore straightforward to obtain a (not really good) approximation to π by counting how many times, on average, X2+Y2 is smaller than 1 :
It is therefore straightforward to obtain a (not really good) approximation to π by counting how many times, on average, $X^2 + Y^2$ is smaller than 1 :