If (x # y) represents the remainder that results when the positive…

If (x # y) represents the remainder that results when the positive integer x is divided by the positive integer y, what is the sum of all the possible values of y such that (16 # y) = 3?

This problem repeats another one in the library (at most with different numbers), so it's left out of browsing.

AQuA-RAT — Algebra Question Answering with Rationales (Ling et al., DeepMind, 2017) · dev #40