In hindsight, I should've just gone for something like an antiprime, since they would've been much more useful here.
I wanted it to be divisible by 8, if not 16.
Wouldn't you want to search for numbers divisible by 4? I must be missing something here.
[ETA: I just tried 475 when 192 was the solution (475 + 192 = 667) and did get "(x+475)'s largest prime divisor is 29" as I suspected. My logic for choosing 192 over 168 was correct.]
Make sense, given that 475-192 = 283, which is prime.
I ended up getting lucky based on somewhat bad thinking.
Hey, same here! Today I tried (499, 744). 499 gives "largest prime divisor is 7", and 744 gives "x-744 is a square". Since we know that (x-499) mod 7 = 0, and also (744-499) mod 7 = 0, then that necessarily means that x = 7n + 499, where n > 35 is some natural number. Or, put another way, x = 7m + 744, m > 0 a natural. But we know that x - 744 = (7m + 744) - 744 = 7m is a square. Therefore, m = 7, and that's the only possible value it can take.
Except I get this feeling. This feeling that I'm Wrong. And indeed, WolframAlpha tells me that I'm Wrong, because the answers to "7m is a square" is m = 7(y*2). If y=1, then we do get m=7, but if y=2, then m=28... and uh oh, x = 7*28+744 = 940 < 999...