- #1

- 97

- 1

in how many ways we can represent 50! as the sum of two primes?

You are using an out of date browser. It may not display this or other websites correctly.

You should upgrade or use an alternative browser.

You should upgrade or use an alternative browser.

- Thread starter hadi amiri 4
- Start date

- #1

- 97

- 1

in how many ways we can represent 50! as the sum of two primes?

- #2

- 32

- 0

Are you looking for a number, an approximation, a formula, or an algorithm?

A062311, in the Encyclopedia of Integer Sequences, lists the first 13 "number of ways writing n! as a sum of two primes", that is it goes as far as 13!, it does not have a formula for a "reasonable" calculation by hand, and the last 5 terms were added as recently as 2008! (my last ! is an exclamation mark)

A062311, in the Encyclopedia of Integer Sequences, lists the first 13 "number of ways writing n! as a sum of two primes", that is it goes as far as 13!, it does not have a formula for a "reasonable" calculation by hand, and the last 5 terms were added as recently as 2008! (my last ! is an exclamation mark)

Last edited:

Share: