$x$ and $y$ are chosen at random (with uniform density) from the interval $(0, 1)$. What is the probability that the closest integer to $x/y$ is even?

Let $ 2n$ distinct points on a circle be given. Arrange them into disjoint pairs in an arbitrary way and join the couples by chords. Determine the probability that no two of these $ n$ chords intersect. (All possible arrangement into pairs are supposed to have the same probability.)

An unfair coin, which has the probability of $a\ \left(0<a<\frac 12\right)$ for showing $Heads$ and $1-a$ for showing $Tails$, is flipped $n\geq 2$ times. After $n$-th trial, denote by $A_n$ the event that heads are showing on at least two times and by$B_n$ the event that are not showing in the order of $tails\rightarrow heads$, until the trials $T_1,\ T_2,\ \cdots ,\ T_n$ will be finished . Answer the following questions: (1) Find the probabilities $P(A_n),\ P(B_n)$. (2) Find the probability $P(A_n\cap B_n )$. (3) Find the limit $\lim_{n\to\infty} \frac{P(A_n) P(B_n)}{P(A_n\cap B_n )}.$ You may use $\lim_{n\to\infty} nr^n=0\ (0<r<1).$

A coastal battery sights an enemy cruiser lying one kilometer off the coast and opens fire on it at the rate of one round per minute. After the first shot, the cruiser begins to move away at a speed of $ 60$ kilometers an hour. Let the probability of a hit be $ 0.75x^{ \minus{} 2}$, where $ x$ denotes the distance (in kilometers) between the cruiser and the coast ($ x\geq 1$), and suppose that the battery goes on firing till the cruiser either sinks or disappears. Further, let the probability of the cruiser sinking after $ n$ hits be $ 1 \minus{} \frac {1}{4^n}$ ($ n \equal{} 0,1,...$). Show that the probability of the cruiser escaping is $ \frac {2\sqrt {2}}{3\pi}$

For problem 11 , i couldn’t find the correct translation , so i just posted the hungarian version . If anyone could translate it ,i would be very thankful . [tip=see hungarian]Az $X$ ́es$ Y$ valo ́s ́ert ́eku ̋ v ́eletlen v ́altoz ́ok maxim ́alkorrel ́acio ́ja az $f(X)$ ́es $g(Y )$ v ́altoz ́ok korrela ́cio ́j ́anak szupr ́emuma az olyan $f$ ́es $g$ Borel m ́erheto ̋, $\mathbb{R} \to \mathbb{R}$ fu ̈ggv ́enyeken, amelyekre $f(X)$ ́es $g(Y)$ v ́eges sz ́ora ́su ́. Legyen U a $[0,2\pi]$ interval- lumon egyenletes eloszl ́asu ́ val ́osz ́ınu ̋s ́egi v ́altozo ́, valamint n ́es m pozit ́ıv eg ́eszek. Sz ́am ́ıtsuk ki $\sin(nU)$ ́es $\sin(mU)$ maxim ́alkorrela ́ci ́oja ́t. [/tip] Edit: [hide=Translation thanks to @tintarn] The maximal correlation of two random variables $X$ and $Y$ is defined to be the supremum of the correlations of $f(X)$ and $g(Y)$ where $f,g:\mathbb{R} \to \mathbb{R}$ are measurable functions such that $f(X)$ and $g(Y)$ is (almost surely?) finite. Let $U$ be the uniformly distributed random variable on $[0,2\pi]$ and let $m,n$ be positive integers. Compute the maximal correlation of $\sin(nU)$ and $\sin(mU)$. (Remark: It seems that to make sense we should require that $E[f(X)]$ and $E[g(Y)]$ as well as $E[f(X)^2]$ and $E[g(Y)^2]$ are finite. In fact, we may then w.l.o.g. assume that $E[f(X)]=E[g(Y)]=0$ and $E[f(Y)^2]=E[g(Y)^2]=1$.)[/hide]

Let the sequence of random variables $ \{ X_m, \; m \geq 0\ \}, \; X_0=0$, be an infinite random walk on the set of nonnegative integers with transition probabilities \[ p_i=P(X_{m+1}=i+1 \mid X_m=i) >0, \; i \geq 0 \,\] \[ q_i=P(X_{m+1}=i-1 \mid X_m=i ) >0, \; i>0.\] Prove that for arbitrary $ k >0$ there is an $ \alpha_k > 1$ such that \[ P_n(k)=P \left ( \max_{0 \leq j \leq n} X_j =k \right)\] satisfies the limit relation \[ \lim_{L \rightarrow \infty} \frac 1L \sum_{n=1}^L P_n(k) \alpha_k ^n < \infty.\] [i]J. Tomko[/i]

Let $ A_1,...,A_n$ be arbitrary events in a probability field. Denote by $ C_k$ the event that at least $ k$ of $ A_1,...,A_n$ occur. Prove that \[ \prod_{k=1}^n P(C_k) \leq \prod_{k=1}^n P(A_k).\] [i]A. Renyi[/i]

For some positive integer $n$, a coin will be flipped $n$ times to obtain a sequence of $n$ heads and tails. For each flip of the coin, there is probability $p$ of obtaining a head and probability $1-p$ of obtaining a tail, where $0<p<1$ is a rational number. Kim writes all $2^n$ possible sequences of $n$ heads and tails in two columns, with some sequences in the left column and the remaining sequences in the right column. Kim would like the sequence produced by the coin flips to appear in the left column with probability $1/2$. Determine all pairs $(n,p)$ for which this is possible.

At first a fair dice is placed in such way the spot $1$ is shown on the top face. After that, select a face from the four sides at random, the process that the side would be the top face is repeated $n$ times. Note the sum of the spots of opposite face is 7. (1) Find the probability such that the spot $1$ would appear on the top face after the $n$-repetition. (2) Find the expected value of the number of the spot on the top face after the $n$-repetition.

suppose that $S_{\mathbb N}$ is the set of all permutations of natural numbers. finite permutations are a subset of $S_{\mathbb N}$ that behave like the identity permutation from somewhere. in other words bijective functions like $\pi: \mathbb N \longrightarrow \mathbb N$ that only for finite natural numbers $i$, $\pi(i)\neq i$. prove that we cannot put probability measure that is countably additive on $\wp(S_{\mathbb N})$ (family of all the subsets of $S_{\mathbb N}$) that is invarient under finite permutations.

There are ${n}$ tokens in a pack. Some of them (at least one, but not all) are white and the rest are black. All tokens are extracted randomly from the pack, one by one, without putting them back. Let ${X_i}$ be the ratio of white tokens in the pack before the ${i^{\text{th}}}$ extraction and let \[ \displaystyle T =\max \{ |X_i-X_j| : 1 \leq i \leq j \leq n\}.\] Prove that ${\Bbb{E}(T) \leq H(\Bbb{E}(X_1))},$ where ${H(x)=-x\ln x -(1-x)\ln(1-x)}.$ [i]Proposed by Tamás Móri[/i]

Suppose that there are 100 seats in a saloon for 100 students. All students except one know their seat. First student (which is the one who doesn't know his seat) comes to the saloon and sits randomly somewhere. Then others enter the saloon one by one. Every student that enters the saloon and finds his seat vacant, sits there and if he finds his seat occupied he sits somewhere else randomly. Find the probability that last two students sit on their seats.

In a lake there are several sorts of fish, in the following distribution: $ 18\%$ catfish, $ 2\%$ sturgeon and $ 80\%$ other. Of a catch of ten fishes, let $ x$ denote the number of the catfish and $ y$ that of the sturgeons. Find the expectation of $ \frac {x}{y \plus{} 1}$

A gambler plays the following coin-tossing game. He can bet an arbitrary positive amount of money. Then a fair coin is tossed, and the gambler wins or loses the amount he bet depending on the outcome. Our gambler, who starts playing with $ x$ forints, where $ 0<x<2C$, uses the following strategy: if at a given time his capital is $ y<C$, he risks all of it; and if he has $ y>C$, he only bets $ 2C\minus{}y$. If he has exactly $ 2C$ forints, he stops playing. Let $ f(x)$ be the probability that he reaches $ 2C$ (before going bankrupt). Determine the value of $ f(x)$.

Let $ \vartheta_1,...,\vartheta_n$ be independent, uniformly distributed, random variables in the unit interval $ [0,1]$. Define \[ h(x)\equal{} \frac1n \# \{k: \; \vartheta_k<x\ \}.\] Prove that the probability that there is an $ x_0 \in (0,1)$ such that $ h(x_0)\equal{}x_0$, is equal to $ 1\minus{} \frac1n.$ [i]G. Tusnady[/i]

A permutation $ \pi$ is selected randomly through all $ n$-permutations. a) if \[ C_a(\pi)\equal{}\mbox{the number of cycles of length }a\mbox{ in }\pi\] then prove that $ E(C_a(\pi))\equal{}\frac1a$ b) Prove that if $ \{a_1,a_2,\dots,a_k\}\subset\{1,2,\dots,n\}$ the probability that $ \pi$ does not have any cycle with lengths $ a_1,\dots,a_k$ is at most $ \frac1{\sum_{i\equal{}1}^ka_i}$

Six cities $A, B, C, D, E$, and $F$ are located on the vertices of a regular hexagon in that order. $G$ is the center of the hexagon. The sides of the hexagon are the roads connecting these cities. Further more, there are roads connecting cities $B, C, E, F$ and $G$, respectively. Because of raining, one or more roads maybe destroyed. The probability of the road keeping undestroyed between two consecutive cities is $p$. Determine the probability of the road between cities $A$ and $D$ is undestroyed.

Consider a computer network consisting of servers and bi-directional communication channels among them. Unfortunately, not all channels operate. Each direction of each channel fails with probability $p$ and operates otherwise. (All of these stochastic events are mutually independent, and $0 \le p \le 1$.) There is a root serve, denoted by $r$. We call the network [i]operational[/i], if all serves can reach $r$ using only operating channels. Note that we do not require $r$ to be able to reach any servers. Show that the probability of the network to be operational does not depend on the choice of $r$. (In other words, for any two distinct root servers $r_1$ and $r_2$, the operational probability is the same.)

Determine the value of \[ \sup_{ 1 \leq \xi \leq 2} [\log E \xi\minus{}E \log \xi],\] where $ \xi$ is a random variable and $ E$ denotes expectation. [i]Z. Daroczy[/i]

Let $\{U_{n,1},...,U_{n,n}\}_{n=1}^\infty$ be iid rv, uniformly distributed over [0,1] , and for $\alpha\geq 1$ consider the sets $\{[n^\alpha U_{n,1}],...,[n^\alpha U_{n,n}]\}$ , where [·] denotes the whole part. Prove that the elements of the sets $H_n\cap(\cup_{m=n+1}^\infty H_m)$ form an almost surely bounded sequence if and only if $\alpha>3$.