An integer x is prime if it is divisible by 1² . Use t (below generated as a random int.) to write a function on python that finds the largest even prime integer x < t. Condition: if some x is a prime number then, divide x by all possible squares.

import math

import random

z = 23086243

random.seed(23086243)

t = random.randint(1e13, 1e14)

print(t)

#random t : 34500958337943

def Largest_even_primitive(t):

Note: divide x^2 up to x= [radical n], where [ ] is a ceiling function.