Quote:
Originally Posted by science_man_88
I can figure out random PARI/GP stuff partly because it has a lot of overlap core(N)==N issquarefree(N) and bigomega(N)==omega(N) all ask the same question in a conditional statement. issquare(N) is the same as core(N)==1 you can make loops with these to find the powers of two in order, the highly composite numbers using numdiv(N) etc. wonder if the powers in a number giving an HCN of divisors are rare a1call ? they shouldn't be as the HCN's have many exponent combinations that work to multiply to them under the number of divisors function.

So my positive affirmation from that:
I can take advantage of certain number tests in different problems that I've noticed; I leverage this understand into solutions and inquiries in PARI/GP.