The simplest form of the fraction is 9/25
The Karger's algorithm relates to graph theory where G=(V,E) is an undirected graph with |E| edges and |V| vertices. The objective is to find the minimum number of cuts in edges in order to separate G into two disjoint graphs. The algorithm is randomized and will, in some cases, give the minimum number of cuts. The more number of trials, the higher probability that the minimum number of cuts will be obtained.
The Karger's algorithm will succeed in finding the minimum cut if every edge contraction does not involve any of the edge set C of the minimum cut.
The probability of success, i.e. obtaining the minimum cut, can be shown to be ≥ 2/(n(n-1))=1/C(n,2), which roughly equals 2/n^2 given in the question.Given: EACH randomized trial using the Karger's algorithm has a success rate of P(success,1) ≥ 2/n^2.
This means that the probability of failure is P(F,1) ≤ (1-2/n^2) for each single trial.
We need to estimate the number of trials, t, such that the probability that all t trials fail is less than 1/n.
Using the multiplication rule in probability theory, this can be expressed as
P(F,t)= (1-2/n^2)^t < 1/n
We will use a tool derived from calculus that
Lim (1-1/x)^x as x->infinity = 1/e, and
(1-1/x)^x < 1/e for x finite.
Setting t=(1/2)n^2 trials, we have
P(F,n^2) = (1-2/n^2)^((1/2)n^2) < 1/e
Finally, if we set t=(1/2)n^2*log(n), [log(n) is log_e(n)]
P(F,(1/2)n^2*log(n))
= (P(F,(1/2)n^2))^log(n)
< (1/e)^log(n)
= 1/(e^log(n))
= 1/n
Therefore, the minimum number of trials, t, such that P(F,t)< 1/n is t=(1/2)(n^2)*log(n) [note: log(n) is natural log]
Answer:
The length of the side PC is 34 cm.
Step-by-step explanation:
We are given that BP is the perpendicular bisector of AC. QC is the perpendicular bisector of BD. AB = BC = CD.
Suppose BP = 16 cm and AD = 90 cm.
As, it is given that AD = 90 cm and the three sides AB = BC = CD.
From the figure it is clear that AD = AB + BC + CD
So, AB = 
= 30 cm
BC = = 30 cm
CD = = 30 cm
Since the triangle, BPC is a right-angled triangle as 
PBC = 90°, so we can use Pythagoras theorem in this triangle to find the length of the side PC.
Now, the Pythagoras theorem states that;
= 1156
PC = 34 cm
Hence, the length of the side PC is 34 cm.
Answer:
x=1
y=-4
Step-by-step explanation:
4x+y=0 -> y= -4x
2(-4x)+x=-7
-8x+ x=-7
-7x=-7
x=-7/-7=1
y=-4 . 1 = -4
