Problem 032
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.
See also the topics:
Don't post any spoilers
Comments, questions and clarifications about PE problems.
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
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.
-
friol
- Posts: 4
- Joined: Mon Apr 14, 2008 8:06 pm
Problem 032
Hello.
I think I've found the solution to problem 32, but projecteuler.net rejects it.
Problem 32 asks:
"Find the sum of all products whose multiplicand/multiplier/product identity can be written as a 1 through 9 pandigital. "
I think these are the products:
[edit]Removed correct solution set[/edit]
and the sum of the products is _____, but it does not seem to be the answer.
What I'm doing wrong?
Thanks
I think I've found the solution to problem 32, but projecteuler.net rejects it.
Problem 32 asks:
"Find the sum of all products whose multiplicand/multiplier/product identity can be written as a 1 through 9 pandigital. "
I think these are the products:
[edit]Removed correct solution set[/edit]
and the sum of the products is _____, but it does not seem to be the answer.
What I'm doing wrong?
Thanks
- euler
- Administrator
- Posts: 5004
- Joined: Sun Mar 05, 2006 4:49 pm
- Location: Cheshire, England
- Contact:
Re: Problem 32
I've edited your post to remove the list, as it is correct. Remember, the word product means the answer you get from multiplying. You might find the hint in the problem statement helpful. 

impudens simia et macrologus profundus fabulae
- euler
- Administrator
- Posts: 5004
- Joined: Sun Mar 05, 2006 4:49 pm
- Location: Cheshire, England
- Contact:
-
vzhilyaev
- Posts: 1
- Joined: Fri Oct 17, 2008 2:50 pm
Re: Problem 32
Am I getting it right that multiplicand/multiplier/product should have in total exactly nine digits?
- daniel.is.fischer
- Posts: 2400
- Joined: Sun Sep 02, 2007 11:15 pm
- Location: Bremen, Germany
Re: Problem 32
Yes.
Il faut respecter la montagne -- c'est pourquoi les gypaètes sont là.
- marco6
- Posts: 3
- Joined: Sat Nov 08, 2008 5:32 pm
- Georg
- Posts: 157
- Joined: Mon Jan 21, 2008 7:00 am
- Location: Mannheim, Germany
- Contact:
Re: Problem 32
Problem 41 (View Problem): We shall say that an n-digit number is pandigital if it makes use of all the digits 1 to n exactly once.
- euler
- Administrator
- Posts: 5004
- Joined: Sun Mar 05, 2006 4:49 pm
- Location: Cheshire, England
- Contact:
Re: Problem 32
Good question, marco6. I hadn't realised that a definition was missing from that question. I've added the same definition from problem 41 (thanks, Georg) as an introduction to the problem.
Problem 32 (View Problem)
Problem 32 (View Problem)

impudens simia et macrologus profundus fabulae
- Sunhill
- Posts: 9
- Joined: Tue Apr 29, 2008 10:36 am
- Location: Sydney, Australia
- Contact:
- daniel.is.fischer
- Posts: 2400
- Joined: Sun Sep 02, 2007 11:15 pm
- Location: Bremen, Germany
Re: Problem 032
Thanks - fixed.
Il faut respecter la montagne -- c'est pourquoi les gypaètes sont là.
-
masteusz
- Posts: 2
- Joined: Fri Jan 21, 2011 12:37 pm
Re: Problem 032
Hello,
I think that I have found correct solution but ProjectEuler rejects it so I have a question:
For example is 39 x 186 = 7254 and 186 x 39 = 7254 counted as one or two different pandigital identities?
I think that I have found correct solution but ProjectEuler rejects it so I have a question:
For example is 39 x 186 = 7254 and 186 x 39 = 7254 counted as one or two different pandigital identities?

- jaap
- Posts: 588
- Joined: Tue Mar 25, 2008 3:57 pm
- Contact:
Re: Problem 032
One. The problem clearly states:
Note that this is even stricter than just swapping the two factors.HINT: Some products can be obtained in more than one way so be sure to only include it once in your sum.
-
masteusz
- Posts: 2
- Joined: Fri Jan 21, 2011 12:37 pm
-
jhughes
- Posts: 1
- Joined: Sun Feb 07, 2010 4:37 am
Re: Problem 032
Could someone explain to me what this problem is referring to by "identity"? I know it's meaning in other contexts, not this one.
Thanks in advance!
Thanks in advance!
- rayfil
- Administrator
- Posts: 1412
- Joined: Sun Mar 26, 2006 5:30 am
- Location: Quebec, Canada
- Contact:
Re: Problem 032
When you have an equal sign (=), it means that both sides must be considered identical. Thus, 39 × 186 can be considered an identity of 7254. Similarly 78 x 93, 31 x 234 and 13 x 18 x 31 would also be considered identities of 7254 among many others.
When you assume something, you risk being wrong half the time.
-
Spura
- Posts: 8
- Joined: Mon May 16, 2011 4:49 pm
- hk
- Administrator
- Posts: 12818
- Joined: Sun Mar 26, 2006 10:34 am
- Location: Haren, Netherlands
Re: Problem 032
NoSpura wrote:Do we have to consider solutions with multiple multiplicands?
X * Y * Z = U
?

War ruins the life and health of untold numbers of innocent children.
- Molx
- Posts: 3
- Joined: Tue Jun 07, 2011 6:44 pm
- Location: Brazil
- Contact:
Re: Problem 032
No, only Multiplicand * Multiplier = ProductSpura wrote:Do we have to consider solutions with multiple multiplicands?
X * Y * Z = U
?
Problem 32 (View Problem)

