/*
 * pollard - factor using Pollard's p-1 method
 *
 * Copyright (C) 1999  David I. Bell
 *
 * Calc is open software; you can redistribute it and/or modify it under
 * the terms of the version 2.1 of the GNU Lesser General Public License
 * as published by the Free Software Foundation.
 *
 * Calc is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
 * or FITNESS FOR A PARTICULAR PURPOSE.	 See the GNU Lesser General
 * Public License for more details.
 *
 * A copy of version 2.1 of the GNU Lesser General Public License is
 * distributed with calc under the filename COPYING-LGPL.  You should have
 * received a copy with calc; if not, write to Free Software Foundation, Inc.
 * 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA.
 *
 * @(#) $Revision: 30.1 $
 * @(#) $Id: pollard.cal,v 30.1 2007/03/16 11:09:54 chongo Exp $
 * @(#) $Source: /usr/local/src/bin/calc/cal/RCS/pollard.cal,v $
 *
 * Under source code control:	1991/05/22 21:56:37
 * File existed as early as:	1991
 *
 * Share and enjoy!  :-)	http://www.isthe.com/chongo/tech/comp/calc/
 */


define pfactor(N, B, ai, af)
{
	local	a, k, i, d;

	if (isnull(B))
		B = 1000;
	if (isnull(ai))
		ai = 2;
	if (isnull(af))
		af = ai + 20;
	k = lcmfact(B);
	d = lfactor(N, B);
	if (d > 1)
		return d;
	for (a = ai; a <= af; a++) {
		i = pmod(a, k, N);
		d = gcd(i - 1, N);
		if ((d > 1) && (d != N))
			return d;
	}
	return 1;
}
