PARI's commands

[science_man_88]

Still baffled by the error in your first code Pi ? If so I can tell you it's simple, in fact I over thought it.

[science_man_88]

Originally Posted by Pi

cs(a,x,m)=for(n=a,x,print(m*fp(n)+1));if(isprime(m*fp(n)+1),break)

Originally Posted by science_man_88

cs(a,x,m)=for(n=a,x,print(m*fp(n)+1);if(isprime(m*fp(n)+1),break(1)))

figure it out...

[3.14159]

Originally Posted by science_man_88

figure it out...

I already did; I was merely inattentive. Don't flatter yourself.

[science_man_88]

Originally Posted by 3.14159

I already did; I was merely inattentive. Don't flatter yourself.

Sorry I just see no reason for me to correct you if I don't,as you have more ability than me.

[3.14159]

Originally Posted by science_man_88

Sorry I just see no reason for me to correct you if I don't,as you have more ability than me.

I have an idea, in order to search for those k's with no primes. I'll do an amateur sieve, but it keeps primes out instead.

[CRGreathouse]

Back to the original topic for a moment:

I've been doing some work over at Rosetta Code, adding examples of simple tasks in Pari/GP. Here's the link:
http://rosettacode.org/wiki/Category:PARI/GP

You may find this useful if you're trying to do something simple in Pari that seems like it should be easy, but you just don't know the commands or can't think of a good way to do it. I found it very instructive to write these examples; you may be able to either learn from it or teach me (feel free to post here, PM me, or simply change one of the RC entries).

I have 132 tasks solved at the moment,* ranging from simple ones like language basics (loops, arithmetic) and primality by trial division to complicated ones like root finding.

* Actually, I imagine that a few of those were written by others, but I certainly wrote the bulk. You can look at the edit history if you're interested in authorship (but why would you be?).

[science_man_88]

Originally Posted by CRGreathouse

Back to the original topic for a moment:

I've been doing some work over at Rosetta Code, adding examples of simple tasks in Pari/GP. Here's the link:
http://rosettacode.org/wiki/Category:PARI/GP

You may find this useful if you're trying to do something simple in Pari that seems like it should be easy, but you just don't know the commands or can't think of a good way to do it. I found it very instructive to write these examples; you may be able to either learn from it or teach me (feel free to post here, PM me, or simply change one of the RC entries).

I have 132 tasks solved at the moment,* ranging from simple ones like language basics (loops, arithmetic) and primality by trial division to complicated ones like root finding.

* Actually, I imagine that a few of those were written by others, but I certainly wrote the bulk. You can look at the edit history if you're interested in authorship (but why would you be?).

thanks maybe I can use my book on system commands of ms-dos
that I own to help system() is a function just can't remember the coding for some of the things on here and some of these are talked of in number freak maybe that can help lol.

[science_man_88]

Also stack is on that list. I've actually wanted to for a long time try to make pari resemble asm lol.

[science_man_88]

Stack needs:

vector to act as placeholders;

concat() that acts like push and throws errors if something like concat(data,c) in the mix;

pop instruction to take the last in as the first out. In other words a variable like the stack pointer in asm to point at the data to be popped off.

[science_man_88]

okay a little trouble:

 stack= [0]

push(n)=concat(stack,n)

pop(n)=stack[#stack]=n;

push only does it's job with concat() the first time I use it.

pop I coded wrong and even correctly coded it doesn't work.

[science_man_88]

Found around the push error.

Now if only I can get pop to work.