def x2_x3_x4_x5_x6_same_digits(x):
x2 = 2*x
x3 = 3*x
x4 = 4*x
x5 = 5*x
x6 = 6*x
if is_permutation(x2,x3) and is_permutation(x3,x4) and is_permutation(x4,x5) and is_permutation(x5,x6):
return True
else:
return False
def test_seq(n):
for x in range(0,3):
seq_term = guess + x * seq_len
print(seq_term)
if not is_permutation(seq_term, guess) and not is_prime(seq_term):
print("hello")
break
elif x == 2:
return int(str(guess) + str(guess + seq_len) + str(guess + 2 * seq_len))
def solve():
for guess in range(1488,10000): # checked in testing that it's not before 1487
for seq_len in range(1,9999):
if guess + 2 * seq_len > 9999:
break
for x in range(0,3):
seq_term = guess + x * seq_len
if not is_permutation(seq_term, guess) or not is_prime(seq_term):
break
elif x == 2:
return int(str(guess) + str(guess + seq_len) + str(guess + 2 * seq_len))
