Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
Number theory and hyper operators
I'm wondering if anyone knows of any research of tetration and pentation and that whole gang in number theoretic areas. In the sense that we would only deal with natural x,y,n in the equation x [n] y.

I'm interested more specifically in results to do with primes. It's interesting because the same prime factors from x are the only ones which occur for n > 2 and y > 0. I'm thinking however more characteristic patterns reoccur.

Any help would be greatly appreciated!
i have asked that same question before in the past.

im unaware of nontrivial work in that area.

maybe its a silly question but what about convergeance questions

f(p) = log(2)*sexp(slog(2)-4/3)/2 + log(3)*sexp(slog(3)-4/3)/3 + ...
+ log(p)*sexp(slog(p)-4/3)/p

lim p -> oo f(p) = Constant ?

or something better ...


Well. The reason I ask is because I was structuring my semi operators around the distribution of the set:

claim that there are operators unique to x and y which allow us to perform operations on elements of instead of operations on . We then say that is an isomorphism from

Then I found out I only needed to prove the recursive identity for primitive elements of ; (i.e elements that return primes in N); and then do the rest by induction and breaking up the real argument into a product of primitive elements.

However; this all and all sounded plausible but I hit some huge wall. Which is proving the recursive identity for primitive elements; mostly.

I have a new technique now. It may or may not work.

But having more information about how behaves for naturals would really help.
Long ago I found this, I think is related, even if I don't know if can be usefull for your work.

Patrick St-Amant - Number Theories

He tries to build new number theories using a generalized concept of prime number based on the choice of the operations. Is quite interesting.

MSE MphLee
Mother Law \((\sigma+1)0=\sigma (\sigma+1)\)
S Law \(\bigcirc_f^{\lambda}\square_f^{\lambda^+}(g)=\square_g^{\lambda}\bigcirc_g^{\lambda^+}(f)\)
(08/30/2012, 05:24 PM)JmsNxn Wrote: Well. The reason I ask is because I was structuring my semi operators around the distribution of the set:

claim that there are operators unique to x and y which allow us to perform operations on elements of instead of operations on . We then say that is an isomorphism from
Sorry if my question is stupid (I'm a newbie in math) but I'm a bit confused.
From your definition of (that is a set of the real ranks that satysfie for a fixed ) so we have that .

In other words we can define a function whit the property such that , at this point we have that the set of the is your

The question is, how do you know that is injective? It can be maybe a surjection on the reals (not-injective, multivalued)?

In fact from your definiton of seems me that you except it to be a countable subset of then you are asuming (is an hypothesis?) that is a bijection (is this what you mean when you say that they are isomorphic? And which is the funtion you use for the isomorphism? maybe you use ? )

Thanks in advance, and sorry for my bad english.

MSE MphLee
Mother Law \((\sigma+1)0=\sigma (\sigma+1)\)
S Law \(\bigcirc_f^{\lambda}\square_f^{\lambda^+}(g)=\square_g^{\lambda}\bigcirc_g^{\lambda^+}(f)\)
I meant to say that

Now the distribution of the set (which depends on x and y) is pivotal insofar as, if we extend hyper operators for all natural arguments and real operators they have to obey the recursion on these points and these points alone. The recursive Identity is written:

And we need to only worry when is an integer, which is when

I was trying to think of ways to talk only about recursion on this discrete set rather than the whole plane. What I was thinking, which I am no longer is that there maybe binary operations on this set which allows us to talk about the operators more freely. I haven't really had much luck in uncovering much of anything.

By isomorphism I meant one to one and onto insofar as obeys the rules I laid out at the beginning.
Ok Now is clear.

Anyways the first two statemens are intuitively acceptable, the problem is the I can't think how to prove them for the hypoeroperator starting from the recursive identity, that is the fundamental axiom of the hyperoperations.

You mean to use them as axioms and study the "generated" hyperoperators, or do you have any clues?

Are them really acceptable from a philosophical point of view in your opinion?

MSE MphLee
Mother Law \((\sigma+1)0=\sigma (\sigma+1)\)
S Law \(\bigcirc_f^{\lambda}\square_f^{\lambda^+}(g)=\square_g^{\lambda}\bigcirc_g^{\lambda^+}(f)\)
Yea, you're a genius! Now I understand what you tried to do. But I don't know if it will be really fruitfull, but at least sound interesting.

Tell me if I got it right:

You was right about the bijection (only if you first statements hold).
Anyways we have that the sets and are really differents but they have interesting links.

Lets re-start with a new version of your definitons: let

Ia) for fixed

IIa) for fixed

second step:




maps on a subset of the naturals that now we call and like with the primes there are naturals numbers cutted off.
We want to be injective (that is your condition )
but is not invertible because is restricted to : in fact is bijective.

Your idea is to extend to make it invertible adding more elements in the domain, in other words extending it to (but you want do it adding real numbers)

Finally we have a bijection, in fact holds!

[Image: slr81c.jpg]

for example using for the addition we have:

then we build inverting the naturals using

maps the naturals only if the domain is then in our set we have numbers that are not naturals

To be honest I don't know if the extension of the naturals to is a subset of the reals (as you defined)
but if we have that preserves the order we can find this result

in our example this lead us to this so the rank is not a natural number.

My question is: is it rational, irrational? Maybe it is trascendental, but this is beyond my limits.

About the relations with now the differencese are clear.

We have that


in other words the function IIb) is multivalued, and the set is the set of all possibles solution, in symbols:

that is equivalent to

MSE MphLee
Mother Law \((\sigma+1)0=\sigma (\sigma+1)\)
S Law \(\bigcirc_f^{\lambda}\square_f^{\lambda^+}(g)=\square_g^{\lambda}\bigcirc_g^{\lambda^+}(f)\)

Possibly Related Threads…
Thread Author Replies Views Last Post
Question Hyper-Operational Salad Numbers Catullus 8 230 08/16/2022, 02:51 PM
Last Post: Daniel
  The modified Bennet Operators, and their Abel functions JmsNxn 6 255 07/22/2022, 12:55 AM
Last Post: JmsNxn
  The \(\varphi\) method of semi operators, the first half of my research JmsNxn 13 710 07/17/2022, 05:42 AM
Last Post: JmsNxn
Question Octonion Hyper-Operations Catullus 3 513 07/05/2022, 08:53 AM
Last Post: Catullus
Question Rank-Wise Approximations of Hyper-Operations Catullus 46 5,164 07/05/2022, 08:25 AM
Last Post: Catullus
  Thoughts on hyper-operations of rational but non-integer orders? VSO 4 4,767 06/30/2022, 11:41 PM
Last Post: MphLee
  The bounded analytic semiHyper-operators JmsNxn 4 7,778 06/29/2022, 11:46 PM
Last Post: JmsNxn
Question Hyper-Operations, Base Pi Catullus 2 327 06/24/2022, 08:46 AM
Last Post: Catullus
Question Weak Hyper-Operational Etas and Euler Numbers Catullus 0 193 06/17/2022, 09:45 AM
Last Post: Catullus
  Holomorphic semi operators, using the beta method JmsNxn 71 5,482 06/13/2022, 08:33 PM
Last Post: JmsNxn

Users browsing this thread: 2 Guest(s)