Re: A prime number problem



Risto Kauppila <risto.kauppila0@xxxxxxxxxxxxxxxxxxxxxxxxxxxx> writes:
Let A = {2,3,13,23,37}
If (a_1,a_2,a_3,a_4,a_5)
is any permutation of A,
sums
a_1 + a_2*a_3*a_4*a_5
...
a_1*a_2*a_3*a_4 + a_5
are all primes.
Can you find a set of six
or more primes satisfying
the same property.

A trickier one is to find sets s.t. for any subset, the product
of the subset plus the product of its complement is prime.

Phil
--
Unix is simple. It just takes a genius to understand its simplicity
-- Dennis Ritchie (1941-2011), Unix Co-Creator
.



Relevant Pages

  • Re: A prime number problem
    ... or more primes satisfying ... permutations to describe the problem. ...
    (sci.math)
  • Re: FLT
    ... >for I am the ever-lasting Lord of all math, ... An infinite number of even primes with are sums of Musatov integrals ...
    (sci.math)
  • Re: Vindication of Goldbachs conjecture
    ... To prove Goldbach's Conjecture, you have to show, for the ... It was easy to show that the even number 26 is the sum of two primes: ... Let's call those sums Goldbach's sums. ... Thus, it vindicates Goldbach's conjecture. ...
    (sci.math)
  • Re: BigNum -- Floating Point
    ... prints them out the same way -- not as decimal numerals. ... It's a product of primes. ... Sums of primes are not only messy ... > was a distinct symbol). ...
    (comp.programming)
  • Re: Vindication of Goldbachs conjecture
    ... the sum of two primes. ... Goldbach's conjecture says that Acontains all the even numbers up to ... Let's call those sums Goldbach's sums. ...
    (sci.math)