Return to Answer

Commonmark migration

edited Jun 17, 2020 at 9:04

Pari/GP, 84 bytes

f(p)=[if(q'',[f(q),r],p)|r<-x*divisors(p\x),r''&&p==subst(q=substpol(p,r,x),x,r)][1]

Based on the algorithm described here.

f(p)=[if(q'',[f(q),r],p)|r<-x*divisors(p\x),r''&&p==subst(q=substpol(p,r,x),x,r)][1]

Based on the algorithm described here.

f(p)=[if(q'',[f(q),r],p)|r<-x*divisors(p\x),r''&&p==subst(q=substpol(p,r,x),x,r)][1]

Based on the algorithm described here.

added 34 characters in body

edited Mar 12, 2018 at 6:31

edited Mar 12, 2018 at 6:31

f(p)=if=[if(a=[[fq'',[f(q),r]|r<-divisors(r],p)|r<-p%xx*divisors(p\x),r''&&p==subst(q=substpol(p,r,x),x,r)&&q''],a[1],p)][1]

Based on the algorithm described here here.

f(p)=if(a=[[f(q),r]|r<-divisors(p-p%x),r''&&p==subst(q=substpol(p,r,x),x,r)&&q''],a[1],p)

Based on the algorithm described here.

f(p)=[if(q'',[f(q),r],p)|r<-x*divisors(p\x),r''&&p==subst(q=substpol(p,r,x),x,r)][1]

Based on the algorithm described here.

answered Mar 12, 2018 at 5:41

answered Mar 12, 2018 at 5:41

f(p)=if(a=[[f(q),r]|r<-divisors(p-p%x),r''&&p==subst(q=substpol(p,r,x),x,r)&&q''],a[1],p)

Based on the algorithm described here.