PARI's commands - Page 65

CRGreathouse · 2010-08-19, 20:00

Quote:

Originally Posted by science_man_88

now if I only I could be smart like you so I could build you that helpful program lol.

I'm not smart enough to write that program, but maybe you are. You have a long way to go, though!

Here are some possibly-relevant papers in case you decide to think more about this:
mArachna – Ontology Engineering for Mathematical Natural Language Texts
MathWebSearch 0.4: A Semantic Search Engine for Mathematics
etc.

CRGreathouse · 2010-08-19, 20:01

Quote:

Originally Posted by 3.14159

?a = a(n) = nextprime(10^n))

I'm sure it didn't say that -- it's not in the form of a valid closure. But if it said

Code:

a(n) = nextprime(10^n)

then it would never return 2 for n >= 1 -- it's a constant, no randomness.

3.14159 · 2010-08-19, 20:02

Now: Can we get back to the substitutions required to make the sieve for the k * n + 1?

CRGreathouse · 2010-08-19, 20:03

Quote:

Originally Posted by 3.14159

Now: Can we get back to the substitutions required to make the sieve for the k * n + 1?

Why don't you just download srsieve and use that? It'll be faster.

3.14159 · 2010-08-19, 20:10

Quote:

Originally Posted by CRGreathouse

Why don't you just download srsieve and use that? It'll be faster.

Because it can only sieve for Proth numbers.

CRGreathouse · 2010-08-19, 20:15

Quote:

Originally Posted by 3.14159

Because it can only sieve for Proth numbers.

It does more than Proth numbers. What, precisely, are you sieving for? Can you specify exactly for me?

3.14159 · 2010-08-19, 20:18

Quote:

Originally Posted by CRGreathouse

It does more than Proth numbers. What, precisely, are you sieving for? Can you specify exactly for me?

k * n! + 1.

CRGreathouse · 2010-08-19, 20:27

Maybe this?
http://fatphil.org/maths/factorial/

Possibly even this?
http://pgllr.mine.nu/software/fsieve/

3.14159 · 2010-08-19, 20:39

Quote:

Originally Posted by CRGreathouse

Maybe this?
http://fatphil.org/maths/factorial/

Possibly even this?
http://pgllr.mine.nu/software/fsieve/

The first is source code, luckily I downloaded some freeware to deal with C source code.

3.14159 · 2010-08-19, 20:46

Quote:

Originally Posted by 3.14159

The first is source code, luckily I downloaded some freeware to deal with C source code.

Nevermind that. I'm going to go to Generalized proths, using factorial and or primorial powers, just need a larger base range. Anything for that?

CRGreathouse · 2010-08-19, 20:58

Quote:

Originally Posted by 3.14159

Nevermind that. I'm going to go to Generalized proths, using factorial and or primorial powers, just need a larger base range. Anything for that?

I can never keep track of all the names (especially since some are contradictory... e.g. several definitions for generalized Fermats). What form are these?

2010-08-19, 20:27	#712
CRGreathouse Aug 2006 3×1,993 Posts	Maybe this? http://fatphil.org/maths/factorial/ Possibly even this? http://pgllr.mine.nu/software/fsieve/ Last fiddled with by CRGreathouse on 2010-08-19 at 20:29

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

2010-08-19, 20:02	#707
3.14159 May 2010 Prime hunting commission. 2⁴·3·5·7 Posts	Now: Can we get back to the substitutions required to make the sieve for the k * n + 1?