![]() |
![]() |
#1 |
"Forget I exist"
Jul 2009
Dartmouth NS
20E216 Posts |
![]() Code:
div(n,x)=if(n<=10^znorder(Mod(10,x)),return(n),return(n%(10^znorder(Mod(10,x)))+div(floor(n/(10^znorder(Mod(10,x)))),x))) |
![]() |
![]() |
![]() |
#2 | |
Sep 2002
Database er0rr
23·3·11·17 Posts |
![]() Quote:
I never know if to use my or local, but your code can be made better by: Code:
div(n,x)=local(tz=10^znorder(Mod(10,x)));if(n<=tz,return(n),return(n%tz+div(floor(n/tz),x))) Last fiddled with by science_man_88 on 2022-07-20 at 21:10 |
|
![]() |
![]() |
![]() |
#3 |
"Forget I exist"
Jul 2009
Dartmouth NS
2·3·23·61 Posts |
![]()
Probably but x is prime in that use case no factorization overlap.
Last fiddled with by science_man_88 on 2022-07-20 at 21:11 |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Help to install and factor large number | craneduitre | Msieve | 23 | 2016-07-10 08:13 |
Error with large number on 32-bit machines | EdH | GMP-ECM | 43 | 2013-03-01 14:27 |
Bug with particular large number | VolMike | YAFU | 18 | 2012-04-09 21:39 |
Sieving a Large Number of k's | Dougal | Conjectures 'R Us | 1 | 2010-06-17 21:48 |
Is this a relatively large number? | MavsFan | Math | 3 | 2003-12-12 02:23 |