The calculator above takes in an integer input at the lower left. Then, a path is taken to the top right - at each step moving up or right - and the operations given are performed on the input sequentially.
If a path gives an output of 43, which of the following choices could have been the initial input?
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.
To clarify, as mentioned in the comments, only the initial input is required to be an integer; intermediate steps are allowed to be non-integers.
It is easy to demonstrate that every intermediate step must be an integer.
We have an integer [1;8] in step 0. In every next step we have either a multiplication by an integer or an addition to an integer. Since a multiplication of integers or addition of integers always results in an integer, every intermediate step is always an integer.
We further proceed just as Worranat suggested. For such a small problem this is probably the optimal solution.
Fun problem! The range of achievable outputs for digit inputs appears to be 2 1 to 5 0 5 , but I haven't calculated the number of distinct possible outputs. That would be a bit tedious and best left to a computer program.
Note: We cannot directly claim that "Since 22 is not a multiple of 3 or 5, this leg is not applicable", since it might have be possible that some other operation would have allowed us to divide by 3.
We just need a small fix to this problem. Do you see what to do?
Log in to reply
I don't quite see. Do you mean there is other plausible operation route?
Log in to reply
Not quite. In order to conclude that "the number has to be a multiple of 5 (or in the other case, 3)", what we require is a certain condition on the input. Otherwise, without any restriction, the input could have been 5 2 2 , which when multiplied by 5 gives us 22.
Log in to reply
@Calvin Lin – But in the question, we already stated that the input is an integer, and with all the processes, the input will continue to be an integer, not a fraction. Isn't that enough?
Log in to reply
@Worranat Pakornrat – Right. My point is that you didn't state that in the solution, and left that to the reader to "mind read". That's the small fix that I'm referring to.
IE Notice that every input and output will be an integer. Hence, an output from " × n " will be a multiple of n . So, when backtracking, if the output is not a multiple of n , then there isn't a valid input we could use.
Ah, I see I said "small fix to problem" instead of "small fix to solution". Sorry for the confusion.
Log in to reply
@Calvin Lin – That's alright. I already added in some clarification. Hope you enjoyed the problem then. ;)
Misleading problem statement.
Log in to reply
In what way is it misleading? That would allows us to clarify it for the rest of the community.
Log in to reply
The way I read it, you could take any route and achieve the same result, which is obviously not the case. That is misleading
Log in to reply
@Gabriel Souza – I've added a note to help clarify that. It should be clear that different paths would lead to different outputs.
The input is an integer; the integers are closed under addition, subtraction, and multiplication; thus, every intermediate number is an integer.
Problem Loading...
Note Loading...
Set Loading...
It's easier to reverse the process from the end product to its source, as shown below:
That is, starting from 4 3 , its nearest operator is + 1 , so we can reverse the operation to be 4 3 − 1 = 4 2 .
Then from 4 2 , there are two legs to go: to divide by 2 or 3 , yielding 2 1 or 1 4 respectively. In the question, it is stated that the input is an integer, and with all the processes, the input will continue to be an integer. However, for the first leg, when 2 1 + 1 = 2 2 , it's not a multiple of 5 or 3 while 2 1 + 2 = 2 3 , it's prime and not a multiple of 3 . Thus, this leg is not applicable.
Continuing on the latter leg, 1 4 + 3 = 1 7 on the upper leg is prime, it's thus not a multiple of 7 . On the other hand, 1 4 + 1 = 1 5 which can be divided by both 3 and 5 in the next operations, yielding 5 and 3 respectively.
Then 5 − 2 = 3 and 3 − 2 = 1 are not even numbers, so that leaves only one path left 3 − 1 = 2 and 2 2 = 1).
Thus, 1 is the only plausible input digit, and there is only one path to reach the desired result, as demonstrated by the pink trail below: