11/15/2014, 01:21 PM

As mentioned before Im considering number theory connections to tetration.

One of those ideas is representations.

Every integer M is the sum of 3 triangular number ...

or 4 squares.

Also every integer M is the sum of at most O(ln(M)) powers of 2.

This is all classical and pretty well known.

But there are functions that have growth between polynomials and powers of 2.

So since 2sinh is close to exp and 2sinh^[0.5](0) = 0 , it is natural to ask

2S(n) := floor 2sinh^[0.5](n)

2S-1(n) := floor 2sinh^[-0.5](n)

2S numbers := numbers of type 2S(n)

2S-1 numbers := numbers of type 2S-1(n)

1) Every positive integer M is the sum of at most A(M) 2S numbers.

A(M) = ??

2) Every positive integer M is the sum of at most 2S(M) B numbers.

B numbers := B(n) = ??

Of course we want sharp bounds on A(M) and B(n).

( A(M) = 4 + 2^M works fine but is not intresting for instance )

regards

tommy1729

One of those ideas is representations.

Every integer M is the sum of 3 triangular number ...

or 4 squares.

Also every integer M is the sum of at most O(ln(M)) powers of 2.

This is all classical and pretty well known.

But there are functions that have growth between polynomials and powers of 2.

So since 2sinh is close to exp and 2sinh^[0.5](0) = 0 , it is natural to ask

2S(n) := floor 2sinh^[0.5](n)

2S-1(n) := floor 2sinh^[-0.5](n)

2S numbers := numbers of type 2S(n)

2S-1 numbers := numbers of type 2S-1(n)

1) Every positive integer M is the sum of at most A(M) 2S numbers.

A(M) = ??

2) Every positive integer M is the sum of at most 2S(M) B numbers.

B numbers := B(n) = ??

Of course we want sharp bounds on A(M) and B(n).

( A(M) = 4 + 2^M works fine but is not intresting for instance )

regards

tommy1729