Path: csiph.com!news.swapon.de!eternal-september.org!feeder.eternal-september.org!mx02.eternal-september.org!.POSTED!not-for-mail
From: Duncan Idaho <duncan@dunenoemail.com>
Newsgroups: comp.lang.java.programmer
Subject: Re: Mathematics, Java, good enough
Date: Tue, 17 May 2016 18:15:36 +0100
Organization: A noiseless patient Spider
Lines: 30
Message-ID: <nhfjd2$6da$1@dont-email.me>
References: <nhesp7$hn7$1@dont-email.me> <words-20160517152443@ram.dialup.fu-berlin.de>
Mime-Version: 1.0
Content-Type: text/plain; charset=ISO-8859-1; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Tue, 17 May 2016 17:12:02 -0000 (UTC)
Injection-Info: mx02.eternal-september.org; posting-host="5b04f7a4689ff95db8587c13f9721cc1"; logging-data="6570"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1/9S/LnDpjclG5fV0+puz8ZneI6Nr8t/g0="
User-Agent: Mozilla/5.0 (X11; Linux x86_64; rv:17.0) Gecko/20130308 Thunderbird/17.0.4
In-Reply-To: <words-20160517152443@ram.dialup.fu-berlin.de>
Cancel-Lock: sha1:NCJGkAnu5qeEjK19P+/7abTpa1o=
Xref: csiph.com comp.lang.java.programmer:34326

On 17/05/16 15:43, Stefan Ram wrote:
> Duncan Idaho <duncan@dunenoemail.com> writes:
>> how many strings of length L are possible from
> ...
>> a set of characters S of cardinality C
>
>    If an alphabet has C members, there are C^L words of length
>    L over it, because for every word position, there are C choices,
>    and the choices of positions multiply as one can easily see.
>
>    For example, an octet of bit memory cells has java.lang.Math.pow
>    ( 2, 8 ) possible states. A UHD screen with 24 bits of color can
>    show java.math.BigInteger.valueOf( 2<<23 ).pow( 7680 * 4320 )
>    different pictures.

hmm

That last one was too easy for you guys obviously :-)

So what if I said how many *sets* of cardinality C are there in a set S of cardinality SC

Example
so where C = 8 then "ABCDEFGH" is good but "AABCDEFG" isn't

Idaho


-- 
Duncan Idaho
!(ghola mentat)