Making a factoring calculator

[DaVe]

Hey I am working on a making a program that can find the factors of numbers. I really need help if anyone know how to do this please let me know or share a picture of the code.

[TimAI2]

This approach seems most programmable:

"

How to Factor Numbers: Factorization

This factors calculator factors numbers by trial division. Follow these steps to use trial division to find the factors of a number.

1. Find the square root of the integer number n and round down to the closest whole number. Let's call this number s.
2. Start with the number 1 and find the corresponding factor pair: n ÷ 1 = n. So 1 and n are a factor pair because division results in a whole number with zero remainder.
3. Do the same with the number 2 and proceed testing all integers (n ÷ 2, n ÷ 3, n ÷ 4... n ÷ s) up through the square root rounded to s. Record the factor pairs where division results in whole integer numbers with zero remainders.
4. When you reach n ÷ s and you have recorded all factor pairs you have successfully factored the number n.

"

Use the remainder block to identify factors, the maths blocks and a looping procedure should do the rest.

[TimAI2]

Here are the basics, a bit more work to do to order the list and remove duplicates.

[TimAI2]

Hopefully the full requirement, using Imaginity's bubble sort method (more blocks than the rest of the aia!)

aia attached

note: you could avoid using the sort method by inserting the factors to the middle of the list, instead of adding to the end

[TimAI2]

Without the sort method, but inserting to centre of list

[Abraham Getzler]

How big a number do you want to factor?

For tremendous numbers, to avoid having your   app go

unresponsive, you would have to break up the work into chunks

dribbled out under control of a Clock Timer.

The attached app solves a different problem, finding all the primes up to a limit,

but it shows the Clock Timer technique.

ABG

[SteveJG]

This probably would work using the  mXparser library

Use the Math Expression Parser of               http://mathparser.org/ 

that Taifun has created an extension for       https://puravidaapps.com/math.php  

It has a routine that finds factors  of a number   http://mathparser.org/api/org/mariuszgromada/math/mxparser/mathcollection/NumberTheory.html#numberOfPrimeFactors-double-   that probably can 

be used.  You will have to experiment.

Regards,

Steve

[Juan Antonio]

Other code:

[TimAI2]

^^^ nice :)

[Juan Antonio]

Thank you Tim.

Only curiosity, find primes by JavaScript, very fast:

https://groups.google.com/forum/#!category-topic/mitappinventortest/apps-tips--tricks/xluJ9KV7qCs