![]() |
![]() |
#1 |
Mar 2018
17×31 Posts |
![]()
I would suggest that factordb can reverse digits.
|
![]() |
![]() |
![]() |
#2 |
"Curtis"
Feb 2005
Riverside, CA
110238 Posts |
![]()
What for?
|
![]() |
![]() |
![]() |
#3 |
"Ed Hall"
Dec 2009
Adirondack Mtns
67328 Posts |
![]() |
![]() |
![]() |
![]() |
#4 |
Undefined
"The unspeakable one"
Jun 2006
My evil lair
135718 Posts |
![]()
I suppose for little endian representation of numbers. The x86 CPU is little endian. Maybe English should be also?
E.g. the ninth Mersenne prime is 2^16-1 Last fiddled with by retina on 2018-05-05 at 11:15 |
![]() |
![]() |
![]() |
#5 |
"Daniel Jackson"
May 2011
14285714285714285714
27D16 Posts |
![]()
I'm guessing the OP wants to do a reverse-and-add sequence. Maybe that should be added under sequences.
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
The reverse Sierpinski/Riesel problem | sweety439 | sweety439 | 20 | 2020-07-03 17:22 |
Reverse process sum of odd numbers from x to y. What is the fastest method? | Alberico Lepore | Alberico Lepore | 12 | 2017-09-05 14:57 |
Reverse memory lookup | ewmayer | Programming | 6 | 2012-11-12 00:25 |
Reverse home primes | themaster | Factoring | 12 | 2008-09-27 14:44 |
Reverse Decomp Program | nfortino | LMH > 100M | 2 | 2004-01-30 22:38 |