Project Euler Forum

i think that i miss something

the problem statement saying that :
"The sum of the primes q <100 such that P(q)=1 equals 233."
however my calculations saying that the sum is 630 : i am wondering how a sum of 233 could be made ?

You have some false positives, for example:
31 = 27 + 4 = 9 + 6 + 16
41 = 9 + 32 = 27 + 6 + 8
and some missing ones, for example:
23 = 9 + 6 + 8

It looks like you are only using powers of 2 and powers of 3, and missing out terms like 6 which are neither.

I'm having problems with this one as well. In particular, my program is getting the sum of the primes q <100 such that P(q)=1 equals 490. Below are the primes less than 100 with unique partitions as far as I understand. Anybody see what my problem is?

gsidebottom wrote:71=32+27+12
89=81+8
97=81+16

71 = 27 + 36 + 8
89 = 27 + 18 + 12 + 32
97 = 27 + 6 + 64

Hi,
for q < 10000, is 1404597 correct ?

<deleted post>

Confirmed.

<deleted post>

Resuming the problems after a long break.

My terms for q <100 are
[2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 27, 32, 36, 48, 54, 64, 72, 81, 96]

my result for P(q)=1 for q<100 is 228 (instead of 233)

Has anybody any clue where I'm going wrong?

My primes with P(q) = 1 are

5
7
13
17
23
43
59
61

Jochen_P wrote: Wed Mar 28, 2018 7:24 pm my result for P(q)=1 for q<100 is 228 (instead of 233)

Perhaps you are missing two small primes that sum to 5?

Aye, thanx a lot!

I kind of left them out by purpose.. thought once again incorrectly that a partition must consist of n>1 elements. m(
Now to make this bugger efficient. Runs way too long to get P(q)=1 for q<10**6

... way too long to get even sum P(q)=1 for q<10**3.
4600 in a bit more than an hour m(

Can't think of any other good way to optimize that anymore, there are way too many partitions to check.
There has to be a simple rule/formula for excluding terms in this, but damn, do I suck at maths

Is it possible that "Confimed." above refers to something in the deleted post? First I believed it refers to the preceding question for q < 10000 and started to debug my algorithm. But I get 24853 for q < 10000 (and my answer for 10^6 got accepted ).