Algorithm Optimisation Championship. - page 65
You are missing trading opportunities:
- Free trading apps
- Over 8,000 signals for copying
- Economic news for exploring financial markets
Registration
Log in
You agree to website policy and terms of use
If you do not have an account, please register
Andrey Dik:
The task is very interesting, but unfortunately not suitable for the championship for several reasons.
It can, of course, be solved after the championship is over.
You're welcome. I won't get rusty.
There is a simple equation with three unknowns a,b,c. It's pure arithmetic. Even a junior high school student can understand it. But mathematicians have been trying to solve it since time immemorial. They used a considerable arsenal of higher mathematics. But so far there is no answer to the question "Is there a solution to this equation in NUMBERS?"
Of course we will not claim to have a solution in integers. The problem is different.
Find values of double a,b,c such that they satisfy the solution of the equation or in other words find minimum F(a,b,c), and what would be found a,b,c are closest to integers.
Of course the range -10.0 to 10.0 is very small, you need to use the whole range of double and use a fine step.
This equation can be shown on the 11th of July and tell the guys to look for the roots, or it can be put into a black box, it is up to the discretion of the organizers. The one who knows the formula has no advantage. Those who already have algorithms to optimize those who prepare codes for July 11 have the advantage.
To save you from unnecessary discussions I will say that I was thinking of this CHALLENGE in the era of Sinclairs. But I was very young then and it was idle curiosity. I have no advantage whatsoever. But if you think I do, I can enter out of the competition.
The methodological principle of Ockham's razor is: "Do not multiply things unnecessarily".
That's the best way to put it! ))
Please give me the form of this equation. I already showed you the solution of the linear equation with 4 unknowns at https://www.mql5.com/ru/forum/86249.
Salom Aleikum Yusufhoja!
As far as I'm concerned, I'd put it out there. The great mathematicians never solved it in whole numbers. We don't have to. We just have to give out by optimization the closest numbers with some number of digits after the decimal point.
Whether the problem was solved with optimization algorithm or with a math package, we can check it. But the rules of the championship are different.
All I will say is that it is not a linear equation. But it is also understandable to a junior high school student.
You're welcome. I won't get rusty.
There is a simple equation with three unknowns a,b,c. It's pure arithmetic. Even a junior high school student can understand it. But mathematicians have been trying to solve it since time immemorial. They used a considerable arsenal of higher mathematics. But so far there is no answer to the question "Is there a solution to this equation in NUMBERS?"
Of course we will not claim to have a solution in integers. The problem is different.
Find values of double a,b,c such that they satisfy the solution of the equation or in other words find minimum F(a,b,c), and what would be found a,b,c are closest to integers.
Of course the range -10.0 to 10.0 is very small, you need to use the whole range of double and use a fine step.
This equation can be shown on the 11th of July and tell the guys to look for the roots, or it can be put into a black box, it is up to the discretion of the organizers. The one who knows the formula has no advantage. Those who already have algorithms to optimize those who prepare codes for July 11 have the advantage.
To save you from unnecessary discussions I will say that I was thinking of this CHALLENGE in the era of Sinclairs. But I was very young then and it was idle curiosity. I have no advantage whatsoever. But if you think I do, I can enter out of the competition.
Isn't it the great Fermat theorem you're trying to slip our contestants?
By the way, its solution was found by an English mathematician in the '90s. But this solution cannot be found algorithmically: i.e. using brute force or any search algorithms like genetics. There are some things that can only be proved mathematically and computers are powerless here.
Isn't the great Fermat theorem the one you want to plant for our participants?
By the way its solution was found by an English mathematician in the 90's. But this solution cannot be found algorithmically: i.e. using brute force or any search algorithms like genetics. There are some things that can only be proved mathematically and computers are powerless here.
That's right. Since the organizer rejected the idea, I'll put it out there.
For any natural number the equation a^n+b^n=c^n
has no solutions in non-zero integers.
I.e. for n=2 there is a solution: 3^2+4^2=5^2. And for n=3 and more it is stated that there are no solutions. Find such a and b at n=3 that the cube root of c is closest to an integer.
It is not necessary to prove or disprove the theorem, but only to find the numbers closest to integers that satisfy the solution.
The solution of the English mathematician uses a concept not accepted by all scientists. (I read it somewhere).
It's a bit of a mystery... My post, the huge one I'd written, the one I'd tried, it's gone. Only a part of what I quoted remains.
It described how a function of the form FF(f1(x1,y1)+...+ f250(x250,y250)... Has anyone seen my post? - please confirm
It's a bit of a mystery... My post, the huge one I'd written, the one I'd tried, it's gone. Only a part of what I quoted remains.
It described how a function of the form FF(f1(x1,y1)+...+ f250(x250,y250)... Has anyone seen my post? - Please confirm.
I haven't seen it. Was that tonight? Sleeping.
ZS. And about mysticism and Fermat's theorem, you can read it here http://booksonline.com.ua/view.php?book=85946
It's a bit of a mystery... My post, the huge one I'd written, the one I'd tried, it's gone. Only a part of what I quoted remains.
It described how a function of the form FF(f1(x1,y1)+...+ f250(x250,y250)... Has anyone seen my post? - please confirm
I saw your post. I wrote about the principle of Ockham's Razor.
Well, I wasn't dreaming about him.
So what, you're writing here, and suddenly it's gone! I'm outraged!