
proof The BBP
proof The BBP without single integral

proof The BBP without single integral
I’ve improved arithmetic.
I’m sure everyone knows what an abacus looks like. Here’s a question for everyone: Show me where zero (0) is on an abacus. It isn’t there. And that’s exactly what I’m going to talk about: emptiness.
The main flaw in modern arithmetic is that it counts emptiness. So I fixed that. It’s very simple, based on how a computer works—or more precisely, a processor. For a processor, 0 or 1 isn’t emptiness; it’s a value. But emptiness is present; it’s NULL. And emptiness is present in life. One more example before I move on to my arithmetic. A little problem for Pinocchio, just slightly modified. Pinocchio had an apple on his plate. Pinocchio wasn’t greedy and gave the apple to Artemon. How many apples are left on Pinocchio’s plate? Everyone will say the answer is zero apples. But that’s not the correct answer. A void remains. Because one could answer that there are zero pears or something else left. This is the first flaw in modern arithmetic, which requires that we not divide by zero. The second flaw is that in decimal arithmetic, in the ones place, we can only count up to nine, but it should be up to ten.
Now I’m correcting traditional arithmetic with my own. So, for me, 0 is emptiness. And you can count up to ten objects by adding the “Ten” symbol. Of course, you could invent a new symbol, but it isn’t on the keyboard yet. So I chose the Latin “Ten”—X.
Let's start counting: 1, 2, 3, 4, 5, 6, 7, 8, 9, X (or 10), 11, 12, 13, 14, 15, 16, 17, 18, 19, 1X (that is, the word “Twenty,” or 20, where we carry the ten from the ones place to the tens place), 21, 22, 23, 24, 25, 26, 27, 28, 29, 2X (that is, “Thirty,” or 30). The rest is clear. But in my arithmetic, there is a void or emptiness, which is 0, “Zero”. We do not perform any arithmetic operations with zero, it is only used as a statement. That is, it can be 0 (emptiness), or emptiness was filled with anything. Example: 1 - 1 = 0; we got emptiness X - 9 - 1 = 0; we got emptiness 0 + 1 = 1; we filled emptiness with a thing
A void can be present in both single-digit and multi-digit numbers. I’ve already shown a single-digit number. 1 - 1 = 0; Example of a multi-digit number: 25 - 5 = 20; 255 - 50 = 205; The void can be replaced with a value: 20 => 1X, meaning from the two tens, carry the one from the second digit to the first digit. The reverse operation is also possible: 1X => 20.
Thus, the error is corrected. Try multiplying or dividing in a column; it all works. Just remember, operations with 0 are not performed, because it is not the item for calculation. We can only make emptiness or fill emptiness.
Since e is generally proved to be irrational by contradiction, I wanted to write a proof that directly shows it cannot be rational. When I presented this to Claude it took some cajoling for it to say the proof was correct, and it was unable to find a similar/direct proof, so if my logic isn't clear or has errors I would appreciate any critiques and am interested if anyone has encountered a direct proof like this one.
I don't know if it's an existing work, but this identity is independently developed by me.
Came up with this one for fun, no idea if it's been posted before somewhere. Fair warning, I'm not amazing at math, just got curious about this one and worked through it slowly. Mostly wanted to share because I liked how a silly real-world setup ended up landing right on top of φ(n).
The setup
In an online poll, viewers vote either "Yes" or "No," and the result is displayed only as a percentage rounded to exactly two decimal places (e.g., 41.27%). The total number of votes is not shown. Assume that for any percentage displayed, the actual vote tally is the minimum possible whole number of votes that could have produced that exact percentage.
The question
Out of all possible displayed percentages (from 00.01% to 99.99% in steps of 0.01%), how many of them require the full 10,000 voters as a minimum? And which displayed percentages are those, intuitively?
>!Where coprimality comes in!<
>!A displayed percentage X.XX% corresponds to the fraction XXXX/10000. The minimum number of voters needed to produce that exact ratio is 10000 / gcd(XXXX, 10000). So the minimum hits its maximum (10,000) exactly when gcd(XXXX, 10000) = 1, i.e., when the numerator is coprime to 10,000.!<
>!Two numbers are coprime when they share no prime factors. Since 10,000 = 2⁴ × 5⁴, its only prime factors are 2 and 5. So XXXX is coprime to 10,000 if and only if XXXX is odd AND not divisible by 5. That's a clean shortcut, you don't have to actually factor the numerator at all, you just check the last digit.!<
>!Where Euler's totient comes in!<
>!The count of integers from 1 to n that are coprime to n is exactly Euler's totient function φ(n). For n = 10,000:!<
>!φ(10000) = 10000 × (1 − 1/2) × (1 − 1/5) = 10000 × 0.5 × 0.8 = 4,000!<
>!So exactly 4,000 displayed percentages require the full 10,000 voters as a minimum. That's 40% of all possible X.XX displays.!<
>!The pattern generalizes nicely. If you display to d decimal places, the max minimum is 10^(d+2), and the number of splits tied at that max is φ(10^(d+2)) = 0.4 × 10^(d+2). Always exactly 40%, because the prime factorization of any power of 10 only involves 2 and 5, and (1 − 1/2)(1 − 1/5) = 0.4.!<
>!The part I thought was nice!<
>!The reason the answer is always 40% (regardless of how many decimal places you display) is that 10 only has two prime factors. If we counted in some weird base where the denominator had more prime factors, the proportion of "hardest" splits would drop. The fact that our base-10 display gives such a clean answer is a small accident of the base we count in.!<
Curious if anyone sees a slicker way to frame the general result, or if there's a related problem I should look at. Also happy to be told this is a well-known exercise and I just reinvented it.
I've rewritten this StackEchange posting from a few years ago, making the results more rigorous (although it's certainly not 100% rigorous yet). As explained there, the starting point is the idea that the sum of a series, regardless of whether it is convergent or divergent, should be taken to be the sum of the partial sum and the remainder term.
In case of a convergent series, the remainder term tends to zero in the limit of the truncation point to infinity, which allows us to compute the sum of such a series without having to consider the remainder term. In case of a divergent series, we then do need to consider the remainder term.
While the remainder term looks like something that is completely arbitrary, I show in section 3 of the stackexchange posting that the remainder term for the rescaled summand is related to that of the original summand, see eq. (3.11). I derived this for the convergent case, but by invoking analytic continuation, I argue that this should be generally valid.
If we're summing f(k) from k = p to infinity, we can consider summing f(k/N). The remainder term for truncating at the argument of the summand of x is denoted by R(x,N). This means that the index value at which we're truncating is N x. We then do have invoked analytic continuation to any real or complex values for x.
Eq (3.11) then says that:
R(x,1/N) = sum from k = 1 to N of R(x + k/N -1)
Where the remainder term in the summation without the second argument is the original remainder term with N = 1.
I then show in section 4 that this relation directly implies the value of the sum over all positive integers.
More powerful summation methods are derived in section 5 from (3.11) by considering the limit of N to infinity. One result is eq. (5.5) which gives the sum X of a divergent series in terms of an integral over the partial sum S(t):
X = Constant term in the large-x expansion of Integral from x -1 to x of S(t) dt
And another result is eq. (5.6) which gives the prescription of how to correctly use regularization to compute the value of divergent series. We're then summing a summand f(k) that leads to a convergent summation with value X, and they both depend on another parameter. By doing some manipulations involving that parameter, be it analytic continuation, or series expansions or something else, one formally gets to the desired divergent sum.
However, eq.(5.6) tells us that to get to the correct value of the divergent sum, one has to also consider the integral of f(t) from x to infinity, do whatever is done to the regularized series to this integral, extract the constant term of the large-x expansion from this and subtract that from the result of the manipulations to the regularized sum.
In section 6 I give some examples of computations involving (5.5) and (5.6). And I've given more examples of how doing the regularization correctly resolves ambiguities in other postings. See e.g. this MathOverflow posting and in this posting I show how it eliminates an ambiguity with choosing the branch of a logarithm.
The supersignum unit g is defined as a bridge between hyperbolas and circles, its chaotic set or unit that i made, it starts with i, a concept everyone knows, then i²=-1, then we suddenly get j, a hyperbolic number where j²=1, but g²=±1, lets see their powers
i²=-1
So
i³=-i
This may look weird but its part of the plan
i⁴=1
Its a full rotation!
Now j
j²=1
1×j=j³=j
That was a fast loop
Now g
g=g
g²=±1
g³=±g (logically)
But whats g⁴?
±1×±1=1 so g⁴=1
And ±g×g=1 may look weird, but its normal, ±1×g×g,±1×±1, see! We get the same result
So lets find what set is g
g²={-1,1}
we take the square root and assume √1=j since j²=1 as an soloution
√g² take root
√g²={√-1,√1}
g={i,j}
Wow!
Extra : if we encounter an i during the i path and j says the same, for example (iπ)/2 and (jπ)/2, we can say (gπ)/2 in ln(g) because it happens
Dicoilic numbers: this is where the fun begins, its not supersignum numbers, but it has 3 dimensions
A dicoilic number is a number a+bw+cs
|a+bw+cs|=√|a²+b²c|
You can do stuff with dicoilic numbers
Dicoilic numbers are a+bw+cs
W and s are not regular units and 0s≠0 to prevent epsilon=w
Lets start with a few stuff
i=w+s
j=w-s
epsilon=w±0s (+ and - are interchangeable)
Lets find the hypercomplex unit k
We know k=ij
That means (w+s)(w-s)
That means k=w²-s²
We cant exactly find w² and s² but it does have some algebra
i²=w²+s²+2sw
i²=(w+s)²=w²+s²+2sw
i=w+s
j=w-s
This system is communitave
That means the hypercomplex unit k
k=ij
k=(w+s)(w-s)
k=w²-s²
j²=w²+s²-2sw
This means j²+i²=0
And w²+s²=0
Whaaat
w²=-(s²)
Amd i²-j²=-2 or 4ws
That means 4ws=-2 divide
2sw=-1
Lets check if this is consistent
I²=s²+w²+2sw
S²+w² is 0
i²=2sw
2sw=-1
CONSISTENT!
And check for j
j²=1
j²=w²+s²-2sw
j²=0-2sw
j²=0-(-1)
j²=1
LOL
In dicoil numbers, there is a concept called dicoilic form, every hypercomplex number and imaginary can be expressed in a dicoilic form
i=w+s
j=w-s
k=w²-s²
Epsilon=w+0s
If we want to take the dicoilic form of , say, 1+i, we put the real part down first
1
Then we take the number
i=w+s
Then we get 1+w+s