Let us add another twist, courtesy of David Lambert, to the Exercise 1:
Produce a variant of a1, say a1x0 without involving either @. or `:6
such that for arbitrary but specific u and N,
( (u a1)N ) -: ( (u a1x0)N ),
for example,
* a1x0 2 3 5 7
14
(1 + %) a1x0 3 5 7 9
1.33333333
Clarification (just in case): No one is recommending to use any solutions
for a1x0 vs other solutions for a1; this is meant to be a puzzle.
P.S. Remember to show spoiler alerts. It is ease to forget; believe me, I
know :)
On Tue, Mar 15, 2016 at 6:32 PM, Jose Mario Quintana <
[email protected]> wrote:
> Right, so let us add a twist to the Exercise 1:
>
> Minor alert for anyone that have not seen Pascal's solution for a1...
>
> 7
> 6
> 5
> 4
> 3
> 2
> 1
> 0
>
> Produce a1 without involving @. in the code.
>
> Remember: "Spoiler alerts by instructors and patrons will be appreciated."
>
>
>
> On Mon, Mar 14, 2016 at 3:43 PM, <[email protected]> wrote:
>
>> Pascal Jasmin wrote:
>> > a0 =:
>> > a1 =:
>>
>> You are confusing the Jym with the Spoilarium, I'm afraid.
>>
>> Martin Neitzel
>> ----------------------------------------------------------------------
>> For information about J forums see http://www.jsoftware.com/forums.htm
>>
>
>
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
