Code for integer partitioning

Documentation for package ‘rpartitions’ version 0.1

rpartitions-package	rpartitions
bottom_up	Bottom up method of generating uniform random partitions of Q having N parts.
conjugate	Find the conjugate of an integer partition Recoded (orginally on 24-Apr-2013) from the Sage source code: http://www.sagenb.org/src/combinat/partition.py
divide_and_conquer	Divide and conquer method of generating uniform random partitions of Q having N parts.
get_multiplicity	Find the number of times a value k occurs in a partition that is being generated at random by the multiplicity() function. The resulting multiplicity is then passed back to the multiplicity() function along with an updated value of count and an updated dictionary D
get_rand_int	Generate a random integer between two integers
last	Returns the last element of a vector
multiplicity	multiplicity method of generating uniform random partitions of Q having N parts.
NrParts	Find the number of partitions for a given total Q and number of parts N.
P	Number of partitions of Q with k or less parts.
rand_partitions	Generate uniform random partitions of Q having N parts.
rpartitions	rpartitions
top_down	Top down method of generating uniform random partitions of Q having N parts.