{'fraction_non_alphanumeric': 0.031141868512110725, 'fraction_numerical': 0.006920415224913495, 'mean_word_length': 4.514285714285714, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 1, '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}}
Powers in recurrence sequences: Pell equations

In this paper, we present a new technique for determining all perfect powers in so-called Pell sequences. To be precise, given a positive nonsquare integer D, we show how to (practically) solve Diophantine equations of the form x 2 - D y 2n = 1 in integers x, y and n > 2. Our method relies upon Frey curves and corresponding Galois representations and eschews lower bounds for linear forms in logarithms. Along the way, we sharpen and generalize work of Cao, Af Ekenstam, Ljunggren and Tartakowsky on these and related questions.