Will determine if the number you input is prime, or displays it's factors.
Note: CPU - intensive.
Bugs: Glitches out (immediately declares prime) when using 'really big*' numbers.
I haven't programmed in handling for negative or non-whole numbers...
To Do: Add a timer for 'big numbers' estimated completion.
I just did this as a practice exercise / fun, so if anyone wants to improve it, by all means go ahead
Is there a faster way to do this?
Code:
#NoEnv
#SingleInstance, Force
SetBatchLines, -1
Start:
Factors=
Matches=0
Percent=0
Aborted=
Abort=
InputBox, Number, Prime # Tester, Please enter the number you'd like to test:
If ErrorLevel
ExitApp
Loops:=Floor(Number / 2)
Progress, r1-100, Factors found:`n`nEsc to abort, Checking %A_Index% of %Loops% (%Percent%`%)
Loop, %Loops%
{
If Abort
Break
Percent:=Round((100 * A_Index / Loops),2)
Pct:=Floor(Percent)
Progress, %Pct%, Factors found:`n%Matches%`nEsc to abort, Checking %A_Index% of %Loops% (%Percent%`%)
If A_Index = 1
Continue
If (Mod(Number, A_Index) != 0)
Continue
Factors=%Factors%%A_Index%`,
Matches++
}
Finish:
Progress, off
StringTrimRight, Factors, Factors, 1
If Factors
MsgBox, The following factors (%Matches% total) of %number% were found:`n%factors%%Aborted%
Else
MsgBox, %Number% is prime!%Aborted%
GoSub, Start
Return
esc::
Aborted=`n(Search aborted at %percent%`%!)
Abort=1
Return
* 18500000000000000000 will not work, but 18400000000000000000 will.
Login
Register
FAQ
Search
