How many tuples of group elements have a given property?

Generalising Solomon's theorem, C. Gordon and F. Rodriguez-Villegas have proven recently that, in any group, the number of solutions to a system of coefficient-free equations is divisible by the order of this group whenever the rank of the matrix composed of the exponent sums of i-th unknown in j-th equation is less than the number of unknowns. We generalise this result in two directions: first, we consider equations with coefficients, and secondly, we consider not only systems of equations but also any first-order formulae in the group language (with constants). Our theorem implies some amusing facts; for example, the number of group elements whose squares lie in a given subgroup is divisible by the order this subgroup.