whoops, please delete. I'll work on it.
whoops, please delete. I'll work on it.
Last edited by Kharakov; 05-15-2018 at 03:32 AM.
You may find the Phisics Forums helpful. They have a whole section of Mathematics.
https://www.physicsforums.com/
Yeah. Maybe. But I'll ask the people who know and hate me first, so they can ignore me.
So, reworked the math, realized when I was looking at it, that I was drawing correlation between 2 different sets of related equations, and I confused the results. So here is the corrected rewrite of part of the question. Hopefully it's a bit more coherent. Hopefully it's coherent. Hopefully you're coherent.
I'm sure once someone says something along the lines of "that's Bernouli's so and so...." I'll drop the matter. Couldn't find the answer in Dixon's "A Chronology of Continued Square Roots and Other Continued Functions".
Excerpt:
QUESTION: Is there a general formula for the integer coefficients a_{n} of the following (presumably) transcendental functions?***
There is a set of numbers defined by (with k= to the number of radicals + 1):
with constants associated with the numbers defined by:
with
When is known, it appears as if there is a general formula for other , with k being some natural number>1:
rational integer coefficients of terms (if x is rational and n is a natural number greater than 1) ***What is the formula for rational a_{n}, if there is a formula?
The pi^2 case is easy to see, the coefficients are
So
Wolfram Alpha Code:
Sample partial integer coefficient lists of a few other Q, with different associated q:
1,6,72,1404...
1,20,1200,148800....
1,30,3150, ?? 8127000/11 ??....
General formula for a_{n}?
I found that each of the numbers generated by this function has a sine-like expansion associated with it as well. So you can take and use it in the sine-like function to extract sine-like behaviors. Weird. It's like the various sine-like functions and cosine-like functions have different rotation periods. I wonder if the behaviors are exactly the same for the different functions?
Please help map a few.
Here is a partial rewrite, with some addition pointers to describe what I'm doing a bit more thoroughly.
The following function generates values with 3 inputs, x, n, and integer k (with k= to the number of radicals +1):
another way of looking at it is:
I use the following to identify the values that are generated by the above function as the number of radicals, k, approaches infinity:
For example:
In the following expansion for the cosine like function, so called because it is very similar to the Taylor for cosine for the pi^2 case, I use the following to denote parts of the expansion:
is the coefficients of specific terms
is the nx^(n-1)
Sample partial integer coefficient lists and partial write ups of a few q_{x,2} cosine like functions:
Here is an example of the pi cosine like function (which looks off to me for some reason- should generate 2 instead of 4 at k=0, and I could massage it so it does, but I got those a_n!! maybe it's me... sigh):
A couple of combined lists for exponential like functions for
I'd like to figure out a generating scheme for the successive numbers. The first series of cosine numbers (other than one) appears to be 2x(2x+1):6,12,20,30... if you do x=1+.5*natural. The second is f(x):=(2*x-1)*(2*x) *(2*x-1)*(2*x)*(2*x+1)/2 for 72,360.... it also works for non integer x (experimented with 4x^2-2x=11), but it's harder to see factors.
Your math is beyond me, and actually gives me a head ache.
But when you said sine like series the Fourier Transform comes to mind. Given a function the FT translates a function into a sin-cos series. It appears everywhere in applied math and technology.
It's not beyond anyone, least of all an engineer.
If I said "you take the carburetor, hook it up to intakes on the engine block, hook up each of the 6 spark wires from the distributor cap, hook up the battery, pull the choke, turn the key, and press the throttle pedal to see if it revs, if it turns over push in the choke", your mind would understand what I'm talking about.
What I described has less steps.
I'm saying put 2 numbers (x and n) into an equation to get one number c:
c=x^n-x
Use c in a repetitive function for k-1 steps (one step, pistons moving don't count as multiple steps):
When you take the limit as k-->infty, which is basically saying make the number of steps really big, you get some specific value associated with specific (x and n), which are very close to x. In other words, when you repeat the operation r_{next} = square root (r_{last} +c) a bunch of times, you get a number that is arbitrarily close to x, depending on how many times you do the operation.
Next, you take the difference between x and r_{k-1} and multiply it by the derivative of x^n taken to the kth power to get your constant (such as pi^2):
Q_{x,n,k} = (nx^{n-1})^{k} * (x-r_{k-1})
You have your constant in 3 steps:
1) create c
2) make r_{k-1}
3) multiply (x- r_{k-1}) by (nx^{n-1})^{k}
This constant is then used in functions (I'll tell you how I generate the functions at another time) that are either exactly like sine and cosine expansions (in the case of n and x being equal to 2, which makes c= to 2 as well... who does #2 work for?), or they have very similar behaviors and structure to sine and cosine.
example x=2,n=2:
So far, the e case a_{n} coefficients is easiest to describe: a_{n} = n!.
Last edited by Kharakov; 09-22-2018 at 07:34 PM.
Nice use of metaphor. In the 70s I tried a math program. It was not for me. Chains of pure abstract logical chains give me a headache.
I enjoyed learning applied math and went through proofs necessary to have an understanding.
The only easy exponential function case, for these types of constants, appears to be at the critical line n=2 (or 1/2, depending on which way you write it).
If you write it as:
and
...
You end up with the part that has every natural (thus every prime) encoded in it, at n=1/2. This is the only place I am aware of in which every natural is encoded into the equations (it's the one that generates the exponential function a_n=1,2!,3!,4!,5!,6!... and pi stuff). I wouldn't be surprised if #2 is directly related to all primes.. with this equation. Who does #2 work for?
The other ones appear to be missing specific primes in their a_n. This doesn't mean you don't find most primes, it just means all of them don't appear to be in the other q_x,n at first glace, since I don't know the actual formula for their terms, other than the a_n case.
Cosine pattern I've got up to pi^8 case. Beginning to find that pattern. Maybe. I might be wrong. Again.
I will try to express Kharakov's series in a form that makes it easier to do small-factor expansions.
Set
Then,
This has the nice result that
For ease of calculation, I did x^(1-n) -> z and power 1/n -> power p.
Mathematica code:
Result (k = 0 to 6, coefficients of z after dividing by (p*z)^k):Code:pwrx[x_, p_, n_] := Module[{t = 1, k}, t + Sum[t *= ((p - k + 1)/k)*x, {k, 1, n}] ] pwrxm1[x_, p_, n_] := Module[{t = 1, k}, Sum[t *= ((p - k + 1)/k)*x, {k, 1, n}] ] khrknext[x_, p_, n_, arg_] := Module[{k, s}, {k, s} = arg; k += 1; s = Normal[Series[- pwrxm1[-x*s, p, Floor[n/k]+1], {x, 0, n + k}]]; {k, s} ] khrk[x_, p_, n_] := CoefficientList[#, x] & /@ ((Last /@ NestList[khrknext[x, p, n, #] &, {0, 1}, n])/(p*x)^ Range[0, n]) // Factor khrk[x, p, 6] TableForm[InputForm /@ %]
{1}
{1, (1 - p)/2, ((-2 + p)*(-1 + p))/6, -((-3 + p)*(-2 + p)*(-1 + p))/24, ((-4 + p)*(-3 + p)*(-2 + p)*(-1 + p))/120, -((-5 + p)*(-4 + p)*(-3 + p)*(-2 + p)*(-1 + p))/720, ((-6 + p)*(-5 + p)*(-4 + p)*(-3 + p)*(-2 + p)*(-1 + p))/5040}
{1, (1 - p)/2, -((-1 + p)*(1 + p))/3, ((-1 + p)*(-6 - 7*p + 11*p^2))/24, -((-1 + p)*(24 + 29*p - 41*p^2 + 14*p^3))/120, -((-2 + p)*(-1 + p)*(1 + p)*(-60 - 43*p + 91*p^2))/720, ((-2 + p)*(-1 + p)*(360 + 617*p - 294*p^2 - 767*p^3 + 624*p^4))/5040}
{1, (1 - p)/2, -((-1 + p)*(1 + p))/3, -((-1 + p)*(1 + p)*(6 + p))/24, ((-1 + p)*(-24 - 29*p - 19*p^2 + 46*p^3))/120, ((-1 + p)*(-120 - 146*p - 131*p^2 + 314*p^3 + 59*p^4))/720, -((-1 + p)*(1 + p)*(720 + 154*p + 741*p^2 - 2611*p^3 + 1686*p^4))/5040}
{1, (1 - p)/2, -((-1 + p)*(1 + p))/3, -((-1 + p)*(1 + p)*(6 + p))/24, -((-1 + p)*(1 + p)*(24 + 5*p + 14*p^2))/120, ((-1 + p)*(-120 - 146*p - 131*p^2 - 46*p^3 + 419*p^4))/720, -((-1 + p)*(720 + 874*p + 895*p^2 + 440*p^3 - 2185*p^4 + 636*p^5))/5040}
{1, (1 - p)/2, -((-1 + p)*(1 + p))/3, -((-1 + p)*(1 + p)*(6 + p))/24, -((-1 + p)*(1 + p)*(24 + 5*p + 14*p^2))/120, ((-1 + p)*(1 + p)*(-120 - 26*p - 105*p^2 + 59*p^3))/720, ((-1 + p)*(-720 - 874*p - 895*p^2 - 440*p^3 - 335*p^4 + 1884*p^5))/5040}
{1, (1 - p)/2, -((-1 + p)*(1 + p))/3, -((-1 + p)*(1 + p)*(6 + p))/24, -((-1 + p)*(1 + p)*(24 + 5*p + 14*p^2))/120, ((-1 + p)*(1 + p)*(-120 - 26*p - 105*p^2 + 59*p^3))/720, -((-1 + p)*(1 + p)*(720 + 154*p + 741*p^2 - 301*p^3 + 636*p^4))/5040}
Can you run that with (not 1-, but 1+), just n=2 case:
I might be able to do that with Maxima... but...