x
This website is using cookies. We use cookies to ensure that we give you the best experience on our website. More info. That's Fine
HPC:Factor Logo 
 

Prime Factorization Software

Download Summary:

Support the Site
Become a HPC:Factor Plus Subscriber Member button
Support us on Patreon button
Support HPC:Factor in continuing to offer support and downloads to the community! Make a donation button.

This software performs prime factorization and looking up prime numbers in a specified range.

To download you must be logged-in and be a subscriber or have met our community quality and reputation requirements as a free user. (Find out more · Subscribe)
Version:
2.1
Download Size:
1.65 MB - 24.07 MB
Popularity:
1980
Number of Downloads:
2
Added By:
torch on 19/09/2022 4:09:28 PM

Overview:

This software performs prime factorization and looking up prime numbers in a specified range.

First, the most simple algorithm is this.

Try to divide the input value by all integers between 1 and that number, then judge a number that could firstly divide the number is a prime factor.
Then, repeat this procedure with the result of the division until it becomes a prime number.

This software accelerates this algorithm by using the following properties.

If a result of a division is smaller than the divisor, you can decide that a dividend is a prime number.
Numbers other than 2 are not a prime number.

I used a similar algorithm in the "List/Count Prime Numbers" feature.

By the way, you can use this program as a template to create your own GUI application w/ Windows API. It's quite troublesome to create GUI applications w/ Windows API on your own, and I made it easier by providing this program. You can create one by just replacing the functions that perform calculations!

I tested on SHARP Brain PW-SH1 (Windows Embedded CE 6.0, ARMv5TEJ.

I compiled for CPUs that the IDE supports. However, since I don't have other devices, I can't test them.

Windows CE

"AppMain.exe" is for ARMv4I devices. If your device is other than that, select one from "Other CPU". Then, run it in a way that your device requires.

How to use

First, this software launches with the "Prime Factorization" mode.

You can switch to the "List/Count Prime Numbers" mode in the options menu.

This software launches with your OS's UI language. Since some Windows CE doesn't support the function, Windows CE version software always launches with English. You can switch the language at "Options -> Language".

Since the output may get long, the "List/Count Prime Numbers" feature supports outputting to a text file. As the default setting, this software postscripts if a selected file already exists. You can change this behavior at "Options -> Overwrite an existing file."

Also, you can save the contents of the output box as a text file. Note that this feature always overwrites an existing file.

You can see other contents at "Help -> How to use". This menu displays the proper one for the selected mode.

Download:

FileArchitectureSize
Prime_Factorization_v2_1.zip
2.1
ARM, MIPS, SH3, SH4, X86
Windows CE 6.0 and higher
1.65 MB
MD5: E5BBBAEC6BB1A0DA3B4E675D7A1B00D0
prime-factorizarion-win32api-2.1.tar.gz
2.1
22.42 MB
MD5: 54A579D647D250ECFB0421B8CF2BE82A

Donate:

Support the Site
Become a HPC:Factor Plus Subscriber Member button
Support us on Patreon button
Support HPC:Factor in continuing to offer support and downloads to the community! Make a donation button.
HPC:Factor believes that the Internet is a better place without the constant displaying of adverts on community website resources and as such does not carry 'ad-words', banners, pop-up's or any other form of paid advertising.

Please help to pay for the download that you are getting from us today and help to support our desire to run the site without paid subscriptions or advertising by making a donation to the site. It doesn't matter how much or little you donate, but by donating you will help to ensure that we can continue to offer some of the Internet's most popular, rarest and unusual downloads for Windows CE devices for now and for the future.