Code covered by the BSD License
-
demo_vpi
-
base2vpi(B,base)
bin2vpi: converts an integer in an arbitrary base into vpi (decimal) form
-
bin2vpi(B)
bin2vpi: converts a binary representation of an integer into vpi (decimal) form
-
binomfactors(n,k)
binomfactors: list all factors of the binomial coefficient nchoosek(n,k)
-
catdigits(N,M)
catdigits: concatenates the digits of N and M into an aggregate number
-
createPrimesList
createPrimesList - For users of older matlab releases, this function will generate a compatible _primeslist_ file
-
factorialfactors(n)
factorialfactors: efficient computation of the prime factors of factorial(n)
-
fibonacci(n)
fibonacci: vpi tool to efficiently compute the n'th Fibonacci number and the n'th Lucas number
-
getprimeslist
loads the primeslist file, and decompresses it, returning the list of primes up to 2^26
-
ispalindrome(N)
ispalindrome: test if the number N (vpi or numeric, or a digit string as a vector) is a palindrome
-
iszero(INT)
vpi/iszero: test to see if a numeric object is zero
-
legendresymbol(a,p)
legendresymbol: computes the legendre symbol (a/p) for prime p
-
lineardiophantine(A,B,C)
lineardiophantine: solve the linear Diophantine equation, A*x + B*y = C
-
mersenne(p)
mersenne: identify whether 2^p-1 is a Mersenne prime, using the Lucas-Lehmer test
-
minv(a,p)
-
modfibonacci(n,modulus)
fibonacci: compute the n'th Fibonacci number and the n'th Lucas number, all modulo a given value
-
modrank(A,p)
modrank: compute the rank of an integer array, modulo p
-
modroot(a,p)
-
modsolve(A,rhs,p)
-
nextprime(N,direction,kprimes)
nextprime: finds the next larger prime number directly above (or below) N
-
numberOfPartitions(N)
numberOfPartitions: compute the number of partitions of the positive integer n
-
powermod(a,d,n)
vpi/powermod: Compute mod(a^d,n)
-
quadraticresidues(N)
quadraticresidues: returns a list of the possible quadratic residues of the integer N
-
quotient(numerator,denominato...
quotient: divides two integers, computing a quotient and remainder
-
subfactorial(N)
subfactorial: The subfactorial of an integer (or integers) N, known as !N
-
totient(N)
vpi/totient: the number of positive integers less than N that are coprime to N
-
vpi(N)
vpi: Creator function for a variable precision integer
-
View all files
from
Variable Precision Integer Arithmetic
by John D'Errico
Arithmetic with integers of fully arbitrary size. Arrays and vectors of vpi numbers are supported.
|
| quadraticresidues(N) |
function residuelist = quadraticresidues(N)
% quadraticresidues: returns a list of the possible quadratic residues of the integer N
% usage: residuelist = quadraticresidues(N)
%
% arguments: (input)
% N - a scalar integer or vpi number
% N may NOT exceed 2^25 in magnitude
%
% arguments: (output)
% residuelist - numeric vector of all possible
% quadratic residues, modulo N. The list
% will be sorted in increasing order.
%
% A quadratic residue, defined by:
%
% http://en.wikipedia.org/wiki/Quadratic_residue
% http://mathworld.wolfram.com/QuadraticResidue.html
%
% is an integer q such that q == mod(x^2,N), for SOME
% integer x. In general, for a prime number N, there
% will be ceil((N+1)/2) quadratic residues.
%
% For example, when N = 5, there are 3 distinct
% possible quadratic residues, [0 1 4].
%
% quadraticresidues(5)
% ans =
% 0 1 4
%
% See also: mod, rem, power, factor
%
% Author: John D'Errico
% e-mail: woodchips@rochester.rr.com
% Release: 1.0
% Release date: 2/9/09
if nargin~=1
error('Must have exactly one argument')
end
% can be no larger than 2^25
if abs(N) > (2^25)
error('N may be no larger than 2^25')
end
% since it is known to be less than 2^25
if isa(N,'vpi')
N = double(N);
end
residuelist = unique(mod((0:(abs(N)/2)).^2,N));
|
|
Contact us at files@mathworks.com