{'fraction_non_alphanumeric': 0.03611111111111111, 'fraction_numerical': 0.008333333333333333, 'mean_word_length': 3.75, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 2, '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}}
A Theorem on factorization of certain entire functions

Y. Noda proved that for any given entire function F the set of a for which F (z) + az is not prime is at most countable. In this paper we prove that the function G(e z) + az is prime with at most two exceptional values a where G(w) is an entire function satisfying for R≥R 0 > 0 and for some constant K>0