Last summer we had great news: TI releases a new color calculator, the TI-84+CE-T! Everyone happy, but not the ASM experts, because they found out that it was signed with a 2048-bit signing key, which is impossible to crack with the current possibilities. That is why they never can create Apps for the CE, until TI releases the SDK. Maybe we could help to crack that enormous number with BASIC?

The way to crack that key, is to find the factors of that key, such that P*Q=[signing key]. In the reverse, if you know the key, you can theoretically find P and Q, but that takes ages. That is what this task is about. You have to factor a number as fast as possible. I made this, because factorization is a pain and takes much time, especially with large numbers.

Task 5
Given the input in both N and Ans, output the two factors in L1 as a list. No limitations, and you may assume that number is withing the bounds of TI-BASIC.

Example: 5680842901 would be 60869*93329.

Good luck all and speed is still very important!

Submission
Now that the last task is being posted, you can submit your entries. Submit your entries by emailing them, in a ZIP file, to

basiccompetition@gmail.com . Any entry before March 22th 11:59:59 pm GMT will be accepted, entries after that will be removed. Be sure to provide your Cemetech username in the subject or body of the email so we know who you are! Everyone can submit as many entries as they want, the last one will always be tested. If you have more programs for a task, please say which program is the main.

Testing
This is how I will test all the entries. I will first reset my whole calculator, including the Archive. Next, I transfer my timing program to the calculator, and after that, all the inputs. Finally, after that, I will transfer your program, so the VAT entry is for everyone equal.

I will test all the entries

3 times, and the speed is the average of that 3. You may assume no variable exists, without the input variable(s). I will measure the time with always the same program, upto 3 digits, so 4.193 can be the time for someone.

If you think it is not fair that I test my own programs, please pm me, and we will look for a solution

I will try to test all the programs as fast as possible, but it's dependant of the entries how many time that takes

I hope you all enjoy this competition, and it's not only for competing, but also for writing algorithms for yourself.

Summary of the 5 tasks:

1. Sort a list

2. Express a string

3. Make 24 with 4 numbers

4. Compress a string

5. Factorize a large number
I hope that there are many, many entries coming!

If you have still questions, please post or pm me

Good luck in the last week!

EDIT: somehow I forgot to say that: the number is always a product of 2 primes, a so-called semiprime