2 fcnt - count of number of times a specified integer divides an integer
11 return non-negative integer
14 If x is nonzero and abs(y) > 1, fcnt(x,y) returns the greatest
15 non-negative n for which y^n is a divisor of x. In particular,
16 zero is returned if x is not divisible by y.
18 If x is zero or if y = -1, 0 or 1, fcnt(x,y) is defined to be zero.
21 ; print fcnt(7,4), fcnt(24,4), fcnt(48,4)
28 long zfacrem(ZVALUE x, ZVALUE y, ZVALUE *rem)
33 ## Copyright (C) 1999 Landon Curt Noll
35 ## Calc is open software; you can redistribute it and/or modify it under
36 ## the terms of the version 2.1 of the GNU Lesser General Public License
37 ## as published by the Free Software Foundation.
39 ## Calc is distributed in the hope that it will be useful, but WITHOUT
40 ## ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
41 ## or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General
42 ## Public License for more details.
44 ## A copy of version 2.1 of the GNU Lesser General Public License is
45 ## distributed with calc under the filename COPYING-LGPL. You should have
46 ## received a copy with calc; if not, write to Free Software Foundation, Inc.
47 ## 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
49 ## @(#) $Revision: 30.1 $
50 ## @(#) $Id: fcnt,v 30.1 2007/03/16 11:10:42 chongo Exp $
51 ## @(#) $Source: /usr/local/src/cmd/calc/help/RCS/fcnt,v $
53 ## Under source code control: 1995/12/18 12:03:02
54 ## File existed as early as: 1995
56 ## chongo <was here> /\oo/\ http://www.isthe.com/chongo/
57 ## Share and enjoy! :-) http://www.isthe.com/chongo/tech/comp/calc/