It's not harshness, it's envy.I don't understand how it works.I see that I also understand that But I don't catch how it relates with the limit.Also I don't remember how to find eigenvectors, but it can be fixed quite easy
Matrices-shmatrices...Everything is simple:Divide everything to q_n.Make n -> \inftyLet:So we have:To solve the system reduce it to (q, t) and divide one equation to another.It gives t = 1/sqrt6
<t>Oh, it's a long story...The number of men having at least one WN (Woman-Neighbor) is:A number of men, having exactly one WN + number of men, having exactly two WNs.The probability of having one:If the man is in the row (not on the end), then probability of having woman from the left is:P(wleft) =...
<t>MC, you can check yourself:import java.util.ArrayList;import java.util.Collections;import java.util.List;public class Neighbours{ public enum Gender { M, F; } public static double getTheory(int _n, int _m) { double m = _m; double n = _n; double p1 = m/(n+m-1)*(n-1)/(n+m-2)*2 * ((n+m-2)/(n+m)) + m...
MC, If you mean n*m*(m-1))/((n+m-2), then it isn't the correct answer.I've run a simulation and found that my answer is wrong too.The best I have now is:The simulation with 100 000 steps for n=m=10 gives:Test: 7.635860Theory: 7.631579
<t>With straightforward approach we can have:p_c - probability that man staying in the center has at least one girlbourp_e - probability that man staying on the end has one girlbourp_ic and p_ie - probability that this man is in the center and on the end.May be it will even turn to be something beau...
<t>QuoteOriginally posted by: noexpert$0 (you dont even get your accumulated balance and the game stops, if a red is drawnIs this correct?In this case the payoff would be zero, since there's no other way to stop the game except getting a red ball.I think you're right with your calculations about the...
Q1:(n-2) men have 2 neighbours2 men have 1 neighbour.Total 2n-2 neighbours.p(The neighbour is women) == m/(m+n-1)So for n>=2 it should be 2(n-1)*m/(m+n-1) Q2:p(ch) = Nh*Pt + Nt*Ph = (n-1)p(p-1) + (n-1)(p-1)p = 2(n-1)p(p-1)