Re: Real world issue:- OT recreational interval
Date: 18 Sep 2006 16:54:32 -0700
Message-ID: <1158623672.634069.49580_at_e3g2000cwe.googlegroups.com>
kvnkrkptrck_at_gmail.com ha scritto:
> If it's not fear, then what is it? Pride? Lack of intelligence?
I repeat this for the last time
(1) Consider n=2, (n is the number of operands),
what is count distinct of { 3 , 3 } ?
(2) Answer 1. Agree ? If yes proceed.
So. Does Count Distinct satisfy this definition:
(3) A binary function f ( x , y ) is called idempotent
if for all x ,
f ( x , x ) = x ?
(4) count distinct of { 3 , 3 } = 1, which is different from 3.
It doesn't.
(5) So, for n=2 Count Distinct is NOT idempotent
Tell me the precise statement which is wrong and prove that it is wrong. Show me your intelligence.
-P Received on Tue Sep 19 2006 - 01:54:32 CEST