In article <8tMdk.2$Ek.1@[EMAIL PROTECTED]
>, Jack <jj@[EMAIL PROTECTED]
> wrote:
For completeness:
Call an _H-Gram_ a 5-tuple H = (L, R, u, v, w) where L and R are sets
and u, v and w are functions; u : L -> |N; v : R -> |N ;
w : L x R -> |N.
> I have got two definitions of t;
That is forbidden.
> the first I fix with the definition 'let t
> : N ---> N be arbitrary'.
That doesn't "fix" t at all - quite the opposite.
How about if I choose t(n) = 0 for all n in |N?
> In the second, I have t as the number of primes in
> a set J that divide n.
I'm stuck already. To use my definition, you _must_ tell me L ( a set
of primes?), R ( an interval? |N?), u, v and w ( the first two the
identities?, the third??).
Are you now after (two?) _new_ functions (other than u, v and w)? For
the same H-Gram or two different ones?
--
Paul Sperry
Columbia, SC (USA)


|