[Jprogramming] Boxing words

[Jimmy Gauvin]

The outermost pair of quotes are enclosing the inner pairs.

So you count the pairs and subtract one.

The formula below gives the table but builds it the other way around.

It calculates how many pairs are needed to produce n quotes.


 (,.~+:&>:)i.10

2 0

4 1

6 2

8 3

10 4

12 5

14 6

16 7

18 8

20 9



On Sat, Dec 30, 2017 at 3:21 AM, Linda Alvord <lindaalvord36 at outlook.com>
wrote:

> Thanks for all the help on explaining T and U.
>
> Here is my next question:
>
> ]V=:((i.8) >:/4#i.8){' '''
> ''''
> ''''''''
> ''''''''''''
> ''''''''''''''''
> ''''''''''''''''''''
> ''''''''''''''''''''''''
> ''''''''''''''''''''''''''''
> ''''''''''''''''''''''''''''''''
>    "."1 V
> '
> '''
> '''''
> '''''''
> '''''''''
> '''''''''''
> '''''''''''''
> '''''''''''''''
>
> If f0ur quotes executes to one quote. Why do 8 quotes execute as 3 quotes?
>
> Linda
>
>