I came across an interesting question on the “/r/learnmath” subreddit. The poster describes two players, A and B, playing a game of dice. Each one has a die that has a specific side weighted. Each player rolls his die. If it lands on the weighted side, he gets the value of the side added to his score and rolls again. If it lands on any of the nonweighted sides, his turn is over. Whoever has the highest score wins. I found this question intriguing, and thought it would be a good opportunity for me to work on understanding infinite series, a weak area for me. Note that the original question states that if the first roll is a nonweighted side, the player gets that many points (instead of zero like on subsequent rolls). I’m going to ignore that rule and focus on the general pattern.
In Part 2, I found the velocity required for circular orbit was
where G is the gravitational constant, M is the mass of the body being orbited, and r is the distance to the center of that mass. I tested this on the ISS’s orbit and found the velocity matched quite well. Now, I’m interested in looking at orbital periods, and calculating aspects of some common orbits.
See Part 1, where I looked at how increasing horizontal launch velocities could lead to orbit. Now I want to explore this mathematically. In the Feynman Lectures on Physics, Vol. I, Ch. 7, Section 7–4 “Newton’s law of gravitation,” Feynman looks at the velocity required to achieve (circular) orbit. He looks at how far a projectile would fall in one second, and then looks at how fast it would have to be traveling horizontally to clear the surface and maintain the same altitude. I’d like to expand on his approach and see if I can find a general expression for the velocity.
In this thought experiment, a cannon at the top of a tall mountain fires a cannonball at increasing velocities, until eventually it moves so fast that it achieves orbit.
See Part 1. I’ve been exploring a random walk in one dimension, where on object moves either +1 or −1 at each step, at random. On average, it will end up back near where it started (distance = 0), but over time, the likely positions start to spread out. I previously graphed the outcome of 1000 trials for 2000 steps. Although I can see the trajectories start to spread out, I’d like to actually graph the distribution.
As I continue reading the Feynman Lectures on Physics, I’m intrigued by the discussion of the random walk in Chapter 6: “Probability,” Section 6–3: “The random walk.” Feynman discusses a random walk in one dimension, where at each step an object moves one unit either forward or backward at random. In Figure 6–5, he draws a graph tracing the distance moved over 30 steps, for 3 trials. I remember seeing graphs like this in my textbooks when I was in school, studying them and trying to appreciate them. And I realize that now technology has advanced so much that I can explore these further on my home computer.
See Part 1, where I used conservation of energy of a projectile to determine the formula for kinetic energy, K=½mv². The aim was to see if I could derive a more intuitive understanding of this formula — especially why it depends on the square of the velocity. With a constant force and therefore constant acceleration, velocity increases linearly, by the same amount per second, so why does kinetic energy increase at increasingly large rates? (I should specify that I am using the nonrelativistic formula, so we assume speeds much lower than the speed of light.)