Ramanujan g- and G- functions
[edit]
I hope this is readable.
Bernoulli numbers: B2 = 1\6, B4 = -1/30, B6 = 1/42, ...
2 and sin , cos , tan
[edit]
Special case m = 1/2 , 1/4 , 1/8 , 1/16 , ... Yields (1)
n = 1 , 2 , 3 , 4 : Yields
Bernoulli Coefficients
[edit]
k = 0, yields (1):
Strange pattern
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
1 5 10 10 5 1
1 (5+1) (0+1) 0 5 1
1 6 15 20 15 6 1
1 (6+1) (5+2) (0+1) 5 6 1
1 7 21 35 35 21 7 1
1 (7+2) (1+3) (5+3) (5+2) 1 7 1
and so ...
Any 3,6,9,... repeating same digits from 1 - n is always divisible by number 3
3 repeating 1s
6 repeating 1s
9 repeating 1s
3 repeating 5s
3 repeating 51s
3 repeating 61s
Is there any other prime number that have this property?
any 2,4,8,16, ... digits repeating is divisible by 11
Strange pattern
Zeta and Lambda functions
[edit]
Jacobi theta function
[edit]
Better approximation
[edit]
1st perfect number
2nd perfect number
3rd perfect number
4th perfect number
5th perfect number
6th perfect number
nth perfect number
Perfect number = Pn
k = 1, 2, 4, 6, 12, 16, 18, ...
Is there any more of this type?
Special case of Euler's constant
[edit]
z = 1, it is a special of Euler's constant
Ramanujan's problem
[edit]
Solution : {N: 3 , 4 , 5 , 7 , 15}
Solution : {N: 1}
Solution : {N: 1 , 5}
Solution : {N: 1 , 2 , 5}
Log of Ramanujan continued fractions and series
[edit]
Ramanujan's series
Log of it
Almost integer & Approximation
[edit]
Numbers from 1 to 10
Two of each digits : 11,22,33,44,55,66
Difference of two square
[edit]
Setting y = π and x = 2 Which gives Ramanujan equation
Setting y = π and x = 2π Which gives
Is there any more of this type?
Strange pattern!
Is there more of this type?
Equation 1
Equation 2
p = {2,3,5,7,11,13,...}
Cube of Fibonacci series
[edit]
n ≥ 1
Where k ≥ 2
Where k ≥ 1
Algorithms
Setting a = 2 and b = 1
Fo is an estimate
K = 0.9159655... (Catalan's Constant)
Continued fraction of phi
[edit]
and so on ...
and so on ...
and so on ...
Example
and so on ...
Is there any more of this kind?
is prime from n = 2 to 12 only
n = 2, gives
Ramanujan's problem
[edit]
Solution N = 3 , 4 , 5 , 7 , 15
Sum