Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.math

Topic: Matheology § 253
Replies: 30   Last Post: Apr 22, 2013 2:44 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
mueckenh@rz.fh-augsburg.de

Posts: 16,178
Registered: 1/29/05
Re: Matheology § 253
Posted: Apr 21, 2013 10:13 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

On 19 Apr., 22:50, Virgil <vir...@ligriv.com> wrote:

> > There exist m, n, a, b in |N,
> > such that m is in FISON(a) and not in FISON(b) and n is in FISON(b)
> > and not in FISON(a).

>
> For each natural n in |N, FISON(n) is defined by WM to be the set of all
> naturals less than or equal to the natural number n.
> Thus for natural numbers m ands n,
> n is in FISON(m)  if and only if  n <= m, and
> similarly n is NOT in FISON(m)  if and only if  m < n.
> Thus if m is in FISON(a) and not in FISON(b), then b < m <= a
> and if n is in FISON(b) and not in FISON(a), then a < n <= b
>
> Thus in WM's world one must have b < a and a < b simultaneously.


Explain how N elements (n) can be distributed, with repetition, among
M sets (s_k) such that there are all elements n represented at least
once, all s_k are used too, but not all elements n are in in one set
s_k. Is it possible to avoid the condition:
exist j, k, m, n : m e s_j & ~(m e s_k) & ~(n e s_j) & n e s_k"
?

How?

Regards, WM



Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.