Seeking feedback on a new integer factorization algorithm

AlbericoLepore1 pts0 comments

GitHub - Piunosei/factorization_nr_138132535-: Integer factorization · GitHub

/" data-turbo-transient="true" />

Skip to content

Search or jump to...

Search code, repositories, users, issues, pull requests...

-->

Search

Clear

Search syntax tips

Provide feedback

--><br>We read every piece of feedback, and take your input very seriously.

Include my email address so I can be contacted

Cancel

Submit feedback

Saved searches

Use saved searches to filter your results more quickly

-->

Name

Query

To see all available qualifiers, see our documentation.

Cancel

Create saved search

Sign in

/;ref_cta:Sign up;ref_loc:header logged out"}"<br>Sign up

Appearance settings

Resetting focus

You signed in with another tab or window. Reload to refresh your session.<br>You signed out in another tab or window. Reload to refresh your session.<br>You switched accounts on another tab or window. Reload to refresh your session.

Dismiss alert

{{ message }}

Piunosei

factorization_nr_138132535-

Public

Notifications<br>You must be signed in to change notification settings

Fork

Star

main

BranchesTags

Go to file

CodeOpen more actions menu

Folders and files<br>NameNameLast commit message<br>Last commit date<br>Latest commit

History<br>16 Commits<br>16 Commits

README.md

README.md

factorization-nr138132535_version2.c

factorization-nr138132535_version2.c

factorization-nr138132535_version2_1.c

factorization-nr138132535_version2_1.c

factorization-nr138132535_version2_2.c

factorization-nr138132535_version2_2.c

factorization-nr138132535_version2_3.c

factorization-nr138132535_version2_3.c

factorization_nr_138132535.c

factorization_nr_138132535.c

View all files

Repository files navigation

factorization_nr_138132535-

Integer factorization

version2_2 seems to be faster than all the others on large numbers

version2_2

Input N (number to factor)

P=1

a=2

b=1

while( P==1 || P==N ){

M=b*N

while(a

Output P (factor of N)

version2_3

Input N (number to factor)

P=1

a=2

b=1

c=1

while( P==1 || P==N ){

M=b*N

while(c

Output P (factor of N)

version 2_3 is much faster

About

Integer factorization

Resources

Readme

Uh oh!

There was an error while loading. Please reload this page.

Activity

Stars

stars

Watchers

watching

Forks

forks

Report repository

Releases

No releases published

Packages

Uh oh!

There was an error while loading. Please reload this page.

Contributors

Uh oh!

There was an error while loading. Please reload this page.

Languages

100.0%

You can’t perform that action at this time.

factorization while reload factorization_nr_138132535 search feedback

Related Articles