A positive integer is divisible by 3 if and only if the…

A positive integer is divisible by 3 if and only if the sum of its digits is divisible by 3. If the six-digit integer is divisible by 3, and n is of the form 1k2,k42, where k represents a digit that occurs twice, how many values could n have?

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) · train #1211