Zarrolou
\(686\)
Subtract twice the last digit (2*6) from the # formed by the remaining digits(68)
\(68-12=56\)
If the diff is divisible by 7, the original # is a multiple of 7.
\(686-56=630\) 630 is divisible by 7 => 686 is divisible by 7.
I have never heard of this rule before.
Hope I got it right (it should be right I tesed other numbers)
This is the correct illustration of the "divisible by 7 shortcut". Nicely done.
Of course, it's hard to remember many obscure rules that will likely never become relevant on the GMAT, so take these rules with a grain of salt. The best strategy is still to logically and systematically drop multiples until you get to the right answer. For 686, you might be able to see that it's 14 away from 100, so this is 7x98. Otherwise drop multiples of 7, 70, 700, etc. 700 is too big, so we can drop 70x9=630, leaving us with 56 (or 7x8).
This technique is good because it works for all numbers quickly. The only ones you should definitely know are 2, 3, 5 and 10. All others may have simple shortcuts but being able to drop multiples quickly to determine divisibility is the most flexible strategy.
Hope this helps!
-Ron