I meant that there can only be one value that a-:$a . Therefore, there can not be a solution to the specified conditions, since the conditions on a requires that a be ,1 and the conditions on b requires that b be ,1 .
----- Original Message ----- From: Roger Hui <[email protected]> Date: Thursday, April 2, 2009 10:15 Subject: Re: [Jprogramming] trivial reshaping question To: Programming forum <[email protected]> > Since a-:$a and $a is a vector, a must be a vector. > If a is a vector, $a has one-element, so a must be > a one-element vector, so $a must be ,1 . Since > (again) a-:$a, that means a must be ,1. > > There can only be one such value. > > > > ----- Original Message ----- > From: Raul Miller <[email protected]> > Date: Thursday, April 2, 2009 9:56 > Subject: Re: [Jprogramming] trivial reshaping question > To: Programming forum <[email protected]> > > > A related question is: > > > > How many different values can there be, in J, where the value > of its > > shape matches the value itself? > > > > For example, can you have > > > > A -: B > > 0 > > A -: $A > > 1 > > B -: $B > > 1 > > > > Why, or why not? ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
