Tetration Forum
Number theoretic formula for hyper operators (-oo, 2] at prime numbers - Printable Version

+- Tetration Forum (https://math.eretrandre.org/tetrationforum)
+-- Forum: Tetration and Related Topics (https://math.eretrandre.org/tetrationforum/forumdisplay.php?fid=1)
+--- Forum: Mathematical and General Discussion (https://math.eretrandre.org/tetrationforum/forumdisplay.php?fid=3)
+--- Thread: Number theoretic formula for hyper operators (-oo, 2] at prime numbers (/showthread.php?tid=740)



Number theoretic formula for hyper operators (-oo, 2] at prime numbers - JmsNxn - 06/04/2012

It took some thinking but I recovered a closed form expression for hyper operators at prime numbers. The result is interesting to say the least. It is not analytic; and in fact the iteration may not even be continuous but discrete. We start by considering a function

















But the fundamental theorem of arithmetic applies for as well.



Iterating we get a formula:



This allows us to develop an expression for integer arguments of . We will now make some claims about the structure of iterating .

Claim I:

is one to one for all complex iterates that exist and satisfy . This qualifies as the reason operators in between are not commutative. The reason isn't one to one is because it turns . However; since we have because is not commutative.

Claim II:
's range is closed under multiplication

Claim III:
for some sequence . This claim implies II with some algebra, but as well determines some more powerful results. This factorization into primes with algebraic exponents is unique by Baker's theorem. This would be the main restriction determining for what values of we can iterate .

With these we define hyper operators by the following formula.





And we extend the operators recursively to the negative domain by the following law, and



These operators form the tremendous result, for of forming a commutative semi-ring! But on top of that: Recursion is satisfied for all prime numbers.




The question is, of course, how do we define iteration on . And on top of that, where and when is an iterate defined?

These operators have some really interesting results involving unique factorization. Although, all these further results rely on iterating with the restriction of claims I-III. So I'm wondering if anyone knows of any techniques that would be required? I'm thinking the iteration would require not a continuous expression but a discrete expression involving the unique coefficients of .

This can work in fact for every natural number given a few tweaks that I'll explain later.



RE: Number theoretic formula for hyper operators (-oo, 2] at prime numbers - tommy1729 - 06/29/2012

i awaited the second post ( of james ) ... but it did not come.

in fact i wonder what and if anyone would reply.

i think there are no replies because james confused ppl , maybe including himself.

in fact , i dont agree.

james uses the same P_i everywhere , but the factorization of a sum has other prime factors than the product of prime factors.

for instance , take p and q odd primes and J(n) the function james proposes then J(p^2 * q) = 2*p + q.

but the primefactors of 2*p + q are not easily expressed and certainly not a multiple of p or q.

i then see no way to extend this idea to something as "complicated " as number theory and/or tetration ...

regards

tommy1729


RE: Number theoretic formula for hyper operators (-oo, 2] at prime numbers - JmsNxn - 07/17/2012

I apologizing for confusing you.

I should have you know you're probably right. I was just trying really hard to look for a solution. I'm approaching from every angle. I will try to reserve my posts to a more refined quality.