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.
|
| quotient(numerator,denominator) |
function [Q,R] = quotient(numerator,denominator)
% quotient: divides two integers, computing a quotient and remainder
% usage: [Q,R] = quotient(numerator,denominator);
%
% quotient is used by the rdivide and rem functions.
% When numerator and/or demonimator represent negative
% numbers, then the quotient and remainders will be
% consistent with the signs that / and rem would return.
%
% Specifically, when numerator and denominator have
% signs as given below, then Q and R will behave as
% given by this table:
%
% num, den, Q, R
% >0 >0 >0 >0
% >0 <0 <0 >0
% <0 >0 <0 <0
% <0 <0 >0 <0
%
% Quotient supports vector or array inputs, although
% the vpi version does not do so at this time.
%
% arguments: (input)
% numerator,denominator - integer scalar numeric variables
%
% arguments: (output)
% Q,R - integers such that numerator = Q*denominator + R
% R has the property that it will be smaller
% in magnitude than numerator.
%
% Example:
%
%
% See also: vpi/quotient, rem, mod, rdivide
%
%
% Author: John D'Errico
% e-mail: woodchips@rochester.rr.com
% Release: 1.0
% Release date: 2/25/09
if nargin ~= 2
error('Both a numerator and denominator must be supplied')
end
maxint = 2^53 - 1;
% can we represent numerator as a double?
if any(abs(numerator(:))>maxint) || any(abs(denominator(:))>maxint)
error('Numbers too large, exact computation impossible. Convert to vpi form first')
end
% is the denominator zero?
if denominator == 0
error('Divide by zero')
end
% use matlab's divide operator.
Q = fix(numerator./denominator);
R = numerator - Q.*denominator;
|
|
Contact us at files@mathworks.com