Let's talk about π.
LizFoster (592)

Today I'd like to teach you all about one of my all time favorite constants: π!
Most likely, all of you know that π is the ratio of a circle's circumference to its diameter, and probably only know only 3 to 5 decimal digits of it. However, π is an irrational number, meaning it has no end! Let us go through all of the different formulae of π I have programmed, and explain what they mean! Let's dive in. (These are numbered in the order that they print when the attached code is run)

  1. The Monte Carlo Method

One way you can do this is by drawing a square, with a circle whose edges touch the 4 edges of that square within. Now imagine you were to draw many many dots randomly within the square-circle hybrid. If you take the number of points that fell within the circle, divide it by the total number of points, and multiply it by 4, you get (you guessed it) π!! More info can be found here:

  1. The Chudnovsky Algorithm

This is one of the fastest methods out there, being used in the world record, to calculate 50 trillion digits of π! I already explained it in a previous post, but the formula (and more cool information!) is here:

  1. The Basel Problem

This problem, posed by a man named Pietro Mengoli, asked for the exact sum of an infinite series, with proof. Mathematician Leonhard Euler answered this, with proof, finding it to equal exactly π^2/6. Further info and interesting facts here:

  1. The Wallis Product

Unlike the other formulae here, this one uses the Product Operator in its equation. If repeated over an infinite number of times, it will equal π/2. More information here:

  1. The Leibniz Formula

Last but certainly not least, I have here probably one of the slowest π-convergent methods out there. In fact, to get π accurately to 10 decimal places takes about 5 billion iterations, according to the Wikipedia page! This formula alternates between adding and subtracting fractions with odd denominators (meaning this is an example of an alternating series), and converges on π/4. For extra information, go here:

I plan to make more π approximation programs in the future, so stay tuned if these kinds of things interest you as much as they interest me!

Thank you. ^ ^

You are viewing a single comment. View All
AmazingMech2418 (661)

@LizFoster With me making it sound so easy, though, remember that I've been doing this for years (however, only two years in-depth, although I knew the Caesar Cipher and Pigpen Cipher (special case monoalphabetic substitution cipher that is EASY (look it up on Google Images and if you see a tic-tac-toe board-like thing with an "X" at the bottom, that's the entire cipher and how it works)) long before). Also, with the cryptography, I have realized that it is easier to learn by doing than by reading. This website can auto-generate keys for ciphers given a quote and has practice tests: https://toebes.com/codebusters/ . Don't worry about where it says "Div A", "Div B", and "Div C", that is just the different "divisions" in a competition, labelling which divisions use which ciphers. I actually ended up learning ciphers like Vigenere and the Affine ciphers through that website by just finding patterns in generated codes.