math

879 readers
1 users here now

General community for all things mathematics on @lemmy.world

Submit link and text posts about anything at all related to mathematics.

Questions about mathematical topics are allowed, but NO HOMEWORK HELP. Communities for general math and homework help should be firmly delineated just as they were on reddit.

founded 2 years ago
MODERATORS
mrh
76
 
 

In the UK National Lottery, players purchase tickets comprising their choices of six different numbers between 1 and 59. During the draw, six balls are randomly selected without replacement from a set numbered from 1 to 59. A prize is awarded to any player who matches at least two of the six drawn numbers. We identify 27 tickets that guarantee a prize, regardless of which of the 45,057,474 possible draws occurs.

77
78
 
 

lisyarus explains the complex derivatives so well, it also becomes clear why conformal mapping interesting in complex analysis.

79
 
 

I understand that 1/10 is a lot more than 1/1000, so obviously some of the highest percentages will be attributed to the smaller apps. However, when it comes to ranking these apps, do I go by 5-star reviews? 1-star reviews? The ratio of reviewers to downloaders? How would you go about this?

80
4
submitted 2 years ago* (last edited 2 years ago) by GrabtharsHammer to c/math
 
 

https://lemmy.world/c/ask_math is a new community for questions with math homework and similar specific math problems. Come over and help more math folks grow!

81
 
 

Four colour problem

82
4
submitted 2 years ago by mo_ztt to c/math
 
 

So - Wikipedia says:

A person is given two indistinguishable envelopes, each of which contains a sum of money. One envelope contains twice as much as the other. The person may pick one envelope and keep whatever amount it contains. They pick one envelope at random but before they open it they are given the chance to take the other envelope instead.

Now suppose the person reasons as follows:

  1. Denote by A the amount in the player's selected envelope.
  2. The probability that A is the smaller amount is 1/2, and that it is the larger amount is also 1/2.
  3. The other envelope may contain either 2A or A/2.
  4. If A is the smaller amount, then the other envelope contains 2A.
  5. If A is the larger amount, then the other envelope contains A/2.
  6. Thus the other envelope contains 2A with probability 1/2 and A/2 with probability 1/2.
  7. So the expected value of the money in the other envelope is [5/4 * A].
  8. This is greater than A so, on average, the person reasons that they stand to gain by swapping.
  9. After the switch, denote that content by B and reason in exactly the same manner as above.
  10. The person concludes that the most rational thing to do is to swap back again.
  11. The person will thus end up swapping envelopes indefinitely.
  12. As it is more rational to just open an envelope than to swap indefinitely, the player arrives at a contradiction.

To me it seems clear that the flaw in the reasoning is at step #2. Once you know how much money is in the envelope you've opened, it's no longer true that the probability that you got the smaller envelope is 50%.

Put it this way: If you knew that A was generated by sampling a particular probability distribution, then you could do the math and determine what was the probability that you got the smaller envelope, given the amount of money you found when you opened it. E.g. if the number of dollars in the small envelope was determined by a poisson distribution with μ=5, and you found $10 when you opened your envelope, then you could find the probability that you had the smaller amount of money using Bayes's theorem:

  • P(small amount is $5 | nothing) = e^-5 * 5^5 / 5! ≈ 0.175
  • P(small amount is $10 | nothing) = e^-5 * 5^10 / 10! ≈ 0.018
  • P(small amount is $5 | you found $10) ≈ 0.175 / (0.175 + 0.018) ≈ 90%

So, before you opened the envelope, it was 50/50 as stated. Once you open the envelope and find $10, you shouldn't switch, since it's much more likely that the small amount was $5 than $10, so you probably have the higher amount.

In the actual paradox presentation, you don't actually know anything about the process that generated the amounts of money in the envelopes, except the amount of money you found -- but that specific amount of money is information you're gaining about the process. If you were to find $5, that gives you a very different model of the process than if you found $5 million. The assertion that underlies step #2 -- that after you've opened one envelope, you still have 0 knowledge about the process -- is clearly untrue from a common-sense perspective, but it's also mathematically unsound.

In formal terms, you can see that it's unsound by following the implications of that assertion that after you've opened one envelope, it's still true that the process that generated the money in the envelopes had an equal chance of generating 2A as A. If you'd found 2A dollars in your envelope, you would assert that it was equally likely to generate 4A as 2A, and by induction on up for all powers of 2 -- so you're saying that the process had an equal chance of generating any one of an infinite number of discrete answers. That's not possible. So, by contradiction, the probability of A and 2A are no longer equal once you've opened an envelope and found a specific amount of money.

No? Wikipedia has this to say about explanations for the paradox:

No proposed solution is widely accepted as definitive. Despite this, it is common for authors to claim that the solution to the problem is easy, even elementary.

I wouldn't call my line of reasoning totally elementary, but it doesn't seem earth-shattering to me or a reason for a big controversy about it. No? Am I missing something?

(I tried to read the citations on Wikipedia to see if someone else was arguing this same thing, or giving a counterargument to it, but the citations were more confusing than enlightening to me.)

83
71
submitted 2 years ago by Artisian to c/math
 
 

This years MAA MathFest is in Tampa Florida, which is not a good place to be LGBTQIA+. The linked open letter asks the organizers to provide an online option, and be more honest in their messaging.

Email template and emails to reach out to appear at the end.

84
 
 

i couldn't find an answer by searching it up, can someone please explain this?

85
 
 
86
 
 

You thought the maze looked fun, but now you can’t find your way out. Luckily, mathematics is here to help you escape, says Katie Steckles

87
 
 

Hi there - large numbers are fun and I was learning about the Busy Beaver function which (theoretically) produces unfathomably large numbers by finding the maximum number of 1s written on a blank Turing machine tape out of the set of all n-state Turing machines that halt.

I was wondering if a conceptually more obvious, but larger variation could count the maximum number of steps taken before halting out of all n-state Turing machines that halt?

Would these numbesr not grow faster than the traditional Busy Beaver, since the number of steps will always be greater (or equal?) to the number of 1s written?

Obviously, the halting problem shows that we can't know beforehand if the machines will actually halt, but that issue is common to both versions.

Just curious if there is a reason the problem is not considered this way?

Any googologists out there with insights?

88
7
submitted 2 years ago* (last edited 2 years ago) by favrion to c/math
 
 

How can one simply calculate the probability of pulling one out of (52!) balls out of a bag TWICE in a row with replacement?

89
6
Snakes and Ladders (lemmy.sdf.org)
submitted 2 years ago by [email protected] to c/math
 
 

Watching a video about snakes and ladders (https://www.youtube.com/watch?v=k2ixp5VozIs) inspired me to dust off my markov-chain-memories and calculate the probability of winning the game after N rounds for normal and hardcore (ladders are snakes too) version.
Here's my code: https://gist.github.com/SimonLammer/5f7c5fd4f9e60bba9fd13db0930ff83b

Normal: 61% after 55 rounds; 95% after 144 rounds; 99% after 233 rounds.
Hardcore: 4.5% after 55 rounds; 19% after 144 rounds; 32% after 233 rounds; 66% after 610 rounds; 95% after 1597 rounds; 99% after 2584 rounds.

I expected the hardcore version to be harder, but didn't foresee a difference this big.

How could the number of expected snakes that were taken to win be calculated (aside from computer simulation)?

90
91
 
 

I wrote this article about the connection between sheafs (which are an important tool in algebraic topology) and Minecraft (as well as similar video games). I once posted about this on Twitter and a bunch of people retweeted it (including some high ranking professors from various universities). Due to a bug in twitters mobile app, this tweet got deleted just now though. So I will repost my original article here :)

92
 
 

P-adics

93
3
Is there a pattern? (docs.google.com)
submitted 2 years ago by favrion to c/math
 
 

I am trying to calculate the number of winning Solitaire games based on a paper by Rob Reijtenbach, linked here for your reference: https://theses.liacs.nl/2169. I made a chart, linked in the above URL, which depicts his calculations. I am trying to find the winning percentage based on seven tableau columns, not just three, and out of 52 cards, not just 12. I don't know if this is possible since he used optimizations to not blow up his supercomputer, but I figured that I can ask. Thank you.

94
14
submitted 2 years ago by Artisian to c/math
 
 

Recently noticed this open source math exchange-like site. The community is pretty slow (seems like there's lots of people interested in answering questions, but not so many posting them), which may make it a good target if you've got a good question that isn't getting the attention you'd like.

Curious if anybody knows other alternatives.

95
 
 

Is there a pattern in p?

96
 
 

This is a fantastic interactive simulation exploring the possibilities of a deceptively simple system.

97
3
submitted 2 years ago* (last edited 2 years ago) by wit to c/math
 
 

I am not sure if you are aware, but there is already a math community, with around 500 subscribers, on: !/c/[email protected].

Perhaps it would not be a bad idea to redirect there instead?

98
 
 

From what I’ve seen, it seems like P v.s. NP and the Riemann hypothesis are very, very difficult and will take a long time to solve. Instead, what problem has enough pieces of the puzzle discovered to be close to being solved?

-- originally posed by u/curvy-tensor

99
100
view more: ‹ prev next ›