2
$\begingroup$

By a sudoku prime triple I mean a tripe $(p,q,r)$ of three-digit (base ten) primes which together use each of the nonzero digits $1$ to $9$ once each. I'm wondering how many such triples there are.

Using digit sums mod $3$ one can show the primes in any such triple are equal mod $3.$ I found two triples: first $(241,853,967)$ all $1$ mod $3,$ next $(281,467,953)$ all $2$ mod $3.$ I feel there must be many more but don't have programming skill enough to look. Thanks for any program results or other information.

$\endgroup$
3
  • $\begingroup$ This code produces 816 as an answer. $\endgroup$ Commented Oct 22, 2019 at 19:41
  • 3
    $\begingroup$ There are 136 distinct triplets, which I've pasted here $\endgroup$ Commented Oct 22, 2019 at 19:49
  • $\begingroup$ Thanks, @DonThousand -- I'd upvote if it was made an answer. $\endgroup$ Commented Oct 22, 2019 at 20:02

1 Answer 1

Reset to default
3
$\begingroup$

The following answer is purely computational. This code produces 816 results (removing reorder duplicates gives us 136). The triplets are in the following pastebin.

$\endgroup$

You must log in to answer this question.

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.