{'fraction_non_alphanumeric': 0.08333333333333333, 'fraction_numerical': 0.030555555555555555, 'mean_word_length': 3.5125, 'pattern_counts': {'":': 0, '<': 1, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
The minimum sum of element orders of finite groups

Let G be a finite group and ψ(G) = ∑ g∈G o(g), where o(g) denotes the order of g ∈ G. We show that the Conjecture 4.6.5 posed in [Group Theory and Computation, (2018) 59-90], is incorrect. In fact, we find a pair of finite groups G and S of the same order such that ψ(G) < ψ(S), with G solvable and S simple.