Product Of Consecutives

What is the smallest positive multiple of hundred which can be expressed as the product of two consecutive integers?


The answer is 600.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

3 solutions

Eamon Gupta
May 16, 2015

Note that in order to be divisible by 100, the product of these 2 numbers is divisible by both 25 and 4. So from this we can deduce that one of the numbers is a multiple of 25, otherwise they would not be consecutive.

25 - 1 = 24 which is a multiple of 4. Therefore the 2 numbers are 24 and 25, because 25 is the smallest multiple of 25. 24 × 25 = 600 24\times25=\boxed{600}

Moderator note:

Correct. Bonus question: What would the answer be if I replace the word "hundred" by "thousand"?

l set up the equation n ( n + 1 ) = 100 x n(n+1) = 100x and factored the RHS to get 4 × 25 x 4 \times 25x . Rearranging you notice 4 x × 25 4x \times 25 which easily gives 24 × 25 24 \times 25 since 24 is a multiple of 4 and satisfies our consecutive requirement. Thus, our solution is 24 × 25 = 600 24 \times 25 = 600 .

E Tyson Ewing III - 5 years ago

Bonus question, our numbers would now be 125 and 8, since 124 and 126 is not divisible by 8, let's try 375 the next odd number divisible by 125. This gives us 375 and 376, or the product 141000.

Jerry McKenzie - 4 years, 5 months ago

Log in to reply

Similar thinking

Noel Lo - 2 years, 11 months ago

Same way I got it.

alex schroeder - 2 years, 8 months ago
Chew-Seong Cheong
May 15, 2015

This is my correctly done 300 0 t h 3000^{th} problem, so I must provide the solution, which is same as Eamon Gupta 's.

Let m m and n n be positive integers such that:

100 n = m ( m + 1 ) n = m ( m + 1 ) 100 = m ( m + 1 ) 100 = m ( m + 1 ) 2 2 × 5 2 100n = m(m+1) \quad \Rightarrow n = \dfrac {m(m+1)}{100} = \dfrac {m(m+1)}{100} = \dfrac {m(m+1)}{2^2\times 5^2}

We note that the nominator of RHS m ( m + 1 ) m(m+1) is a product of an odd and an even numbers. For n n to be an integer, the odd number in the nominator of RHS must divisible by 25 25 and the even one, 4 4 . The smallest 100 n 100n is when the odd number of nominator is 25 25 and since 25 1 = 24 25-1=24 is a multiple of 4 4 , it meets the bill. Therefore the smallest multiple of 100 100 which can be expressed as the product of two consecutive numbers is 24 × 25 = 600 24\times 25 = \boxed{600} .

Moderator note:

Yes, just notice that two consecutive numbers must be coprime kills this problem. Donald Osmeyer made a valid point, you have shown that 24 24 is the upper bound of the answer, what's left is to show that no other values below 24 24 satisfy the condition, which should be pretty straightforward from then on. Bonus question: Would the answer change if I replace the word "two" with "three"?

You are right the coprimes kill it. For three consecutive numbers. It would be 23 × 24 × 25 = 13800 23\times 24 \times 25 = \boxed{13800}

For 1000 1000 instead of 100 100 , the smallest multiple is 375 × 376 = 141000 375\times 376 = 141000 . 125 = 5 3 125 = 5^3 does not have a multiple of 8 = 2 3 8=2^3 as neighbor.

Chew-Seong Cheong - 6 years ago

Requiring the odd number to be divisible by 25 and the even one divisible by 4 does not follow from what you wrote before that. For instance, m=99, m+1=100 has the even number divisible by both 4 and 25, and n=m*(m+1)/100 is an integer as needed (9900). Your requirement that the odd number must be divisible by 25 does conveniently lead to the right answer, but seems invalid here, and without that result, the rest of the proof falls apart.

Donald Osmeyer - 6 years ago
Taku Mapfumo
Jul 7, 2016

Brute force

     boolean found = false;
     int x = 11;
     while(!found){             
         if( x * (x-1) % 100 == 0){
             found = true;
         }else{
             x +=1;
         }

     }
     System.out.println(x * (x - 1));

i=1 while i>0 :

    if i*(i+1) % 100==0 :

        ans=i

            break

    else: i+=1

print" answer is : " ans*(ans+1)

Syed Hissaan - 4 years, 3 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...