euler-number

Last updated July 8, 2022.

# Metadata

2022-06-25 01:40 | euler-number | Doriel Rivalet

# Content

Concept of growth

$$e\approx1.00000001^{100000000}$$ $$e:=\lim_{n\rightarrow\infty}(1+\frac1{n})^n$$ $$e=\sum_{n=0}^\infty \frac1{n!}$$ $$\frac{d}{dx}e^x=e^x$$ $$\int_1^t\frac{1}{x}dx=1$$

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
#include <stdio.h>

float factorial (int n) {
	if (n >= 1)
		return n*(factorial(n-1));
	else
		return 1;
}

float euler(int iterations, int n){
	# RECURSION WITHIN RECURSION
	if (iterations >= 1)
		return (1/factorial(n))+(euler(iterations-1,n+1));
	else
		return 1/factorial(n+1);
}

int main () {
	int iterations = 10;
	int n = 0;
	float e = euler(iterations,n);
	printf("eulers number with %d iterations is %f",iterations,e);
	return 0;
}