Author: yamasaku
●Everyone's DIY Math / General Math
Calculating infinitely nested square rootsCalculating infinitely nested square roots
- Number of diagonals in a regular polygon
Number of diagonals in a regular polygon
- Approximations of prime numbers (n ≥ 6)
It is not necessarily a prime number.
- The nth Fibonacci number
Please enter any natural number n.
- The nth Tribonacci number
The Tribonacci sequence is 0, 0, 1, 1, 2, 4, 7, 13, 24..., but please treat the first 0 as the 0th term.
- Prime number generation formula (approximate)
Be careful—if there aren't enough of them, they'll scatter.
- Approximate Values of Pi
Please enter any natural number for n.
- An approximation of pi (trapezoidal formula)
Find the area within a radius of 1 using the trapezoidal rule.
- Approximations of Pi (Regular Polygons)
Archimedes' Method of Calculation
- The nth Fibonacci number
The first item is numbered 1.
- Approximating Pi Using Continued Fractions
I am using continued fractions to calculate an approximation of pi.
- Euler's number
Calculate the Napierian constant using continued fractions.
- Approximations of π
It converges really fast.
- Calculating Pi Using the Gamma Function
We will calculate pi using the gamma function.
- Approximations of the prime counting function
This function approximates the number of prime numbers less than or equal to a given number.
- Approximation of the Prime Counting Function (High-Precision Version)
We approximate the number of prime numbers less than or equal to an arbitrary integer x.
- An approximation of the number of prime numbers up to the nth
The accuracy isn't bad.
- Approximations of π(x)
Calculate the number of prime numbers less than or equal to x.
- Approximations of π(x)
Calculate the number of prime numbers less than or equal to x.
- The size of the nth prime number
We will show how large the nth prime number becomes when n ≥ 6.
- An approximation of the number of prime numbers less than x
We approximate the number of prime numbers less than x.