I am trying to figure out how to find the Floor and Ceiling of a nested Multiplication of fractions.
I understand that
$ \left\lceil{\frac{x}{mn}}\right \rceil= \left\lceil{\frac{\lceil{\frac{x}{m}}\rceil}{n}}\right\rceil $
works when x, m, n are all integers, and also for the Floor Function thanks to this great answer by Brian M. Scott but what about something like this:
⌈⌈⌈53 * 1/2⌉ * 9/5⌉ * 4/7⌉
or the inverse
⌊⌊⌊53 * 1/2⌋ * 9/5⌋ *4/7⌋
I have done some noodling and if you simply take the floor of each in a iterative process it sometimes yields different results depending on the order that you choose the fractions to multiply with. I would like to figure what the fixed lower/upper limit would be regardless of the order in which you multiply x by each of the fractions iteratively.
Is there a known method for working this out that is provably true?
Thanks in advance!