10
$\begingroup$

We are 5 different positive integer numbers smaller than 100.

The product of us is an odd number.
The product of us is a cube number.
The sum of us is a cube number.

Determine what numbers we are.

$\endgroup$
  • $\begingroup$ This easily admits infinitely many solutions. Or are the five numbers supposed to be integer? $\endgroup$ – Lynn Oct 7 '16 at 10:41
  • 2
    $\begingroup$ @Lynn : Yes integer. $\endgroup$ – Jamal Senjaya Oct 7 '16 at 10:45
  • 1
    $\begingroup$ I hope this doesn't requires brute force and or the use of a program and that it can be solved by logic like I tried in my attempt at an answer. $\endgroup$ – stack reader Oct 7 '16 at 11:07
7
$\begingroup$

I shall assume (though the question doesn't currently say explicitly) that the numbers involved are supposed to be integers.

The "sum is a cube" condition seems really difficult to do anything with in terms of actual reasoning, so I suspect the only practical options are computer search and good luck. I opted for computer search and found

two solutions, both with sum 125: (5,7,15,35,63) and (1,3,15,25,81). In both cases it's easy to see that the product is a cube.

$\endgroup$
  • $\begingroup$ On reflection, I suspect this does happen to be solvable by hand without outrageous good luck (apart from the good luck that there turn out to be nice solutions). E.g., you could look for a solution using no primes other than {3,5} or none other than {3,5,7} and in either case you have rather few options to play with. But discovering by hand the absence of other solutions would be very difficult. $\endgroup$ – Gareth McCaughan Oct 7 '16 at 11:20
  • $\begingroup$ I do not think you need extremely good luck. The "product is odd" mean no even numbers and "product is cube" mean some distribution of prime factors (but not 2) so each prime factor is present three times (and the product for each is still less than 100). Without checking this should be a pretty small number of sets, but you still need to validate the third condition by hand. $\endgroup$ – Thorbjørn Ravn Andersen Oct 7 '16 at 12:08
5
$\begingroup$

Here is one solution (after several subsequent... edits):

a=1, b=2, c=1/2, d=(9-\sqrt{65})/4, and e=(9+\sqrt{65})/4.

Indeed, as

their product is 1, their sum is 8, and they are indeed positive and below 100.

Man, three mistakes in such a short post.


Well, OP changed the wording several times... An integer solution seems to be: {1, 3, 15, 25, 81}, summing up to 125.

$\endgroup$
3
$\begingroup$

Here is what I got so far

The product of us is an odd number.

this implies that every numbers are odd.

The sum of us is a cube number.

since the limit is 100 and that every numbers are odd, and adding an odd amount of odd numbers results in an odd number,
we can deduce that only only 1, 27, 125, 343 are possible sums. since every numbers must be different, 1 is impossible.

The product of us is a cube number.

I have no idea how to proceed other than brute force,
but only 1 combination of numbers add up to 27 : 1+3+5+7+11. And their product is not a cube number. Therefor, 27 is also an impossible sum.
which leaves 125 and 343 as possible sums.

$\endgroup$
2
$\begingroup$

1, 3, 15, 25, 81
$1 + 3 + 15 + 25 + 81 = 125$ (a cube number)
$1 × 3 × 15 × 25 × 81 = 91125$ (a cube number)

$\endgroup$
1
$\begingroup$

The only 3 answers for this are

  • 1,3,15,25,81
  • 5,7,15,35,63
  • 49,65,73,75,81

I used a simple C++ program to find these values:

#include <iostream>
#include <cmath>
bool integer(float k)
{
    if( k == (int) k) return true;
    return false;
}
int main()
{
    int a,b,c,d,e;
    for(a=1;a<100;a++)
    {
        for(b=1;b<100;b++)
        {
            for(c=1;c<100;c++)
            {
                for(d=1;d<100;d++)
                {   
                    for(e=1;e<100;e++)
                    {
                        if((a*b*c*d*e)%2 == 1 && integer(cbrt(a*b*c*d*e)) && integer(cbrt(a+b+c+d+e)) && (a!=b && a!=c && a!=d && a!=e && b!=c && b!=d && b!=e && c!=d && c!=e && d!=e) && (a<b && a<c && a<d && a<e && b<c && b<d && b<e && c<d && c<e && d<e))
                        {
                            printf("%d %d %d %d %d\n",a,b,c,d,e);
                        }
                    }
                }     
            }
        }    
    }
   return 0;
}
$\endgroup$
  • $\begingroup$ Will that link last for posterity? If not, it would be better to edit the essential parts of your solution (e.g. the details of the program you used) into this answer. $\endgroup$ – Rand al'Thor Oct 14 '16 at 14:04
  • 1
    $\begingroup$ $\sqrt[3]{49*65*73*75*81} = 1122.00000715...$ In fact, there's no way 73 could be one of the numbers, since it's prime and it has no other multiples less than 100. $\endgroup$ – Michael Seifert Oct 14 '16 at 15:03
  • 1
    $\begingroup$ @kurella : Be careful when calculating with floating point numbers. You have to double check the result. $\endgroup$ – Jamal Senjaya Oct 14 '16 at 15:19
  • $\begingroup$ @randal'thor That link lasts for life time. But I edited and added the code here itself $\endgroup$ – Kurella Hemanth Oct 15 '16 at 7:26
  • $\begingroup$ @MichaelSeifert Because of precision, the code is wrong. $\endgroup$ – Kurella Hemanth Oct 15 '16 at 7:29

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.