Today, I did get it in three with (499, 760), which is at worst a coinflip, but may only have one remaining candidate.
Subtracting from 760, 1 * 29 and 8 * 29 are out because they're a prime number away from a clue. 2 *, 4 *, 5 *, and 6 * 29 are out because they'd yield a "Largest factor is <something>" clue, instead. I thought 7 * 29 = 557 would have yielded "(x+760)'s largest prime divisor is 439." Meanwhile, 673 + 760 = 1433, which is prime.
I still don't have a firm grasp on when the "(x + <guess>)'s largest prime divisor is <something>" clue appears.
For example, with today's 673 solution, if the guess is 29 off, it doesn't give the "(x-673) is a prime number." Instead it gives these two: "(x+644)'s largest prime divisor is 439" and "(x+702)'s largest prime divisor is 11." However, for 499, it gave us the "(x-499)'s largest prime divisor is 29" instead of "(x+499)'s largest prime divisor is 293."
I may be overlooking something obvious.
I expect nothing less from someone who sees "x>499, 499 + x's greatest divisor is 53" and thinks "yes I calculate and keep track of all 9 candidates in my mind"
My mental arithmetic ability is a much more of an outlier than my memory. This game enables me to exercise that ability. My brain is a bit weird in that it took me about as long to figure out 760 - 87 + 760 = 1433 as it did to figure out 1433 was prime. In cases like the "keep track of all 9 candidates in my mind," I am keeping track of them as 1 through 9 rather than 53 through 477...and I can usually eliminate several straight away.
Much of my mental math skill is based on minimizing how much of my very good, but not extraordinary, memory is required. For that reason, had I started today with 702 and had "(x+702)'s largest prime divisor is 11," I would have been very annoyed. My process would be:
- 702 mod 11 = 9
- (2 * 702) mod 11 = 7, since 18 mod 11 = 7
- This means the first candidate is 702 -7 = 695.
- My guess will be 695 - 11n, for some value of n that cuts the remaining numbers in half...so I want n around 31.
- (702 + 695) = 1397 = 127 * 11.
- If (x + 702) were 90 * 11, that would be easy and fulfill the largest prime divisor being 11.
- 127 - 90 = 37
- 695 - 11 * 37 =
- 695 - 407 =
- 288
- Ooh, that's nice because it has a lot of factors, since 288 = 17² - 1² = (17 +1)(17 - 1) = 18 * 16 = 2⁵ * 3² -> 18 factors
- (702 - 288) nor (702 + 288) are perfect powers. Let's use that.
288 may not have been the optimal choice, but it feels like a valid solution. Moreover, it minimized the difficulty of the mental arithmetic.
For step 6 & 7, I could have chosen n = 31, which would have gave me 354 instead 288. That's closer to the midpoint between all candidates, 2 through 695. My brain decided to simplify the step where I made (x + 702) = 90 * 11 instead of 96 * 11, even though I didn't need to calculate that. 354 probably is the slightly better choice.
Anyway, my point in sharing all that is how, again, I can do all this while minimizing the memory requirements and how difficult the arithmetic is.