blog

Enough Already! 15 Things About modigliani miller theorem We’re Tired of Hearing

0

The modigliani miller theorem is a theorem of probability and combinatorics that states that “the probability of a triangle is the sum of the squares of the angles that make up the triangle.

It’s always struck me in these sorts of situations, like when we’ve been playing a game for too long, that the probability of a certain outcome is the sum of the squares of the probabilities of all possible outcomes. So if I’m playing an online game and it’s not so long ago that I was winning, I might be a bit more likely to win. It’s an issue that comes up with probability all the time.

A lot of interesting theories involving probability. I think we can put this one in the “what the hell did I just watch” bucket, but it’s not really that hard. We all know the probability of a square root is the square of the probability of the square root of the number. So if Im playing at a table and Im a very good player, I’m probably going to win.

The problem is, there are lots of tables out there. And for those of you who are trying to make a winning strategy, Im going to have to make it really difficult. The modigliani miller theorem states that the likelihood of winning a random game with X people is the square root of the number of people that are not playing.

This is a classic theorem that’s been around for a long time. Actually, it’s been around since the 1920s, but I can’t remember where I read it.

This theorem is based off of a paper by Imre Buchbinder, a mathematician at the University of Münster in Germany. It states that if you have a single player game that has X people, then the probability of them playing X is the square root of X. As a result it will be possible for Imre to make a winning strategy with just 2 people.

The modigliani miller theorem is a simple consequence of a very common theorem called the “miller’s inequality”. This means that if n people can play together, then the number of people playing each on their own (without the other person being able to play them) is at least the square root of n.

The modigliani miller theorem says that if you have a single person, then the probability of them playing the game without having to play with another person is less than the square root of their number. So by being able to play with just 2 people, and by being able to play with just one person without having to play with another person, Imre’s strategy is likely to be a winning strategy. This is the same analysis that led to all the great poker strategies.

Of course, it’s not really a strategy, rather it’s a probability, which in this case is the square root of two. However, this analysis has also led to the fact that there are strategies that are far more likely to win than not to win.

Radhe

Comments

Leave a reply

Your email address will not be published. Required fields are marked *