“…, x n in G. This notion, introduced by Bou-Rabee in [5] is called the normal residual finiteness growth function, see also [6,9,14,26], and it is called residual finiteness growth function in Thom [35] and Bradford and Thom [8] (not to be confused with residual finiteness growth function in terminology of [7], that measures the size of finite, not necessary normal subgroups, not containing a given element), who have proven the lower bound ě Cn 3{2 { log 9{2`ǫ n, which holds for any ǫ ą 0. Kassabov and Matucci suggested in [26] that the argument of Hadad [21] can give a close upper bound for normal residual finiteness growth, function, namely n 3{2 . A known upper bound so far is n 3 [5], which is a corollary of the estimate for SLp2, Zq, using imbedding of a free group to this group.…”