On 19/09/16 02:45, James A. Donald wrote:
On 9/12/2016 8:01 PM, Georgi Guninski wrote:
On Mon, Sep 12, 2016 at 07:50:50PM +1000, James A. Donald wrote:
To restate the problem: Find a mapping between integers and injective
functions from N to X up to a permutation of N.
In this case, find a ma
On 9/12/2016 8:01 PM, Georgi Guninski wrote:
On Mon, Sep 12, 2016 at 07:50:50PM +1000, James A. Donald wrote:
To restate the problem: Find a mapping between integers and injective
functions from N to X up to a permutation of N.
In this case, find a mapping between integers and an injective fun
On 12/09/16 11:24, Peter Fairbrother wrote:
On 12/09/16 02:09, James A. Donald wrote:
I need to be able to do two of the following three tasks.
Generate a permutation of eighteen ones and eighteen zeros with equal
probability for each permutation. Or equivalently shuffle eighteen
black cards a
On 12/09/16 11:24, Peter Fairbrother wrote:
On 12/09/16 02:09, James A. Donald wrote:
I need to be able to do two of the following three tasks.
Generate a permutation of eighteen ones and eighteen zeros with equal
probability for each permutation. Or equivalently shuffle eighteen
black cards a
On 12/09/16 02:09, James A. Donald wrote:
I need to be able to do two of the following three tasks.
Generate a permutation of eighteen ones and eighteen zeros with equal
probability for each permutation. Or equivalently shuffle eighteen
black cards and eighteen red cards.
Sequentially generate
On Mon, Sep 12, 2016 at 07:50:50PM +1000, James A. Donald wrote:
> To restate the problem: Find a mapping between integers and injective
> functions from N to X up to a permutation of N.
>
> In this case, find a mapping between integers and an injective functions
> from 18 to 36.
Sage (open sour
To restate the problem: Find a mapping between integers and injective
functions from N to X up to a permutation of N.
In this case, find a mapping between integers and an injective functions
from 18 to 36.
On 9/12/2016 12:09 PM, Mark Steward wrote:
And the wikipedia page
https://en.wikipedia.org/wiki/Combinatorial_number_system.
Again, unique and distinct elements. My problem is interchangeable
elements.
On 9/12/2016 11:52 AM, stef wrote:
On Mon, Sep 12, 2016 at 11:09:06AM +1000, James A. Donald wrote:
I need to be able to do two of the following three tasks.
Generate a permutation of eighteen ones and eighteen zeros with equal
probability for each permutation. Or equivalently shuffle eighteen
https://en.wikipedia.org/wiki/Linear-feedback_shift_register
"In computing, a linear-feedback shift register (LFSR) is a shift register
whose input bit is a linear function of its previous state.The most commonly
used linear function of single bits is exclusive-or (XOR). Thus, an LFSR is
most of
And the wikipedia page
https://en.wikipedia.org/wiki/Combinatorial_number_system.
If you want some more theoretical stuff, Knuth has a chapter about
combinations that's easily googleable.
Mark
On 12 Sep 2016 03:01, "stef" wrote:
> On Mon, Sep 12, 2016 at 11:09:06AM +1000, James A. Donald wrote
On Mon, Sep 12, 2016 at 11:09:06AM +1000, James A. Donald wrote:
> I need to be able to do two of the following three tasks.
>
> Generate a permutation of eighteen ones and eighteen zeros with equal
> probability for each permutation. Or equivalently shuffle eighteen black
> cards and eighteen re
12 matches
Mail list logo
