IIRC J extended precision number implementation uses decimal base 1000 or 100000 , so that ": format is fast but calculation is slower. Things could be the opposite if J had used 2^n base. ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
- [Jprogramming] Finding prime palindromes Kip Murray
- Re: [Jprogramming] Finding prime pali... Raul Miller
- Re: [Jprogramming] Finding prime pali... 'Pascal Jasmin' via Programming
- Re: [Jprogramming] Finding prime pali... Mike Day
- Re: [Jprogramming] Finding prime ... Raul Miller
- Re: [Jprogramming] Finding pr... bill lam
- Re: [Jprogramming] Findin... Linda A Alvord
- Re: [Jprogramming] F... Linda A Alvord
- Re: [Jprogrammin... Raul Miller
- Re: [Jprogra... Linda A Alvord
- [Jprogramming] Finding prime palindro... Kip Murray
- Re: [Jprogramming] Finding prime ... 'Pascal Jasmin' via Programming
