Rechenkraft.net e.V.

We got formulas for our calculatings from here: https://en.wikipedia.org/wiki/Euler_brick I think that the parametric family there does not cover all possible Euler bricks. So I think that what you and your colleague checked is an infinite family of Euler bricks, but not all possible Euler bricks. ...

Hi x3mEn, Thanks again for sharing some more details on your algorithm. I have read the paper you provided. Although we cannot judge the efficiency of an algorithm by simply counting the number of nested loops, I admit that your two-loop idea may be better in implementation than the three-loop one i...

It has been a long time, I know, that there was no news whatsoever the results of Harmonious Trees, or Odd Weird Search. All we knew was that we found nothing, the conjectures remained safe, and even taking on more credence. It sounds a bit anti-climatic. But no! In this interval, we have been busy ...

OK, I didn't see that you are already at 2^44. And that's nice! Sorry about the previous post, and now I know that you are really exploring new territories! If you need to see whether you can optimize your code, I would be willing to help. I don't know what the exact algorithm is, but I am very inte...

EDIT: I was wrong. You never need to check for primes of the form 4k+1, since a diagonal can be written three times as sum of two squares. This reduces the numbers to check down a lot. And the limit you have checked is now beyond 2^32. -------Original post------- Hi x3mEn, In fact, upon reading all ...

Hi fwj, has this effort been made aware to the OWS community? It's nice that yoyo@home could help here but if nobody knows about it the search may restart. Do you have a paper on the algorithm or the search? Hi Christian, The paper is in preparation (I really need a long break to write all my paper...

Hi everyone, Thank you so much for your support to yoyo@home and to Odd Weird Search! We just completed the current batch on numbers lower than 10^28 with excess (or abundance) at most 10^14. In this batch, we released about 230000 workunits, and we have checked 4323850414816 = 4.3*10^12 abundant nu...

Then, why don't you run it on a double CPU system where each processor has 16 cores? Michael. Here comes the second reason: the mathematical one. It is not difficult to check to 7000. Even if I don't have such a machine, I can rent one on Amazon EC2, and the whole check will only cost ~200 bucks (u...

Could you please explain a bit more in detail why you think it might not be worth the effort? If you come up with a working code, we can run it on Yoyo@home - provided you analyze the resulting data, of course. Michael. I have a working code, but it is not good for BOINC. Let me explain. Not all al...

Der Quellcode der verwendeten App ist ebenfalls verfügbar: https://code.google.com/p/olib/source/browse/trunk/samples/mathematics/beal_conjecture_cpu_v3.c Die Projektbetreiber scheinen zwei polnische Mathematiker zu sein. I have looked into their code a bit. If this is really the code they are usin...

This workunit runs fine on my machine (yes, a version with debug information), it is just dealing with a section that contains a lot of large primes and thus very long, and the bad news is that there will be no checkpoint in this section and no one knows how long it will take. I tried to avoid this ...

I am very sorry for the bug. It is due to a new mechanism I introduced to shorten periods between checkpoints. But it seems that my tests are not so complete. The application now has the buggy mechanism removed, the checkpoint period is a bit longer (3 minutes or more), but should work well as in th...