mersenneforum.org  

Go Back   mersenneforum.org > Math Stuff > Computer Science & Computational Number Theory > PARI/GP

Reply
 
Thread Tools
Old 2010-11-22, 22:56   #1640
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

3×1,993 Posts
Default

Quote:
Originally Posted by science_man_88 View Post
I have a windows system I'm not for pay but I suck lol.
Well, the way to get better (of which the first stage is starting to not suck) is to program, and a great way to do that is to work on an open-source program like Pari. This particular task is probably too hard for you, but one may come along that is appropriate.

The best part of working on these systems is that it's a great way to advertise your skills to potential employers. You can say that you worked on the project and then show your actual contributions.
CRGreathouse is offline   Reply With Quote
Old 2010-11-22, 23:12   #1641
3.14159
 
3.14159's Avatar
 
May 2010
Prime hunting commission.

24·3·5·7 Posts
Default

Quote:
Originally Posted by CRGreathouse View Post
I just discussed that in my last post. There are already new SVN binaries on the site that you can download. But there isn't a new installer, and won't be in the near future, due to difficulties with Vista, Win7, and cygwin/mingw/perl on those systems.

Finding skilled Windows programmers willing to work for free isn't that easy.
Yeah, but those binaries are tarballs. Unusable.
3.14159 is offline   Reply With Quote
Old 2010-11-22, 23:12   #1642
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

175B16 Posts
Default

Quote:
Originally Posted by 3.14159 View Post
Yeah, but those binaries are tarballs. Unusable.
You're downloading the wrong thing.
CRGreathouse is offline   Reply With Quote
Old 2010-11-22, 23:21   #1643
3.14159
 
3.14159's Avatar
 
May 2010
Prime hunting commission.

24×3×5×7 Posts
Default

Quote:
Originally Posted by Charles View Post
You're downloading the wrong thing.
Well, please link to the "correct" items.
3.14159 is offline   Reply With Quote
Old 2010-11-22, 23:38   #1644
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

3×1,993 Posts
Default

Quote:
Originally Posted by 3.14159 View Post
Well, please link to the "correct" items.
Really? It's right on the download page!

Click image for larger version

Name:	Screenshot.png
Views:	85
Size:	20.6 KB
ID:	5917
CRGreathouse is offline   Reply With Quote
Old 2010-11-22, 23:41   #1645
3.14159
 
3.14159's Avatar
 
May 2010
Prime hunting commission.

110100100002 Posts
Default

Quote:
Originally Posted by CRGreathouse View Post
Really? It's right on the download page!

Attachment 5917
Oh. Didn't see that. Thanks.

Last fiddled with by 3.14159 on 2010-11-22 at 23:47
3.14159 is offline   Reply With Quote
Old 2010-11-23, 00:45   #1646
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

135338 Posts
Default

Quote:
Originally Posted by 3.14159 View Post
Oh. Didn't see that. Thanks.
No problem. You should put the binary in a directory with the .gprc file (probably C:\Program Files\PARI or C:\Program Files (x86)\PARI) or you won't get the colors, default primelimit, etc. from that file.

Unfortunately readline and the high-resolution graphics aren't included in that version AFAIK. I'd like to see that fixed; if I have a chance maybe I'll look into it. But that probably won't happen until next year -- I have a lot of consulting work to do these next few months.
CRGreathouse is offline   Reply With Quote
Old 2010-11-23, 01:34   #1647
3.14159
 
3.14159's Avatar
 
May 2010
Prime hunting commission.

24·3·5·7 Posts
Default

I'm not sure if I even got to explore all of PARI's features as of yet. I know a bit of programming, some number theoretic functions, and how to somewhat randomly generate semiprime or prime numbers.

a(n) = My prime-generating function.

Last fiddled with by 3.14159 on 2010-11-23 at 01:35
3.14159 is offline   Reply With Quote
Old 2010-11-23, 19:11   #1648
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

26×131 Posts
Default

Code:
lucaslehmer(p)= s=4;for(x=1,p-2,s=(s^2-2)%(2^p-1));if(s==0,return(1),return(0))
my best code so far not that it matters.
science_man_88 is offline   Reply With Quote
Old 2010-11-23, 19:47   #1649
axn
 
axn's Avatar
 
Jun 2003

5,087 Posts
Default

Quote:
Originally Posted by science_man_88 View Post
Code:
lucaslehmer(p)= s=4;for(x=1,p-2,s=(s^2-2)%(2^p-1));if(s==0,return(1),return(0))
my best code so far not that it matters.
Code:
lucaslehmer(p)= s=Mod(4, 2^p-1);for(x=1,p-2,s=s^2-2);if(s==0,1,0);
Some small changes.
axn is offline   Reply With Quote
Old 2010-11-23, 19:52   #1650
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

26×131 Posts
Default

Quote:
Originally Posted by axn View Post
Code:
lucaslehmer(p)= s=Mod(4, 2^p-1);for(x=1,p-2,s=s^2-2);if(s==0,1,0);
Some small changes.
thanks axn you're pretty nice. I have a second implementation to catch all p that have sumdigits(last result)==9 now, as well as one for all #'s that have sumdigits(last result)==9.Neither sequence is in the OEIS but I haven't found much of a pattern yet either so they may not be of interest. I may check back soon if i can find a pattern.
science_man_88 is offline   Reply With Quote
Reply



Similar Threads
Thread Thread Starter Forum Replies Last Post
Why do I sometimes see all the <> formatting commands when I quote or edit? cheesehead Forum Feedback 3 2013-05-25 12:56
Passing commands to PARI on Windows James Heinrich Software 2 2012-05-13 19:19
Ubiquity commands Mini-Geek Aliquot Sequences 1 2009-09-22 19:33
64-bit Pari? CRGreathouse Software 2 2009-03-13 04:22
Are these commands correct? jasong Linux 2 2007-10-18 23:40

All times are UTC. The time now is 23:06.


Fri Aug 6 23:06:57 UTC 2021 up 14 days, 17:35, 1 user, load averages: 4.21, 3.93, 3.92

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.