<jupyter_start><jupyter_text>Prime Factorization - Have the user enter a number and find all Prime Factors (if there are any) and display them.<jupyter_code>n=int(input("Enter an integer:"))
print("Factors are:")
i=1
while(i<=n):
    k=0
    if(n%i==0):
        j=1
        while(j<=i):
            if(i%j==0):
                k=k+1
            j=j+1
        if(k==2):
            print(i)
    i=i+1<jupyter_output>Enter an integer:12
Factors are:
2
3
{'fraction_non_alphanumeric': 0.14412416851441243, 'fraction_numerical': 0.028824833702882482, 'mean_word_length': 2.398496240601504, 'pattern_counts': {'":': 0, '<': 6, '<?xml version=': 0, '>': 4, '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}}
{'chain_length': '1', 'dir': 'jupyter-structured-clean-dedup', 'id': '385631', 'license': 'MIT', 'n_tokens_mistral': 179, 'n_tokens_neox': 171, 'n_words': 42, 'path': 'Prime Factorization.ipynb', 'repo_name': 'ahkhalwai/Python_Mini_Projects', 'size': '451'}