Solution of problem 132 via algebra of predicates been built by Helen A. Mironchick (Informatics at school №3 2019)

 Compare with the decision number 132 in the article
     http://kpolyakov.spb.ru/download/ege18del.pdf
 and feel the difference.

Solving the same problem with clear understanding of the predicate's
definition
  D(a,x) = { 1: x mod a =0 ;
                  0: x mod a !=0 }
Down here you won't find any "dancing with wolfs" , just moving
straight ahead driven by commonly known rules of Boolean Algebra

Just click on snapshot to convert text below into perfect view