Problem 088

A place to air possible concerns or difficulties in understanding ProjectEuler problems. This forum is not meant to publish solutions. This forum is NOT meant to discuss solution methods or giving hints how a problem can be solved.
Forum rules
As your posts will be visible to the general public you are requested to be thoughtful in not posting anything that might explicitly give away how to solve a particular problem.

This forum is NOT meant to discuss solution methods for a problem.

In particular don't post any code fragments or results.

Don't start begging others to give partial answers to problems

Don't ask for hints how to solve a problem

Don't start a new topic for a problem if there already exists one


See also the topics:
Don't post any spoilers
Comments, questions and clarifications about PE problems.
satyres
Posts: 31
Joined: Thu Feb 20, 2014 2:48 pm

Re: Problem 088

Post by satyres »

Why this is wrong?
k=2: 2 = 2 × 1 = 1 + 1
Thanks !
User avatar
jaap
Posts: 588
Joined: Tue Mar 25, 2008 3:57 pm
Contact:

Re: Problem 088

Post by jaap »

satyres wrote:Why this is wrong?
k=2: 2 = 2 × 1 = 1 + 1
Thanks !
You need the same numbers in the product as in the sum. So 1x1 and 1+1, or 2x1 and 2+1, but neither of these are correct.
User avatar
nicolas.patrois
Posts: 118
Joined: Fri Jul 26, 2013 4:54 pm
Contact:

Re: Problem 088

Post by nicolas.patrois »

The lists must be the same and 2+1≠1×1. You must have x+y=x×y.
Image
satyres
Posts: 31
Joined: Thu Feb 20, 2014 2:48 pm

Re: Problem 088

Post by satyres »

Thanks both for the clarification ! really apreciate it !
tomboy
Posts: 5
Joined: Sun Sep 01, 2013 9:24 am

Problem 088

Post by tomboy »

Hello.

I'm positive I've understood the problem and got a good algorithm in my head. Still, it spits out a wrong result for the second example in the problem: Instead of {4, 6, 8, 12, 15, 16} I get {4, 6, 8, 12, 15, 16, 20} for the minimal product-sums 2<=k<=12.

In particular, it's the minimal product-sum for 10 I'm stuck on. My algorithm (verified by hand) says its minimum prod-sum is 20. What is the real answer? I just can't find something smaller.

<Post moved by moderator. Please don't create a new topic if one already exists.>
Image
User avatar
nicolas.patrois
Posts: 118
Joined: Fri Jul 26, 2013 4:54 pm
Contact:

Re: Problem 088

Post by nicolas.patrois »

I find 16.
Image
tomboy
Posts: 5
Joined: Sun Sep 01, 2013 9:24 am

Re: Problem 088

Post by tomboy »

As usual, i got my counting wrong.
Thanks
Image
syckls
Posts: 2
Joined: Tue Jul 24, 2018 3:37 am

Re: Problem 088

Post by syckls »

The problem statement says, "A natural number, N, that can be written as the sum and product of a given set of at least two natural numbers, {a1, a2, ... , ak} is called a product-sum number." However, several of the examples given have repeated numbers. I think the problem statement should say, "A natural number, N, that can be written as the sum and product of a given sequence a1, a2, ... , ak of at least two natural numbers, is called a product-sum number."
User avatar
hk
Administrator
Posts: 12832
Joined: Sun Mar 26, 2006 10:34 am
Location: Haren, Netherlands

Re: Problem 088

Post by hk »

The mathematical name of the structure you mean is Multiset
Image
War ruins the life and health of untold numbers of innocent children.
syckls
Posts: 2
Joined: Tue Jul 24, 2018 3:37 am

Re: Problem 088

Post by syckls »

"Multiset" would also work, yes.
Post Reply