Hi Maple People,

I got stuck trying to write a procedue for my project today.  My topic is Prime Constellations.

If you want to help me, please read my primer on constellations

https://docs.google.com/viewer?a=v&pid=sites&srcid=ZGVmYXVsdGRvbWFpbnxwcmltZWNvbnN0ZWxsYXRpb25zfGd4OjNmOWZlNWQxZDY2ODY4YmQ

The procedure should refine an offset Vector and increase a multiplier scalar.

I want to delay putting the broken procedure until I can simplify it and try again.

Thanks,

Matt Anderson

Hi,

I have enjoyed Maple computer algebra system as a platform for some work on prime constellations.  A summary of my work is here -

https://sites.google.com/site/primeconstellations/

At the bottom of the page are 3 relevant files and the filenames start with "A constellation"  Two of those files are .mw files.  The code searches the integers for solutions, and it works fine, but after about half a day, it consistantly crashes.  I...

Hi Mapleprimes,

The nextprime(n) function will give the next prime, given n.

Suppose I want the 8th next prime so how can I find the 8 th next prime quickly?

I guess I could find the ones in between, but maybee there is a better way.

n  nextprime(n,8)

2          23

3          29

5          31

HI,

I want to make a program that will list the twin primes.  Is it possible to implement the isprime function in C?  I want to be able to run this program on a computer that doesn't have Maple installed.  Here is my code -

twinprimes := proc (maxnum)
local a;
description "output the twin primes less than maxnum";
printf("%12d", 3);
for a from 6 by 6 to maxnum do
if `and`(isprime(a-1) = true, isprime(a+1) = true)
then printf("%12d", a-1) end if

I want to factor the 34 th Fermat number.

F(n) := 2^(2^n) + 1

I can enter the 29th Fermat number: 2^(2^29) +1, and Maple will evaluate it.

I seem to be under the maxdigits limit: