jiri
/
LA_library
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

improved simple factorization

This commit is contained in:
Jiri Pittner 2023-12-28 23:57:02 +01:00
parent c6a9a8e456
commit 40b23f19d6
2 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
numbers.cc
View File

@ -22,12 +22,12 @@
namespace LA {
template<typename N>
N primefactor(const N &x)
N primefactor(const N &x, const N &last)
{
N i,t;
if ( x <= 2 ) return x;
if ( !(x & 1) ) return 2;
i = 3;
i = last >3 ? last : 3;
for (;;) {
t = x / i;
if ( t < i ) break;
@ -47,7 +47,7 @@ N y=x;
N last=0;
while(y>1)
{
N z=primefactor(y);
N z=primefactor(y,last);
if(z!=last)
{
std::pair<N,N> p;
@ -121,7 +121,7 @@ return y;
//force instantization
#define INSTANTIZE(N) \
template N primefactor(const N &x); \
template N primefactor(const N &x, const N &last); \
template FACTORIZATION<N> factorization(const N &x); \
template N nextprime(N x); \
template std::ostream & operator<<(std::ostream &s, const FACTORIZATION<N> &x); \

2
numbers.h
View File

@ -31,7 +31,7 @@
namespace LA {
template<typename N>
N primefactor(const N &x);
N primefactor(const N &x, const N &last=0);
template<typename N>
bool isprime(const N &x) {return x>1 && x==primefactor(x);}