代码搜索：factor
找到约 6,651 项符合「factor」的源代码
代码结果 6,651
www.eeworm.com/read/264721/11303704
h ct.h
/************************************************************************
* *
* Copyright (C) SEIKO EPSON CORP. 1999 *
* *
* File name: ct.h *
* This is clock time
www.eeworm.com/read/158297/11626980
m eulerphi.m
function phi = eulerphi(n);
% Calculates the Euler phi function of n
f=factor(n);
fln=length(f);
f(fln+1)=0; % Appending a zero to make (f(j)==f(j+1)) never go out of bounds
phi=1;
ct=0;
for j=1:
www.eeworm.com/read/158297/11626993
m multsell.m
function y = multsell(p,M,a,b,n);
% This function prints the first M multiples of p
p=p(:)';
y=zeros(M,2);
y(1,:)=p;
q=p;
for k=2:M,
z=addell(p,q,a,b,n);
q=z;
if (length(z)==0), % must hav
www.eeworm.com/read/158297/11627002
m multell.m
function y = multell(p,M,a,b,n);
% This function prints the Mth multiple of p on the elliptic
% curve with coefficients a and b mod n.
z1=M;
y=[inf inf];
while (z1 ~=0),
while (mod(z1,2) ==0),
www.eeworm.com/read/156908/11753110
cpp lenstra.cpp
/*
* Program to factor big numbers using Lenstras elliptic curve method.
* Works when for some prime divisor p of n, p+1+d has only
* small factors, where d depends on the particular curve
www.eeworm.com/read/156908/11753730
cpp brent.cpp
/*
* Program to factor big numbers using Brent-Pollard method.
* See "An Improved Monte Carlo Factorization Algorithm"
* by Richard Brent in BIT Vol. 20 1980 pp 176-184
*
* Requires:
www.eeworm.com/read/345593/11806166
pas unit1.pas
{: A variation of the magacube bench for testing sorting.
The cubes in this sample are transparent, and as such need to be depth-sorted
to render correctly, this uses an alternate sorting c
www.eeworm.com/read/259112/11820119
m tfrrmsc.m
function [tfr,rtfr,hat] = tfrrmsc(x,t,N,f0T,trace,K);
%TFRRMSC Reassigned Morlet Scalogram time-frequency distribution.
% [TFR,RTFR,HAT] = TFRRMSC(X,T,N,F0T,TRACE)
% computes the Morlet scalogram and
www.eeworm.com/read/258434/11864702
c ifactor.c
/*
** ifactor.c -- print prime factorization of a number
**
** Ray Gardner -- 1985 -- public domain
*/
#include
#include
int prevfact = 0;
void factor (long);
void sh