Jump to: navigation, search
(June 29th, 2017)
(June 29th, 2017)
Line 13: Line 13:
==June 29th, 2017 ==
==June 29th, 2017 ==
[[:image:Genocchi-eng.pdf||Genocchi's numbers]]
[:image:Genocchi-eng.pdf|Genocchi's numbers]
==Tuesday, January 29, 2009 ==
==Tuesday, January 29, 2009 ==

Revision as of 14:41, 29 June 2017

Personal Information
nameHans Georg Schmid

June 29th, 2017

[:image:Genocchi-eng.pdf|Genocchi's numbers]

Tuesday, January 29, 2009

The case of a shorter and more straight forward proof that the fractions: q_(2t) / q_(2t + 2) are decreasing

Tuesday, December 9, 2008

The Monster Fractions continued

Look at this difference:

<math>\delta_{s}=\left(\left|\frac{q_{(2\cdot s)}}{q_{(2\cdot s+2)}}\right|-\left|\frac{q_{(2\cdot t)}}{q_{(2\cdot t+2)}}\right|\right)\cdot\frac{|q_{(2\cdot t+2)}|}{|q_{(2\cdot t)}|}\cdot |q_{(2\cdot s+2)}|\cdot |q_{(2\cdot t-2\cdot s)}|</math> <math>-\left(\left|\frac{q_{(2\cdot s)}}{q_{(2\cdot s+2)}}\right|-\left|\frac{q_{(2\cdot t)}}{q_{(2\cdot t+2)}}\right|\right)\cdot\frac{|q_{(2\cdot t+2-2\cdot s)}|}{|q_{(2\cdot t-2\cdot s)}|}\cdot |q_{(2\cdot s+2)}|\cdot |q_{(2\cdot t-2\cdot s)}| </math>

which can be written as this product:

<math>\delta_{s}=\left(\left|\frac{q_{(2\cdot s)}}{q_{(2\cdot s+2)}}\right|-\left|\frac{q_{(2\cdot t)}}{q_{(2\cdot t+2)}}\right|\right) \cdot \left(\left|\frac{q_{(2\cdot t+2)}}{q_{(2\cdot t)}}\right|-\left|\frac{q_{(2\cdot t+2-2\cdot s)}} {q_{(2\cdot t-2\cdot s)}}\right|\right)\cdot|q_{(2\cdot s+2)}|\cdot |q_{(2\cdot t-2\cdot s)}| </math>

It is about my q-values, which is a function of the natural numbers and zero. Here we are focused on the even numbers.

The function of the even numbers are producing a series of small rational numbers the numeric values of which are decreasing as t approaches infinity exponentially much like the values of a function such as <math>(\frac{1}{40})^n</math>.

I constructed this <math>\delta_s</math>-product (or rather it materialized out of the blue) in the battle of proving that the fraction <math>\left|\frac{q_{(2\cdot t)}}{q_{(2\cdot t+2)}}\right|</math> was falling too

The proof turned out to be a rather lengthy affair. It took me 18 pages to convince myself that I had got it right. It was a reductio ad absurdum-proof: if the function is not decreasing 2 might as well be 4 - you know.

I have never used that kind of proof before even though I admire Euclid's famous proof that there can't be any greatest prime number.

Since I finished the proof I have had this feeling that I must be able to do a little shorter and more straightforward.

For some time actually for a couple of years, I have tried to prove that what I call the the monsterfraction is decreasing too: The monsterfraction:

<math>\frac{\left|\frac{q_{(2\cdot t-2)}}{q_{(2\cdot t)}}\right|}{\left|\frac{q_{(2\cdot t)}}{q_{(2\cdot t+2)}}\right|}</math>

Long time ago I proved that if the series of the smaller fractions <math>\left|\frac{q_{(2\cdot t-2)}}{q_{(2\cdot t)}}\right|</math> were decreasing then the monsters had the limit 1, but even though they are all bigger than one since

<math>\left|\frac{q_{(2\cdot t-2)}}{q_{(2\cdot t)}}\right|>\left|\frac{q_{(2\cdot t)}}{q_{(2\cdot t+2)}}\right|</math>

there are different ways of reaching 1 than clean falling as I have explained earlier. It is a little like the cat trying to catch its tail.

But if the monsters are strictly decreasing towards 1, our smaller fraction must get more and more close to each other. Packed together in the correct order.

In other words they will have a common limit.

Now let us return to the <math>\delta_s</math>-product and the case of a shorter and more straightforward proof that <math>\left|\frac{q_{(2\cdot t)}}{q_{(2\cdot t+2)}}\right|</math> is a decreasing series:

<math>\delta_{s}=\left(\left|\frac{q_{(2\cdot s)}}{q_{(2\cdot s+2)}}\right|-\left|\frac{q_{(2\cdot t)}}{q_{(2\cdot t+2)}}\right|\right) \cdot \left(\left|\frac{q_{(2\cdot t+2)}}{q_{(2\cdot t)}}\right|-\left|\frac{q_{(2\cdot t+2-2\cdot s)}} {q_{(2\cdot t-2\cdot s)}}\right|\right)\cdot|q_{(2\cdot s+2)}|\cdot |q_{(2\cdot t-2\cdot s)}| </math>

It is rather laborious calculations, but we could let Maple affirm for all s greater than zero up to a chosen t (let us say <math>t=10</math>), that the first difference in the product is positive, or what is actually the same thing, that <math>\left|\frac{q_{(2\cdot s)}}{q_{(2\cdot s+2)}}\right|</math> is falling as long as <math>0<s<t</math>

Now the second factor in the product must be positive too, since <math>a>b</math> means that <math>\frac{1}{b}>\frac{1}{a}</math>

Could we get away with letting s be equal to zero and later equal to t? Well it would not make much difference since in both cases the product will be zero.

The last 2 factors are secured to be positive by the numeric signs, so the product will be positive or zero at least until s reaches t.

What about the difference between the next 2 fractions: <math>\left|\frac{q_{(2\cdot t)}}{q_{(2\cdot t+2)}}\right|-\left|\frac{q_{(2\cdot t+2)}}{q_{(2\cdot t+4)}}\right|</math>

Well we could add all these <math>\delta_s</math>-products in a sum and call it big delta: <math>\Delta_{q_{(2\cdot t+2)}}=\sum_{s=0}^{t}\delta_{s}</math>

And I can show that

<math>\left( \left|\frac{q_{(2\cdot t)}}{q_{(2\cdot t+2)}}\right|-\left| \frac{q_{(2\cdot t+2)}}{q_{(2\cdot t+4)}}\right|\right)\cdot(2\cdot t+5)\cdot|q_{2\cdot t+4}|=\Delta_{q_{(2\cdot t+2)}}</math>


<math>\left( \left|\frac{q_{(2\cdot t)}}{q_{(2\cdot t+2)}}\right|-\left| \frac{q_{(2\cdot t+2)}}{q_{(2\cdot t+4)}}\right|\right)=\frac{\Delta_{q_{(2\cdot t+2)}}}{(2\cdot t+5)\cdot|q_{2\cdot t+4}|}</math>

<math>\left|\frac{q_{(2\cdot t)}}{q_{(2\cdot t+2)}}\right|</math> must be bigger than <math>\left|\frac{q_{(2\cdot t+2)}}{q_{(2\cdot t+4)}}\right|</math> since the difference is the sum of positive numbers divided by a positive product.

Which was to be proved.

This is certainly shorter and more simple than the original proof. It is a classical proof of induction

Yes I still need to show the last step. I will simply steal it from my old lengthy proof. I will come back to that, but at first we will return to the <math>\delta_s</math>-products or rather to the difference before it:

<math>\delta_{s}=\left(\left|\frac{q_{(2\cdot s)}}{q_{(2\cdot s+2)}}\right|-\left|\frac{q_{(2\cdot t)}}{q_{(2\cdot t+2)}}\right|\right)\cdot\frac{|q_{(2\cdot t+2)}|}{|q_{(2\cdot t)}|}\cdot |q_{(2\cdot s+2)}|\cdot |q_{(2\cdot t-2\cdot s)}|</math> <math>-\left(\left|\frac{q_{(2\cdot s)}}{q_{(2\cdot s+2)}}\right|-\left|\frac{q_{(2\cdot t)}}{q_{(2\cdot t+2)}}\right|\right)\cdot\frac{|q_{(2\cdot t+2-2\cdot s)}|}{|q_{(2\cdot t-2\cdot s)}|}\cdot |q_{(2\cdot s+2)}|\cdot |q_{(2\cdot t-2\cdot s)}| </math>

because there may be more than one story to be told:

Thursday, January 24, 2008

The Monster Fractions continued

In the summer 2006 I spent a week's holiday in the cottage of Rosenholm in Smaaland in Sweden. During that time I made this proposition with a little help from Maple. I found it very interesting, maybe I found it more interesting, than it deserves. But it served me well for some time.

I called it The Rosenholm Model:


If this hypothesis is correct, it must too be true that:


and this:


The following product must be bigger than 1:

<math>\left(\frac{\frac{q(n-4)}{q(n-2)}}{\frac{q(n-2)}{q(n)}}\cdot\frac{\frac{q(n-2)}{q(n)}}{\frac{q(n)}{q(n+2)}}\right) </math>

And therefore this must be right:


We may now tentatively write:

<math>\left(\frac{q(n-2)}{q(n)}\cdot\frac{q(n)}{q(n+2)}\right)^{\frac{1}{2^{(n)}}}<\left(\frac{q(n-4)}{q(n-2)}\cdot\frac{q(n-2)}{q(n)}\right)^{\frac{1}{2^{(n)}}}<\left(\frac{\frac{q(n-2)}{q(n)}}{\frac{q(n)}{q(n+2)}}\right)^4<\left(\frac{\frac{q(n-4)}{q(n-2)}}{\frac{q(n-2)}{q(n)}}\right)<\left(\frac{q(n-2)}{q(n)}\cdot\frac{q(n)}{q(n+2)}\right)^{\frac{1}{2^{(n-1)}}}</math> <math><\left(\frac{q(n-4)}{q(n-2)}\cdot\frac{q(n-2)}{q(n)}\right)^{\frac{1}{2^{(n-1)}}}</math>

We could raise every expression to the power of <math>2^{n}</math>:

<math>\left(\frac{q(n-2)}{q(n)}\cdot\frac{q(n)}{q(n+2)}\right)<\left(\frac{q(n-4)}{q(n-2)}\cdot\frac{q(n-2)}{q(n)}\right)<\left(\frac{\frac{q(n-2)}{q(n)}}{\frac{q(n)}{q(n+2)}}\right)^{2^{n+2}}<\left(\frac{\frac{q(n-4)}{q(n-2)}}{\frac{q(n-2)}{q(n)}}\right)^{2^{n}}<\left(\frac{q(n-2)}{q(n)}\cdot\frac{q(n)}{q(n+2)}\right)^{2}</math> <math><\left(\frac{q(n-4)}{q(n-2)}\cdot\frac{q(n-2)}{q(n)}\right)^{2}</math>

And extrapolate:

<math>\left(\frac{q(n-2)}{q(n)}\cdot\frac{q(n)}{q(n+2)}\right)<\left(\frac{q(n-4)}{q(n-2)}\cdot\frac{q(n-2)}{q(n)}\right)<\ldots<\left(\frac{q(4)}{q(6)}\cdot\frac{q(6)}{q(8)}\right)<</math> <math>\left(\frac{\frac{q(n-2)}{q(n)}}{\frac{q(n)}{q(n+2)}}\right)^{2^{n+2}}<\left(\frac{\frac{q(n-4)}{q(n-2)}}{\frac{q(n-2)}{q(n)}}\right)^{2^{n}}<\ldots<\left(\frac{\frac{q(4)}{q(6)}}{\frac{q(6)}{q(8)}}\right)^{2^{8}}</math> <math><\left(\frac{q(n-2)}{q(n)}\cdot\frac{q(n)}{q(n+2)}\right)^{2} <\left(\frac{q(n-4)}{q(n-2)}\cdot\frac{q(n-2)}{q(n)}\right)^{2}<\ldots<\left(\frac{q(4)}{q(6)}\cdot\frac{q(6)}{q(8)}\right)^2</math>

The Rosenholm Model lead us to the same conclusion:


The row of monsters raised from the power of <math>2^{6}</math> to <math>2^{n+2}</math>:

<math>\left(\frac{\frac{q(n-2)}{q(n)}}{\frac{q(n)}{q(n+2)}}\right)^{2^{n+2}}</math> seems to be decreasing and as <math>n</math> gets bigger, it gets suspiciuosly close to


for <math>n=60</math> it is <math>8103.08393\ldots</math>

What about the expressions?

<math>\left(\frac{q(n-2)}{q(n)}\cdot\frac{q(n)}{q(n+2)}\right)</math> and <math>\left(\frac{q(n-2)}{q(n)}\cdot\frac{q(n)}{q(n+2)}\right)^{2}</math>

They are falling too and very soon getting suspiciuosly close to

<math>(2\cdot \pi)^{4}=1558.545456544038\ldots</math>


<math>(2\cdot \pi)^{8}=2429063.9401140669\ldots</math>.

This matches the numerical values of the expressions for <math>n=60</math>.

<math>e^{9}</math> and all the corresponding monsters except the first are between them.

This is no big deal, not really interresting though I thought so at the time, I can place the blame on Maple :)

I have just stumbled into two expressions: <math>\left(\frac{q(n-2)}{q(n)}\cdot\frac{q(n)}{q(n+2)}\right)</math> and <math>\left(\frac{q(n-2)}{q(n)}\cdot\frac{q(n)}{q(n+2)}\right)^{2}</math> , which soon get near fixed numbers:

<math>(2\cdot \pi)^{4}</math> and <math>(2\cdot \pi)^{8}</math>

and placed conveniently on each side of the row.

I could have picked the numbers: <math>2000</math> and <math>10000</math>, and they would have fitted just as well or better.

I first realized this when I raised all expressions to the power of <math>2^{n+2}</math>.

What about <math>\left(\frac{\frac{q(n-2)}{q(n)}}{\frac{q(n)}{q(n+2)}}\right)</math> getting <math>1</math> in the limit? Well, it looks like that we now have this row:


If we raise all expressions to the power of<math>\frac{1}{2^{(n+2)}}</math> we will get:


and <math>\left(\frac{\frac{q(n-2)}{q(n)}}{\frac{q(n)}{q(n+2)}}\right)</math> will not only approach <math>1</math> pretty fast, but approach each other even faster:


matching for <math>n=60</math>



<math>\frac{9}{2^{(n+2)}}\rightarrow 0, n\rightarrow \infty </math>

and <math>e^0=1</math>

By the way

for <math>n=60</math>



Tuesday, November 20, 2007

The Monster Fractions

I have done some cleaning up in my mathematical projekt about the q-values:

It concerns this fraction: <math>\frac{\left(\frac{q(n-2)}{q(n)}\right)}{\left(\frac{q(n)}{q(n+2)}\right)}</math> Why would anyone be interested in this monster?

Well, I am, because if the limit is 1, the reason must be that the two fractions in the monster: <math>\left(\frac{q(n-2)}{q(n)}\right)</math> and <math>\left(\frac{q(n)}{q(n+2)}\right)</math> are getting more and more equal when n gets bigger. In other words the fraction: <math>\left(\frac{q(n-2)}{q(n)}\right)</math> has a limit value for <math>n\rightarrow \infty</math>.

Last Christmas (2006) I proved this to be the case under the condition that <math>\left(\frac{q(n-2)}{q(n)}\right)</math> was a falling function (getting smaller for bigger n). A condition which I finally proved in the spring this year.

Now the stage should be set to prove what the limit of this fraction is. The first fraction in the row <math>\left(\frac{q(2)}{q(4)}\right)</math> being 60 and the "last" are bigger than 39 (proven, and I can do better than that).

Before I start on that project I would like to prove that the monster too is falling when n gets bigger.

You may think it has to be falling always being bigger than 1 because <math>\left(\frac{q(n-2)}{q(n)}\right)>\left(\frac{q(n)}{q(n+2)}\right)</math> and never the less ending up being 1 in the limit.

But it don't has to get there falling every time n grows to (n+2).

The graph could look like a staircase. Values of the monsters being the same for a couple of n's then fall.

Or it could look like the graph for sales numbers in directors office in a firm not going too good. Every now and then the director says: "We are doing better now", but next month the graph drops again and lower than ever before.

Maple suggests, that the monster falls in such a way, that the next value is lesser than the fourth root of it: <math>\frac{\left(\frac{q(n-2)}{q(n)}\right)}{\left(\frac{q(n)}{q(n+2)}\right)}<\left(\frac{\left(\frac{q(n-4)}{q(n-2)}\right)}{\left(\frac{q(n-2)}{q(n)}\right)}\right)^{(\frac{1}{4})}</math> And that is falling since the monsters are all bigger than 1.

Had they been smaller than 1, they would get bigger, when you take the fourth root of them.

The inequality above could be extrapolated backwards to the start of the monsters: <math> 1<\frac{\left(\frac{q(n-2)}{q(n)}\right)}{\left(\frac{q(n)}{q(n+2)}\right)}<\left(\frac{\left(\frac{q(n-4)}{q(n-2)}\right)}{\left(\frac{q(n-2)}{q(n)}\right)}\right)^{(\frac{1}{2^{2}})}<\left(\frac{\left(\frac{q(n-6)}{q(n-4)}\right)}{\left(\frac{q(n-4)}{q(n-2)}\right)}\right)^{(\frac{1}{2^{4}})}<\cdots <\left(\frac{\left(\frac{q(n-(s+2))}{q(n-s)}\right)}{\left(\frac{q(n-s)}{q(n-(s-2))}\right)}\right)^{(\frac{1}{2^{s}})}<\cdots<\left(\frac{\left(\frac{q(2))}{q(4)}\right)}{\left(\frac{q(4)}{q(6))}\right)}\right)^{(\frac{1}{2^{(n-4)}})} </math>

<math>0\leq s\leq (n-4)</math>

If <math>s=(n-4)</math> we get the <math>2^{(n-4)}</math>'th root of the first monster : <math>\left(\frac{\left(\frac{q(2))}{q(4)}\right)}{\left(\frac{q(4)}{q(6))}\right)}\right)^{(\frac{1}{2^{(n-4)}})}</math>

which by the way don't deserve the name being the nice simple rationel number: <math>\frac{10}{7}</math>

But this simplicity will soon come to an end, as n grows.

I was very proud years ago, when I finally proved (with the help of the harmonic series, I remember) that no matter how big an a is, sooner or later it will end up being very near 1 if you take the n'th root of it and make n bigger and bigger. <math>a^{\frac{1}{n}}\rightarrow 1, n\rightarrow \infty </math>

It will be sooner not later if you take the <math>2^{s}</math>'th root of <math>\frac{10}{7}</math>, which is not even a big number. <math>\left(\frac{10}{7}\right)^{\frac{1}{2^{s}}} \rightarrow 1, s\rightarrow \infty </math>

If I could prove this suggestion from maple I could forget about my rather elaborate proof for the monsters jumping or spiraling down to 1

Monday, August 20, 2007

Dark Matter continued: The Case of the Missing Galaxies

Science, 3 August 2007, Newsfocus page 594, Where Are the Invisible Galaxies -Adrian Cho.

I am very impressed by the story from 1933:

Some of galaxies in the Coma cluster moving so fast, that they ought to leave the cluster

And the parallel story from 1960-70:

The stars in the outskirts of galaxies moving so fast that they should whirl out in the emptiness between the galaxies.

There should be a lot of small galaxies of dark matter around but nobody can find them.

There should be galaxies of ordinary matter marked of the encounter with galaxies of dark matter but nobody can find them.

I can't help thinking of Boyle's experiment where he (if the story is true) tries to move a feather with the aether in a box without air.

And Michelson and Morley's trying to show that an observer moving relative to the aether should obtain different velocities of the light in the direction of this moving and the perpendicular one.

The dark matter has the property of invisibility. Maybe it has the property of not interfering with ordinary matter. Like the Boyle's aether it just moves through it.

Maybe it has the property of not existing :)

Maybe some day it will be thought unnecessary to explain the problems with the help of the dark matter.

Maybe some day a new Einstein will explain gravity and velocity are intertwined like the old one explained time and velocity are intertwined as mass and velocity are.

I just annihilated 90 percent of the universe.

Lørdag d. 11. August 2007

Endangered species

Hazel Dormouse

Earlier this year there was som focus in my newspaper 'Jyllandsposten' on a bridge build to cross a highway some place in Jylland or was it Fyn :) to make the transversal possible for the little Hazel Dormouse (Muscardinus avellanarius from the family Myoxidae), which is threatened by extinction in Denmark. The project cost severeal millions of DKK.

I was amused and at the same time touched.

Can't you imagine the nature guard sitting at the end of bridge asking every passing field vole (Microtus agrestis): 'are you really a hazel dormouse?'

I hope the bridge will be fregvented by a lot of other animals. Since I was young the only badgers (Meles meles), I have seen are the ones killed by cars at the side of the road.

Lets hope however they don't meet in the passing, the badger and hazel dormouse, I mean.

Recalling this famous old touristposter from Copenhagen where a policeman escorts a duck with all her ducklings over the street, and now the dormouse. Is'nt Denmark a wonderful country, was my thought.

Field Vole
European Badger

The Delta Smelt

But then I just read about the delta smelt (Hypomesus transpacificus) from California.

Science, 27 Juli 2007, page 442, Delta Blues, California Style by Robert F. Service.

A California Superior Court have ordered a stop in 10 days of the pumps that send 1/3 of the water from Sacramento- and San Joaquin rivers back, so it can be used as drinking water and to irrigating in order to give the smelts a pause.It seems the smelts get trapped in the filters in front of the pumps because the surge from them are too strong. If the court makes a habit out of this, then we are not talking about several million DKK. or even dollars, but billions, if I understand the author of the article.

Maybe I should correct myself and say: 'what a wonderful world'

Or maybe it's not that amusing or wonderful, maybe its a kind of warning. There may be something wrong in Denmark and the rest of world. We may not be talking so much of Mice as of Men.

But I am still smiling. So small animals so much commotion.

Mandag d. 5. August 2007

Sort stof

Dark Matter

Der er vældig gang i emnet sort stof.

Nogen laver billeder af det, ikke helt simpelt, når det er usynligt (American Scientist, maj-juni, sd. 258). Blåligt 'frøslim' lidt spøgelsesagtigt. Spøgelser er jo også næsten usynlige.

Aetherhypotesen genoplivet


(Science, 6. juli 2007, sd. 32. Racing to Capture Darkness.)

Bedst ville det være om man kunne få stoffet til at interagere med almindelige velkendte partikler.

Rita Bernabei og hendes team i det italienske DAMA projekt, mener, at det er lykkedes for dem i et 100 kilogram array af natriumjodidkrystaller.

Der er endda tegn på årstidsvariationer i antallet af kollisioner, svarende til, at mælkevejen drejer rundt i en dark matter-suppe, så jorden f.eks. om sommeren bevæger sig mod vinden og om vinteren med vinden eller omvendt.

Jeg mener, Boyle gjorde et forsøg på at blæse til en fjer med en lille blæsebælg i et lufttomt rum, og måtte konstatere at aethervinden var for tynd til påvirke fjeren. Blæsebælgen kunne måske ikke presse den sammen, den sivede måske gennem læderet, evt. sivede den gennem fjeren uden at påvirke den.

Ole Rømer opdagede lysets forsinkelse ved hjælp af en måneformørkelse ved Jupiter registreret på forskellige tidspunkter af året og beregnede lysets hastighed.

Michelsen og Morleys forsøg på at måle lysets hastighed mod og med aethervinden burde gentages mod denne nye dark matter-vind.

Problemet er selvfølgelig, at med og mod i deres forsøg var samtidig, men med lidt fantasi og hjælp fra en eller anden meget præcis pulsar? Men det er der nok nogen, der har tænkt på.