Bounds for 11.5 variant


#1

I understand the logic that’s supposed to be applied, but I’m confused on how best to represent the bounds. in particular where x > 1 and y < 1. Say x = 8 and y = 0.0000001, we’re looking a huge number to be the answer, let alone find the upper bound. I’m starting to trip myself up on the various combinations now. There’s got to be an easier way?