20160409, 21:02  #1 
"Rashid Naimi"
Oct 2015
Remote to Here/There
2,243 Posts 
IntegerExponent Equivalent in PariGP
Hi,
I can't find an equivalent to IntegerExponent function in PariGP. Is there one?, or should One write his own routine? Thanks in advance https://reference.wolfram.com/langua...rExponent.html http://math.mit.edu/~brubaker/PARI/PARIrefcard.pdf 
20160409, 21:09  #2  
Sep 2002
Database er0rr
10062_{8} Posts 
?logint
Quote:
Code:
? logint(139,2) 7 Last fiddled with by paulunderwood on 20160409 at 21:16 

20160409, 21:19  #3 
"Rashid Naimi"
Oct 2015
Remote to Here/There
2,243 Posts 
Thank you paulunderwood,
That was fast. For the record that function is missing from the reference card that I linked. That saves me quite a bit of time. Thank you again. 
20160409, 21:20  #4  
"Forget I exist"
Jul 2009
Dumbassville
2^{6}·131 Posts 
Quote:
Quote:
Last fiddled with by science_man_88 on 20160409 at 21:30 

20160409, 21:32  #5  
"Rashid Naimi"
Oct 2015
Remote to Here/There
2243_{10} Posts 
Quote:
That wouldhavebeen/is as good in saving me time. Last fiddled with by a1call on 20160409 at 21:32 

20160409, 21:35  #6 
"Forget I exist"
Jul 2009
Dumbassville
2^{6}·131 Posts 
of course if it's used for factoring factor() can do it for all primes you might be able to save yourself time with that also then of course there's factorint() (though that one doesn't have an upper limit to my knowledge and only factors using integers. if you want a list of divisors that are powers there's divsors() and ispower() ( or even fordiv in some versions) if you want to check if something is square free there's an issquare free function etc. edit: and of course if something is squarefree it is also powerfree since all powers greater than squares that could divide it are not squarefree.
Last fiddled with by science_man_88 on 20160409 at 21:39 
20160409, 21:38  #7 
Sep 2002
Database er0rr
2×3×691 Posts 

20160409, 21:40  #8  
"Rashid Naimi"
Oct 2015
Remote to Here/There
8C3_{16} Posts 
Quote:
My current use is not for factoring. Just need to formulate the highest integer power to run my WDP code on Parigp. The only thing I need to figure out now is how to use variables. 

20160409, 21:48  #9 
"Forget I exist"
Jul 2009
Dumbassville
2^{6}·131 Posts 
probably would depend on scope and if they are predefined values at first. not to mention if you want to do things in parallel global variables would be NOT a great choice. I'm not even sure what WDP is. one thing that comes to mind is in theory primes are the simplest case if they can't divide by prime power's they don't divide by any power other than 1^n which is always 1.

20160409, 21:49  #10 
"Rashid Naimi"
Oct 2015
Remote to Here/There
2,243 Posts 
Well variables seem straight forward.
Is there a way to save/load scripts/routines/programs? Thank you. ETA: WDP = Wolfram Development Platform: https://develop.wolframcloud.com/app/ Last fiddled with by a1call on 20160409 at 21:51 
20160409, 21:55  #11  
"Forget I exist"
Jul 2009
Dumbassville
2^{6}×131 Posts 
Quote:


Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
An equivalent problem for factorization of large numbers  HellGauss  Math  5  20120412 14:01 
PIV Effective Equivalent curiosities...  petrw1  Software  0  20091205 04:41 
Dual Core P95 64Bit P4 Equivalent problem  g0ods  Software  9  20090915 14:12 
Is there a finitefield equivalent to the DWT?  fivemack  Math  4  20080327 17:58 
Equivalent code  dsouza123  Programming  25  20051008 05:10 