Counting Up = Counting Down

Hansel has to count upwards from 1, increasing the value by n n each second.
Gretel has to count downwards from 1000, decreasing the value by m m each second.

If m m and n n are both positive integers, at how many (distinct) seconds can they possibly say the same number at the same time?

7 8 9 12

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.

1 solution

Calvin Lin Staff
Nov 1, 2016

At time t t , Hansel will say 1 + n t 1 + n t will Gretel will say 1000 m t 1000 - m t .
Thus, we're interested in the values of t t such that

1 + n t = 1000 m t ( n + m ) t = 999 1 + n t = 1000 - mt \Rightarrow (n+m) t = 999

So, t t must be a positive divisor of 999 = 3 3 × 37 999 = 3 ^3 \times 37 . There are ( 3 + 1 ) ( 1 + 1 ) = 8 (3+1)(1+1) = 8 of them, namely 1 , 3 , 9 , 27 , 37 , 111 , 333 , 999 1, 3, 9, 27, 37, 111, 333, 999 .

However, we also require that n n and m m are both positive integers, which means that n + m 2 n + m \geq 2 . Hence, t 999 2 t \leq \frac{999}{2} , which means that we cannot include t = 999 t = 999 as an answer.

For each of remaining 7 values, we have n = 1 , m = 999 t 1 n = 1, m = \frac{999}{t} - 1 as a solution set. Thus, there are 7 possible values for t t .

The question of the task ("...maximum different seconds ...) is very unlucky and unknowable established! I guess it would have been better to ask for the maximum possible numbers of times [s].

Andreas Wendler - 4 years, 7 months ago

Log in to reply

I agree. I changed it to "how many (distinct) seconds".

Calvin Lin Staff - 4 years, 7 months ago

There are more solution sets with n>1 in dependence on t.

Andreas Wendler - 4 years, 7 months ago

Log in to reply

Yes of course. We're just interested in distinct t t , and the last line is to ensure that for each of the 7 values of t t , there exists corresponding solutions ( m , n ) (m,n) .

Calvin Lin Staff - 4 years, 7 months ago

Wow.. I forgot to read that m and n are integers.

William Isoroku - 4 years, 7 months ago

I found the wording puzzling at best, could not figure out what was asked. I think a less concise version would be advisable. Thank you.

Marta Reece - 4 years, 6 months ago

Oh I finalized my answer at 8 values.

Shreyash Rai - 4 years, 6 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...