: [Jprogramming] Morning Mystery
The gerund form is very elegant for repeated fractions …
1%2+3%4+5%6+7%8+9
0.38057
n=:>:i.9
%`+/n
0.38057
> On 26 Feb 2016, at 5:35 PM, Linda A Alvord wrote:
>
> From these versions, can any be adjusted to apply to other continued fraction
> lik
essage-
> From: Programming [mailto:programming-boun...@forums.jsoftware.com] On Behalf
> Of Raul Miller
> Sent: Thursday, February 25, 2016 10:09 PM
> To: Programming forum
> Subject: Re: [Jprogramming] Morning Mystery
>
> You can put spaces, or [ or ] between those dig
7;
7
Linda
-Original Message-
From: Programming [mailto:programming-boun...@forums.jsoftware.com] On Behalf
Of Raul Miller
Sent: Thursday, February 25, 2016 10:09 PM
To: Programming forum
Subject: Re: [Jprogramming] Morning Mystery
You can put spaces, or [ or ] between those digits,
ad a "creative solution". Yours is another.
>
> Linda
>
> -Original Message-
> From: Programming [mailto:programming-boun...@forums.jsoftware.com] On Behalf
> Of Raul Miller
> Sent: Thursday, February 25, 2016 6:07 PM
> To: Programming forum
> Subject: Re: [
ubject: Re: [Jprogramming] Morning Mystery
If the expression needs to use all nine digits:
2%1+%:5[346789
(Note that Linda did not ask for any 0s).
--
Raul
On Thu, Feb 25, 2016 at 5:58 PM, Michal Wallace
wrote:
> Using all 10:
>
> %(4 3 0 8 1,(7+9))(p. % 6 ^~ ]) 2*5
>
> On
16 5:58 PM
To: programm...@jsoftware.com
Subject: Re: [Jprogramming] Morning Mystery
Using all 10:
%(4 3 0 8 1,(7+9))(p. % 6 ^~ ]) 2*5
On Thu, Feb 25, 2016 at 2:09 PM, Philip Hunt wrote:
> Like it Peter
>
> there are so many great formulae for phi...
>
> 2*1&o.o.1r10
> 0
1+%5
7
%`+/(5*6)#1 NB. Linda Alvord
0.618034
$":%`+/(5*6)#1
8
Linda
-Original Message-
From: Programming [mailto:programming-boun...@forums.jsoftware.com] On Behalf
Of David Lambert
Sent: Thursday, February 25, 2016 7:34 AM
To: programm...@jsoftware.com
Subject: Re: [Jprogra
;>
>>>> 22 characters excluding the comment
>>>> (but then four numbers are missing)
>>>>
>>>> Ben
>>>>
>>>> From: Programming [programming-boun...@forums.jsoftware.com] on
the comment
>>> (but then four numbers are missing)
>>>
>>> Ben
>>>
>>> From: Programming [programming-boun...@forums.jsoftware.com] on behalf
>>> of Linda A Alvord [lindaalv...@verizon.net]
>>>
missing)
Ben
From: Programming [programming-boun...@forums.jsoftware.com] on
behalf of Linda A Alvord [lindaalv...@verizon.net]
Sent: Thursday, February 25, 2016 08:49
To: programm...@jsoftware.com
Subject: [Jprogramming] Morning Mystery
Using only the single d
...@jsoftware.com
Subject: [Jprogramming] Morning Mystery
Using only the single digit counting numbers:
>:i.9
1 2 3 4 5 6 7 8 9
write the shortest possible expression to produce:
0.618034
Linxa
l
--
For informat
;
To:
Subject: [Jprogramming] Morning Mystery
Message-ID: <01d16fa1$1f8ac160$5ea04420$@net>
Content-Type: text/plain; charset="us-ascii"
Using only the single digit counting numbers:
>:i.9
1 2 3 4 5 6 7 8 9
write the shortest possible expression to pro
ehalf of
>> Linda A Alvord [lindaalv...@verizon.net]
>> Sent: Thursday, February 25, 2016 08:49
>> To: programm...@jsoftware.com
>> Subject: [Jprogramming] Morning Mystery
>>
>> Using only the single digit counting numbers:
>>
>>
>&g
n.net]
> Sent: Thursday, February 25, 2016 08:49
> To: programm...@jsoftware.com
> Subject: [Jprogramming] Morning Mystery
>
> Using only the single digit counting numbers:
>
>
>
>>:i.9
>
> 1 2 3 4 5 6 7 8 9
>
>
>
> write t
Alvord [lindaalv...@verizon.net]
Sent: Thursday, February 25, 2016 08:49
To: programm...@jsoftware.com
Subject: [Jprogramming] Morning Mystery
Using only the single digit counting numbers:
>:i.9
1 2 3 4 5 6 7 8 9
write the shortest possible expression to produce:
0.618034
Linxa
Using only the single digit counting numbers:
>:i.9
1 2 3 4 5 6 7 8 9
write the shortest possible expression to produce:
0.618034
Linxa
l
--
For information about J forums see http://www.jsoftware.com/fo
16 matches
Mail list logo
