Maybe some expert can help me with this.

I am trying to improve oeis.org/A156104. It is pairs of prime numbers p and p+36.
According to the k-tuple conjecture, this should be potentially an infinite list. I want to make the database .b file larger - from 1,000 to 10,000.

The virtual clipboard was too large to copy to notepad.  I could not figure out how to write this to a file.  I tried fopen() and fclose().

See my efforts

pairs_p_and_p+36_2.mw

pairs_p_and_p+36_2.pdf

Let me know.

Matt

Hi all again,

Tried this.

some_proper_divisor_examples_8.pdf

some_proper_divisor_examples_8.mw

Anyone know a theorem related to this?

My guess is (p1 -1) * (p2 -1) * ... * (pb -1)  .

For p1, p2, ... pb all prime numbers.

Regards,

Matt

Hi all,

Wrote some Maple code, and want to share.

I put less than eight hours into this exploration.

I have been running a computer to find Fermat factors for over ten years now.  Want support.

This is an exploration in some mostly composite whole numbers.

see 2_to_the_exponent_p_3.pdf

also see 

Maple Worksheet - Error

Failed to load the worksheet /maplenet/convert/2_to_the_exponent_p_3.mw .
 

Download 2_to_the_exponent_p_3.mw

Have a look.

Regards

Matt

Hi all,

Do some of you know the form of all primes greater than five?

Is it 6*p +/- 1?

maple_about_primes.pdf

Maple Worksheet - Error

et/convert/                                  Maple_prime_expository_number_one_for_sharing.mw .
 

Download Maple_prime_expository_number_one_for_sharing.mwmaple_about_primes.pdf

Regards,

Matt