Jsun Yui Wong
The computer program listed below seeks to solve the following Moessner (1959) 6.1.20 Diophantine equation from Weisstein [14].
X(1) ^ 6 + X(2) ^ 6 + X(3) ^ 6 + X(4) ^ 6 + X(5) ^ 6 + X(6) ^ 6 + X(7) ^ 6 + X(8) ^ 6 + X(9) ^ 6 + X(10) ^ 6 + X(11) ^ 6 + X(12) ^ 6 + X(13) ^ 6 + X(14) ^ 6 + X(15) ^ 6 + X(16) ^ 6 + X(17) ^ 6 + X(18) ^ 6 + X(19) ^ 6 + X(20) ^ 6 = X(21) ^ 6
While line 177 through line 181 of the preceding paper are as follows:
177 FOR JJ11 = 1 TO 19
178 FOR JN = JJ11 + 1 TO 20
179 IF X(JJ11) = X(JN) THEN 1670
180 NEXT JN
181 NEXT JJ11
line 189 through line 193 of the present paper are as follows:
189 FOR JJ11 = 1 TO 19
190 FOR JN = JJ11 + 1 TO 20
191 IF X(JJ11) = X(JN) THEN 1670
192 NEXT JN
193 NEXT JJ11
The following computer program uses qb64v1000-win [12, 16]. One notes line 88 below, which is 88 FOR JJJJ = -32000 TO 32000 STEP .1.
0 DEFDBL A-Z
1 DEFINT I, K, A, X
2 DIM B(99), N(99), A(2002), H(99), L(99), U(99), X(2002), D(111), P(111), PS(33), J(99), AA(99), HR(32), HHR(32), PLHS(44), LB(22), UB(22), PX(44), J44(44), PN(22), NN(22)
88 FOR JJJJ = -32000 TO 32000 STEP .1
89 RANDOMIZE JJJJ
90 M = -3D+30
111 FOR J44 = 1 TO 21
112 A(J44) = 1 + (RND * 40)
113 NEXT J44
128 FOR I = 1 TO 4000
129 FOR KKQQ = 1 TO 21
130 X(KKQQ) = A(KKQQ)
131 NEXT KKQQ
139 FOR IPP = 1 TO FIX(1 + RND * 6)
140 B = 1 + FIX(RND * 21)
150 R = (1 - RND * 2) * A(B)
155 IF RND < .5 THEN 160 ELSE GOTO 167
160 X(B) = (A(B) + RND ^ 3 * R)
164 REM IF RND<.5 THEN X(B)=(A(B)-RND*10) ELSE X(B)=(A(B) +RND*10)
165 GOTO 168
167 IF RND < .5 THEN X(B) = CINT(A(B) - 1) ELSE X(B) = CINT(A(B) + 1)
168 NEXT IPP
185 FOR J44 = 1 TO 21
186 IF X(J44) > 60 THEN X(J44) = 10 + FIX(RND * 30)
187 IF X(J44) < 1 THEN X(J44) = 1 + FIX(RND * 10)
188 NEXT J44
189 FOR JJ11 = 1 TO 19
190 FOR JN = JJ11 + 1 TO 20
191 IF X(JJ11) = X(JN) THEN 1670
192 NEXT JN
193 NEXT JJ11
195 X(21) = ((X(1) ^ 6# + X(2) ^ 6# + X(3) ^ 6# + X(4) ^ 6# + X(5) ^ 6# + X(6) ^ 6# + X(7) ^ 6# + X(8) ^ 6# + X(9) ^ 6# + X(10) ^ 6# + X(11) ^ 6# + X(12) ^ 6# + X(13) ^ 6# + X(14) ^ 6# + X(15) ^ 6# + X(16) ^ 6# + X(17) ^ 6# + X(18) ^ 6# + X(19) ^ 6# + X(20) ^ 6#)) ^ .1666666666666666666666666666666##
211 N(7) = X(21) ^ 6# - X(1) ^ 6# - X(2) ^ 6# - X(3) ^ 6# - X(4) ^ 6# - X(5) ^ 6# - X(6) ^ 6# - X(7) ^ 6# - X(8) ^ 6# - X(9) ^ 6# - X(10) ^ 6# - X(11) ^ 6# - X(12) ^ 6# - X(13) ^ 6# - X(14) ^ 6# - X(15) ^ 6# - X(16) ^ 6# - X(17) ^ 6# - X(18) ^ 6# - X(19) ^ 6# - X(20) ^ 6#
322 PD1 = -ABS(N(7))
1111 IF PD1 <= M THEN 1670
1452 M = PD1
1454 FOR KLX = 1 TO 21
1455 A(KLX) = X(KLX)
1456 NEXT KLX
1557 GOTO 128
1670 NEXT I
1889 IF M < 0 THEN 1999
1904 PRINT A(1), A(2), A(3), A(4)
1905 PRINT A(5), A(6), A(7), A(8)
1906 PRINT A(9), A(10), A(11), A(12)
1907 PRINT A(13), A(14), A(15), A(16)
1908 PRINT A(17), A(18), A(19), A(20)
1922 PRINT A(21), M, JJJJ
1999 NEXT JJJJ
This computer program was run with qb64v1000-win [12, 16]. Copied by hand from the screen, the computer program’s complete output through
JJJJ= -29025.70000004328 is shown below:
8 28 34 38
42 36 39 35
32 15 48 7
18 33 6 30
21 23 27 25
57 0 -29025.70000004328
Above there is no rounding by hand; it is just straight copying by hand from the screen.
On a personal computer with a Pentium Dual-Core CPU E5200 @2.50GHz, 2.50 GHz, 960 MB of RAM and with qb64v1000-win [12, 16], the wall-clock time for obtaining the output through JJJJ= -29025.70000004328 was 22 minutes.
Acknowledgment
I would like to acknowledge the encouragement of Roberta Clark and Tom Clark.
References
[1] S. Abraham, S. Sanyal, M. Sanglikar (2013), Finding Numerical Solutions of Diophantine Equations Using Ant Colony Optimization. Applied Mathematics and Computation 219 (2013), pages 11376-11387.
[2] J. L. Brenner, Lorraine L. Foster (1982), Exponential Diophantine Equations. Pacific Journal of Mathematics, Volume 101, Number 2, 1982, Pages 263-301.
[3] Martin Gardner (1979), Mathematical Games. Scientific American, 241 (3), Page 25.
[4] Martin Gardner (1983), Diophantine Analysis and Fermat’s Last Theorem, Chapter 2 of Wheels, Life and Other Mathematical Amusements. New York, San Francisco: W. H. Freeman and Company (1983). http://www.labeee.ufsc.br/~luis/ga/Gardner.pdf
[5] L. J. Lander, T. R. Parkin (1966), Counterexample to Euler’s Conjecture on Sums of Like Powers. The Bulletin of American Mathematical Society, Vol. 72, 1966, page 1079.
[6] L. J. Lander, T. R. Parkin (1967), A Counterexample to Euler’s Sum of Powers Conjecture. Mathematics of Computation, Vol. 21, January 1967, pages 101-103.
[7] L. J. Lander, T. R. Parkin, J. L. Selfridge (1967), A Survey of Equal Sums of Like Powers. Mathematics of Computation, Vol. 21, July 1967, pages 446-459.
[8] Microsoft Corp., BASIC, Second Edition (May 1982), Version 1.10. Boca Raton, Florida: IBM Corp., Personal Computer, P. O. Box 1328-C, Boca Raton, Florida 33432, 1981.
[9] O. Perez, I. Amaya, R. Correa (2013), Numerical Solution of Certain Exponential and Non-linear Diophantine Systems of Equations by Using a Discrete Particles Swarm Optimization Algorithm. Applied Mathematics and Computation, Volume 225, 1 December 2013, Pages 737-746.
[10] Tito Piezas III, Euler Bricks and Quadruples. http://sites.google.com/site/tpiezas/0021
[11] W. Sierpinski, A Selection of Problems in the Theory of Numbers. New York: The McMillan Company, 1964.
[12] E.K. Virtanen (2008-05-26). “Interview With Galleon”.
http://www.basicprogramming.org/PCOPY!issue70/#galleoninterview
[13] Michel Waldschmidt, Open Diophantine Problems. Moscow Mathematical Journal, Volume 4, Number 1, January-March 2004, Pages 245-305.
[14] Eric Weisstein. Diophantine Equation--6th Powers.
http://mathworld.wolfram.com/DiophantineEquation6thPowers.html
[15] Wikipedia, Euler's sum of powers conjecture. https://en.wikipedia.org/wiki/Euler%27s_sum_of_powers_conjecture
[16] Wikipedia, QB64, https://en.wikipedia.org/wiki/QB64
No comments:
Post a Comment