![]() |
![]() |
#12 | |
Feb 2003
36008 Posts |
![]() Quote:
The old Nash tool as given here in this thread was specifically created for k*2^n-1 and will yield: Code:
nash 93 --> 93 3116 3123 The new (universal) Nash tool (originally created upon your request) and given in another thread yields the correct answer: Code:
nash -93 10 --> -93 5030 5045 BTW.: Note the sign change between the two versions: For the new one enter negative k for the Riesel side, e.g. -k*b^n+1 for k*^b^n-1. Regarding your second question: mnash is restricted to base 2. But one could easily write a little Python or Perl script which does the looping over k and calls the new Nash tool... Last fiddled with by Thomas11 on 2015-07-03 at 11:03 |
|
![]() |
![]() |
![]() |
#13 |
Feb 2003
27×3×5 Posts |
![]()
I prepared a new version of mnash which is now also capable for bases other than b=2.
For convenience the attached ZIP file also contains the latest single k universal base nash.exe. A positive k means k*b^n+1, negative k means k*b^n-1 (e.g. entering as -k*b^n+1) Usage examples are given below: Nash weights for sequences k*3^n-1 (for even k=10-20): Code:
mnash -20 -10 2 3 (= kmin kmax kstep base) -20 3 2960 2960 -18 3 2686 2667 -16 3 1430 1435 -14 3 1524 1523 -12 3 2359 2369 -10 3 4054 4038 and for k*7^n+1: Code:
mnash 10 20 2 7 10 7 4000 3979 12 7 2407 2411 14 7 0 0 16 7 3211 3210 18 7 2392 2387 20 7 0 0 Code:
nash -14 17 -14 17 803 800 Last fiddled with by Thomas11 on 2015-07-03 at 12:18 |
![]() |
![]() |
![]() |
#14 |
Dec 2011
After milion nines:)
5FD16 Posts |
![]()
Mnash rules!
Thanks so much! |
![]() |
![]() |
![]() |
#15 |
Feb 2003
27·3·5 Posts |
![]()
I did some minor improvements to the "mnash" tool:
(1) The earlier version was restricted to k<2^31, the new one can handle k of arbitrary size. (2) The values "kmin" and "kmax" now have the meaning of start and stop values and you're no longer restricted to (numerically) increasing order. (3) The sign of the step size doesn't matter. It will be adjusted properly. So a step size of 2 may be entered as "2" oder "-2". (4) If only kmin and kmax are given, a step size of 2 is assumed. And base=2, of course. To give an example: Code:
mnash -2 -10 2 13 -2 13 3721 3713 -4 13 0 0 -6 13 1416 1414 -8 13 963 965 -10 13 0 0 Code:
mnash 123456789012345678901234567890 123456789012345678901234567880 2 7 123456789012345678901234567890 7 3543 3571 123456789012345678901234567888 7 1370 1345 123456789012345678901234567886 7 0 0 123456789012345678901234567884 7 2876 2886 123456789012345678901234567882 7 2171 2148 123456789012345678901234567880 7 0 0 |
![]() |
![]() |
![]() |
#16 |
Dec 2011
After milion nines:)
3×7×73 Posts |
![]()
Can you make modification of this tool adding just one number
1 100 2 2 10 Last number means: print only K that have weight 10 or less. |
![]() |
![]() |
![]() |
#17 |
Feb 2003
27×3×5 Posts |
![]() |
![]() |
![]() |
![]() |
#18 |
Dec 2011
After milion nines:)
3·7·73 Posts |
![]()
Multi5 is still way faster then mnash.
So also can you just change behavior of last number 32000000025 KMIN 32001000000 KMAX 30 KSTEP 600 minimum weight for printing Since if we use this tool we look at very small weight of number do that last number print only K less then not above then ( as it now) With that output will be drastically smaller . Thanks |
![]() |
![]() |
![]() |
#19 | |
Feb 2003
36008 Posts |
![]() Quote:
Usage example: Code:
MNash.exe -1 -100 2 2 800 Code:
-11 2 795 791 -29 2 495 485 -37 2 630 629 -43 2 633 640 -59 2 639 642 -71 2 593 604 -73 2 800 818 Code:
MNash.exe -1 -100 2 2 -3000 Code:
-45 2 3747 3767 -69 2 3438 3437 -75 2 3181 3184 |
|
![]() |
![]() |
![]() |
#20 |
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36
3,467 Posts |
![]()
I typed "nash 127"
It prints "127 325 332" Thus the weight of 127*2^n+1 is 325 and the weight of 127*2^n-1 is 332? |
![]() |
![]() |
![]() |
#21 |
Dec 2011
After milion nines:)
3·7·73 Posts |
![]() |
![]() |
![]() |
![]() |
#22 | |
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36
3,467 Posts |
![]() Quote:
Code:
C:\Users\user\Downloads\allnash>mnash -31 31 2 4 -31 4 0 0 -29 4 898 900 -27 4 2802 2812 -25 4 0 0 -23 4 2518 2517 -21 4 1111 1107 -19 4 0 0 -17 4 4485 4514 -15 4 2527 2503 -13 4 0 0 -11 4 1521 1518 -9 4 399 407 -7 4 0 0 -5 4 3958 3978 -3 4 3462 3468 -1 4 0 0 1 4 39 40 3 4 2821 2826 5 4 0 0 7 4 4016 4021 9 4 1539 1543 11 4 0 0 13 4 1756 1754 15 4 3495 3506 17 4 0 0 19 4 1543 1530 21 4 1692 1691 23 4 0 0 25 4 3745 3737 27 4 2865 2877 29 4 0 0 31 4 1462 1468 |
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Comparison of NFS tools | CRGreathouse | Factoring | 3 | 2018-02-05 14:55 |
Benchmark of current tools | Romuald | Factoring | 1 | 2016-11-13 10:59 |
GPU Computing Cheat Sheet (a.k.a. GPU Computing Guide) | Brain | GPU Computing | 20 | 2015-10-25 18:39 |
Murphy's Law and other tools | Uncwilly | Lounge | 5 | 2014-07-07 22:36 |
The difference between P2P and distributed computing and grid computing | GP2 | Lounge | 2 | 2003-12-03 14:13 |