The standard approach to get rational approximations to irrational numbers is
that of continued fractions.
Den 0:23 torsdag den 10. marts 2016 skrev Mike Day
:
I'm not at all sure that you'll find this relevant, but here goes,
anyway:
I recently solved Euler problem 541 which conc
Thanks Roger! On https://en.wikipedia.org/wiki/Talk:Exponentiation 0^0 is
discussed. I need all the help I can get. Your information is very welcome.
Thank you! Bo.
Den 21:30 fredag den 17. januar 2014 skrev Roger Hui
:
BTW, Knuth did something else which typifies APL thinking. In a not
Thanks for the http://www.jsoftware.com/jwiki/Vocabulary/zeroco . I have
trouble in understanding the example
0 1} i.6 NB. Try to amend 1{i.6 to zero |rank error | 0 1}i.6 0 1:}
i.6 0 0 2 3 4 5
Is there a typo in the comment? ('{' versus '}')
I thought that 0 1:} is a fork, but is
Congratulations! J is a wonderful notation! I am a big fan. Thanks. Bo.
Den 21:42 onsdag den 5. februar 2014 skrev Eric Iverson
:
Jsoftware incorporated in Feb 1990 and Feb 2015 will be 25 years!
>
>J 2014 conference is smack-dab in the middle of our 25th year!
>
>Please join with others fr
Learning a little J is fast, and is worth while. I like this example
exxplaining addition.
7#1
1 1 1 1 1 1 1
14#1
1 1 1 1 1 1 1 1 1 1 1 1 1 1
(7#1),(14#1)
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
#(7#1),(14#1)
21
7+14
21
Learning more J is still worth while.
Den 13:37 søndag
Use a hook to save a little writing
(+1.05&*)/\.(10#_1000),1
3711.05 4486.72 5225.45 5929 6599.04 7237.18 7844.94 8423.75 8975 9500 1
Den 20:16 søndag den 16. februar 2014 skrev Raul Miller :
Here's another way of seeing those balances at the end of each year. Note
>that it fol
The plussign (+) works for (1 + 1); (1 + 1 2); (1 2 + 1 2); (1 2 3 +/ 1 2 3)
The latter (+/) produces a table.
The operation (o=.3-3|+) works for (1 o 1); (1 o 1 2); (1 2 o 1 2); (1 2 3 o/ 1
2 3)
But (o/) did not produce a table.
The workaround is (1 2 3(3-3|+/)1 2 3) with the slash inside.
I
([:<:}.%}:)i.10
_ 1 0.5 0.33 0.25 0.2 0.17 0.142857 0.125
But you probably do not want the shorter solution, but the more transparent one.
Den 12:31 mandag den 17. februar 2014 skrev Joe Bogner :
>From the J in 5 minutes thread, I'm starting to build my example
>
>In my example, I
element.
>using o"0/ instead does work as you want.
>
>Kind regards,
>Jan-Pieter
>
>
>
>2014-02-17 12:33 GMT+01:00 Bo Jacoby :
>
>> The plussign (+) works for (1 + 1); (1 + 1 2); (1 2 + 1 2); (1 2 3 +/ 1 2
>> 3)
>> The latter (+/) produces a table.
&
<:2%~/\i.10
this also does the trick.
Den 12:49 mandag den 17. februar 2014 skrev Bo Jacoby :
([:<:}.%}:)i.10
>_ 1 0.5 0.33 0.25 0.2 0.17 0.142857 0.125
>But you probably do not want the shorter solution, but the more transparent
>one.
>
>
>
>
>De
I looked at the video and turned the English subtext on. That is a good way of
checking your pronounciation.
Den 19:53 mandag den 17. februar 2014 skrev Pascal Jasmin
:
Good video. Thank Joe.
>
>Some suggestions:
>
>Quotes =: quote each
>
>'DAL UAL =: Quotes 'DAL';'UAL'
>
>You did a good j
{.>{:p. 1 1 _1
1.61803
Den 20:52 søndag den 23. februar 2014 skrev Don Guinn :
(2 %~ 1+%: 5)-:^.5
>
>0
>
>
>On Sun, Feb 23, 2014 at 12:50 PM, Nimp O wrote:
>
>> > From: k...@math.uh.edu
>> > Date: Sun, 23 Feb 2014 06:20:58 -0600
>> > To: programm...@jsoftware.com
>> > Subject: Re: [J
collatz=:-:&(+2&|*>:&+:)
collatz ^:(i.10)17
17 26 13 20 10 5 8 4 2 1
Den 20:15 mandag den 3. marts 2014 skrev Raul Miller :
Er... actually you only had one other question to be answered. Oops.
>
>Thanks,
>
>--
>Raul
>
>
>
>On Mon, Mar 3, 2014 at 2:13 PM, Raul Miller wrote:
>> Answe
gt; >
>> > (Hopefully you do not consider this approach to be too tedious - or, if
>> so,
>> > hopefully you skipped down to the end and then read the last couple
>> > paragraphs.)
>> >
>> > Thanks,
>> >
>> > --
>> > Raul
>>
That makes sense!. Thanks.
Den 23:09 onsdag den 5. marts 2014 skrev Pascal Jasmin :
I assume the main motivation for the feature is ^:(<_)
>
>
>- Original Message -----
>From: Bo Jacoby
>To: "programm...@jsoftware.com"
>Cc:
>Sent: Wednesday, Mar
Yes, impressive. But as usual the part that I could not follow just told me
that even if the author can do it easily, I can't. I have been a newbee on J
for some years, but a lot of it I still don't master. I still use J602 because
I didn't manage to make the later versions run.
I love short
>:@*/%>:i.20
2.71828
This speeds up the series.
Den 7:11 tirsdag den 11. marts 2014 skrev Roger Hui :
> If I have 32-bit numbers, when does this information become fiction.
>> Also how can I get the best possible and correct decimal approximation
>> from these rational numbers?
>
>32-bits
'Whet you appetite' should perhaps be 'Wet your appetite'?
Den 10:26 torsdag den 13. marts 2014 skrev Martin Saurer
:
Hello all,
>
>Many thanks for all the feedback and suggestions. Based upon your
>feedback, there are three new videos which hopefully are better than
>"Version 1.0".
>
>1. V
Thank you Devon!
Den 14:04 torsdag den 13. marts 2014 skrev Devon McCormick :
"Whet your appetite" would be idiomatic English. A whetstone is a stone
>one uses for sharpening knives.
>
>
>On Thu, Mar 13, 2014 at 5:31 AM, Bo Jacoby wrote:
>
>> 'Whet
ns 'hviske',
'whistle' means 'hvisle', 'white' means 'hvid', 'who' means 'hvo', 'whom' means
'hvem', 'whose' means 'hvis'.
Den 14:39 torsdag den 13. marts 2014 skrev Björn Helgason :
"his table on page 105 looks interesting. I wonder what is the shortest J
expression that can reproduce it"
This one may not be the shortest, but it works:
n!"1 n+/n=.i.11
Den 0:07 fredag den 28. marts 2014 skrev Jose Mario Quintana
:
Was Wallis himself the first to assume x^0 =1
uot;1 +/~) i.11
>>
>>
>>
>> - Original Message -
>> From: Bo Jacoby
>> To: "programm...@jsoftware.com"
>> Cc:
>> Sent: Friday, March 28, 2014 3:23:06 AM
>> Subject: Re: [Jprogramming] Applied APL - How to think like an APL
>&
You know how to compute the probability
(r,p)NB y
that the negatively binomially distributed variable assumes the nonnegative
integer value y , then compute the probability that it is less than or equal
to, say, i.100
n=:+/\(r,p)NB i.100
A random number between 0 and 1
?0
is grea
Bonus-bonus question. Time reversal of the problem: The fly is stuck between
the two trains standing still on the track when suddenly the trains move apart
(with the speeds from before) and the fly flies between them (as before). What
is the position of the fly when the trains have returned to t
f=:(];.0~,:)~
3 4 f 'abcdefghijk'
defg
Note that
,:3 4
3 4
$,:3 4
1 2
Den 3:01 fredag den 11. april 2014 skrev Henry Rich :
Can anyone explain why
> (,:3 4) ];.0 'abcdefghijklmnop'
>defg
>
>works?
>
>According to Ye Dic, 0{x gives the starting point, and 1{x gives t
Try this:
plot 4%~(,j.)_8 8 j./~ i: 8
Den 4:26 lørdag den 19. april 2014 skrev Linda Alvord :
I would like to create ¼” graph paper with both scales from _2 to 2 . I
>can’t get vertical lines.
>
>
>
>Here are two horizontal lines:
>
>
>
>load ‘plot’
>
>Plot 2 2$2 2 _2 _2
>
>
>
>NB.
Try this:
l=. 13 : '(<:y)%^.y'
lm=. 13 : 'y*l x%y' f. NB. logarithmic mean
lm
] * [: (<: % ^.) %
3 lm 3.02
3
3 lm 3.2
3.1
Thanks. Bo.
Den 2:04 mandag den 21. april 2014 skrev Raul Miller :
On Sun, Apr 20, 2014 at 7:08 PM, Henry Rich wrote:
>> More exact equality is
([: | -) % [: | ([: ^. [) - [: ^. ]
>
> Now this agrees with Bo's shorter version..
>
>Linda
>
>-Original Message-
>From: programming-boun...@forums.jsoftware.com
>[mailto:programming-boun...@forums.jsoftware.com] On Behalf Of Bo Jacoby
>Sent: Monday, April
some cleveer
>ways of simplifying the expression. I liked how you Went outside the
>parentheses or were "thinking outside the box"
>
>Linda
>
>
>-Original Message-
>From: programming-boun...@forums.jsoftware.com
>[mailto:programming-boun...@forums.j
>Linda
>
>-Original Message-
>From: programming-boun...@forums.jsoftware.com
>[mailto:programming-boun...@forums.jsoftware.com] On Behalf Of Bo Jacoby
>Sent: Tuesday, April 22, 2014 2:47 AM
>To: programm...@jsoftware.com
>Subject: Re: [Jprogramming] Logarithmic Mean
>
+/(* %.) 2 3 4
1
(% %.) 2 3 4
29 29 29
This gives me enough information to understand what monadic %. did.
Den 21:20 onsdag den 23. april 2014 skrev Raul Miller :
To my knowledge, J602 is still the best place for labs.
>
>To fix that, I imagine we need some people (who have experience
Blueberry porridge is called blåbærgrød in Danish. Just one word. The Danish
alphabet contains the extra vowels æ, ø, and å. The word
k=.'blåbærgrød'
contains ten letters, like this:
#k
13
No, # didn't work.
The words
;:'danish blueberry porridge'
┌──┬─┬
Hui's svar
>
> Fra: Roger Hui
>Til: programm...@jsoftware.com
>Sendt: 20:20 lørdag den 20. oktober 2012
>Emne: Re: [Jprogramming] danish blueberry porridge
>
>It's in the dictionary entry for ;:
>http://www.jsoftware.com/help/dictionary/d332.htm
>
>
>
>On Fri,
Sorry, the below communication was a mistake.
- Bo
>
> Fra: Bo Jacoby
>Til: "programm...@jsoftware.com"
>Sendt: 20:30 lørdag den 20. oktober 2012
>Emne: Re: [Jprogramming] danish blueberr
t k
>> +-+
>> |blåbærgrød|
>> +-+
>> k=.'blåbærgrød blåbærgrød'
>> t k
>> +-+-+
>> |blåbærgrød|blåbærgrød|
>> +-+
Mike Day wrote 10:39 torsdag den 1. november 2012:
OK - sorry, it's nothing to do with unicode etc.. Our Danish hosts
some years ago amused themselves and us with our attempted pronunciation of
"rødgrød med fløde" Mike
Yes, Danish 'rødgrød med fløde' (stewed redcurrants and strawberri
Hi Mike
You request comments regarding style. Style is a matter of taste, so don't take
my comments as criticism.
Your very first expression
(n%2)>(]?]) n$d
can be written without division:
n>+:(?])n#dThe value depends on two variable, n and d, and so you may create
a dyadic verb, focus
Michal D. wrote: "I'm not sure why to prefer
doubling an entire array as opposed to dividing a single scalar?"
Doubling an integer provides an integer, while division transcends the realm of
integers. That's why. - Bo
--
For
Linda, stick to integer arithmetic:
5 (0=[:?~#) 8
0 0 0 0 0 0 1 0
1 0 0 0 0 0 0 0
0 0 1 0 0 0 0 0
0 0 0 1 0 0 0 0
0 0 0 0 0 1 0 0
- Bo
>
> Fra: Linda Alvord
>Til: programm...@jsoftware.com
>Sendt: 10:10 torsdag den 8. november 2012
>Emne: Re: [Jprogramming]
3 items from i. 6 without replacement.
>>>
>>> 3 3 ?/ 6 6 6 6
>>> 5 0 2
>>> 3 5 0
>>> 1 4 5
>>> 1 0 3
>>>
>>> 0 3 2
>>> 0 5 2
>>> 1 2 4
>>> 3 0 1
>>>
>
The unit matrix is
=/~i.5
1 0 0 0 0
0 1 0 0 0
0 0 1 0 0
0 0 0 1 0
0 0 0 0 1
- Bo
>
> Fra: Don & Cathy Kelly
>Til: programm...@jsoftware.com
>Sendt: 0:47 tirsdag den 20. november 2012
>Emne: Re: [Jprogramming] Verb definition + inadvertent train formation.
n formation.
>
>Yes and I think I prefer that formulation however monadic = works too:
> = i.5
>1 0 0 0 0
>0 1 0 0 0
>0 0 1 0 0
>0 0 0 1 0
>0 0 0 0 1
>
>On Tue, Nov 20, 2012 at 6:01 PM, Bo Jacoby wrote:
>> The unit matrix is
>> =/~i.5
>> 1 0
Dear J'ers.
At the Norddata conference in Göteborg in the summer 1989 I gave a lecture (in
Danish) on Ultraflexible Database Structure and Artificial Catholicism.
It contained this 8-liner in BASIC.
1 INPUT;C$: IF C$="" THEN END
2 OPEN "CREDO" FOR INPUT AS 1: PRINT":";
3 IF EOF(1) THEN CLOSE:
key idea.
>
> 'key val'=: <"1 |: >({. , ([,' ',])&.>/@:}.)@:(' '&cut) each LF cut
>1!:1 search=:*./@(+./)@( [ (= , '0'&=@,: ) ({.~ #)~ )
> val#~key search every < '13522' NB. query for 13522
>
General
>
>On 11/28/2012 2:49 AM, Bo Jacoby wrote:
>> Thank you very much, June and Raul!
>> The blank lines in the file should not be there. (They were invisible until
>> the mail was sent.)
>> A line number ends when a nondigit character is encountered, and line
page you can download.
>
>I haven't attempted to replicate BASIC's itty-bitty I/O, all mixed-up
>in the processing. As well write a mini interpreter in J and get it to
>run the BASIC code!
>
>Instead I've intuited the algorithm and done it as a J-er would.
>Might.
&
>sense. I guessed that it was a way of representing a tree as a single
>integer. Such a domain would have interesting mathematical
properties,
>and a J library to handle it would have its uses, given the lack of an
>agreed "natural" way of handling trees in J, as opposed to Python
here are
>metro systems running on Zadeh's Fuzzy Logic. To the numerous people
>who hate it, one just has to ask: do the trains get to their
>destinations or don't they?
>
>Ian
>
>On Thu, Nov 29, 2012 at 5:28 PM, Bo Jacoby wrote:
>> Ian,
>>
>> Note th
agree on the results for 0 and 00
>
> pray 0
>CREDO CONFITEOR ET EXPECTO AMEN
> pray 00
>CREDO CONFITEOR ET EXPECTO AMEN
>
>Linda
>
>-Original Message-
>From: programming-boun...@forums.jsoftware.com
>[mailto:programming-boun...@forums.jsoftware.co
idea.
>>
>> 'key val'=: <"1 |: >({. , ([,' ',])&.>/@:}.)@:(' '&cut) each LF cut
>> 1!:1> search=:*./@(+./)@( [ (= , '0'&=@,: ) ({.~ #)~ )
>> val#~key search every < '13522' NB.
J is a rich language, and it might be a good idea to define an elementary
subset for beginners. J is a nice calculator for elementary computations. You
can do a lot of computing without knowing anything about binomial coefficients
and taylor expansions and capped forks. If you need to understand
_
> Fra: Aai
>Til: programm...@jsoftware.com
>Sendt: 15:21 fredag den 30. november 2012
>Emne: Re: [Jprogramming] Translating BASIC into J
>
>Hi Bo, you need to feed the animal, e.g.
>
>DB=: 0 :0
>1 CREDO
>11 IN
>111 UNUM
>...
>)
>
>and the
[ (= , '0'&=@,: )({.~ #)~ )
>>
>>
>> examples (not thoroughly tested):
>>
>> ;: inv v#~k search every < '13521'
>>
>> CREDO IN SPIRITUM QUI CUM PATRE GLORIFICATUR AMEN
>> ;: inv v#~k search every < '11&#x
amiliar with elementary
programming and arithmetic.
- Bo
>
> Fra: Alex Giannakopoulos
>Til: programm...@jsoftware.com
>Sendt: 5:14 lørdag den 1. december 2012
>Emne: Re: [Jprogramming] @: and capped fork
>
>On 30 November 2012 16:17, Bo Jac
Alex Giannakopoulos wrote: "it's the *spirit* that counts."
1361: CREDO IN SPIRITUM QUI LOCUTUS EST PER PROPHETAS AMEN
- Bo
>
> Fra: Alex Giannakopoulos
>Til: programm...@jsoftware.com
>Sendt: 12:37 mandag den 3. december 2012
>Emne: Re: [Jprogramming] @: and
Dear J'ers
The Fit conjunction (!.) changes the default fill character like this
3 ({.!.'0') '11'
110
but Fit gives domain error with Open:
>'11';'111'
11
111
(>!.'0')'11';'111'
|domain error
| ( >!.'0')'11';'111'
I want this
110
111
What is the work-around?
The dictionary en
Graham and Philip.
When an engineering problem is solved on time comes a request to destroy the
solution. Don't do it. Refuse! It is bad economy. Do some explaining and
commenting, and make simplifications and improvements on the code, but don't
translate it into an inferior language. Two versio
Conventional algebraic notation is sometimes confusing. mc^2 means m*(c^2) ,
mass times light speed squared, while cm^2 means square centimeter, (c*m)^2,
rather than centi squaremeter, c*(m^2). The J convention for omitting
parentheses is better.
- Bo
>
> Fra
ørdag den 8. december 2012
>Emne: Re: [Jprogramming] J v Python
>
>On 8 December 2012 18:36, Bo Jacoby wrote:
>> Conventional algebraic notation is sometimes confusing. mc^2 means m*(c^2) ,
>> mass times light speed squared, while cm^2 means square centimeter, (c*m)^2,
>> ra
. The parentheses are omitted.
Q. 'the precedences hardly present a problem'. A. Precedences present problems
to the pupils even if it is no problem to you.
- Bo
>
> Fra: Boyko Bantchev
>Til: programm...@jsoftware.com
>Sendt: 16:21 søndag
far.'
- Bo
>
> Fra: Boyko Bantchev
>Til: programm...@jsoftware.com
>Sendt: 23:35 søndag den 9. december 2012
>Emne: Re: [Jprogramming] J v Python
>
>On 9 December 2012 23:17, Bo Jacoby wrote:
>> Still it is an expression. Centi is one hundredth, 0.01, and 'meter&#
>
> Fra: Boyko Bantchev
>Til: programm...@jsoftware.com
>Sendt: 15:02 mandag den 10. december 2012
>Emne: Re: [Jprogramming] J v Python
>
>On 10 December 2012 08:19, Bo Jacoby wrote:
>> Boyko, congratulations! You manage to convince yourself that cm² is
Linda, you wrote
f=: 13 :'{&_1 1'
but you ment to write
f=: {&_1 1
- Bo
>
> Fra: Linda Alvord
>Til: programm...@jsoftware.com
>Sendt: 11:02 tirsdag den 11. december 2012
>Emne: Re: [Jprogramming] convert 0,1 coding to _1,1
>
>u&n y is defined as y u n
>
>
How is p. implemented?
- Bo
>
> Fra: Roger Hui
>Til: Programming forum
>Sendt: 9:13 onsdag den 12. december 2012
>Emne: Re: [Jprogramming] Cool roots
>
>> ... produce more accurate results in some difficult cases.
>
> c=: p. <20$1.5
> c
>3325.26 _44336.
I reinvented the Durand-Kerner method (
http://en.wikipedia.org/wiki/Durand-Kerner_method ) in 1992. I think it cool. I
don't know if it is better or worse than p. .
- Bo
>
> Fra: John Randall
>Til: programm...@jsoftware.com
>Sendt: 18:30 onsdag den 12. d
12
>Emne: Re: [Jprogramming] Cool roots
>
>On 13 December 2012 03:23, Bo Jacoby wrote:
>> I reinvented the Durand-Kerner method (
>> http://en.wikipedia.org/wiki/Durand-Kerner_method ) in 1992. I think it
>> cool. I don't know if it is better or worse than p. .
&
next=:0 3+*&5
(next^:(i.9)) 1 0 NB. brute force solution
1 0
5 3
25 18
125 93
625 468
3125 2343
15625
11718
78125 58593
390625 292968
(,.3*4%~1-~])5^i.9 NB. closed form solution
1 0
5 3
25 18
125 93
Dear J'ers
My J programs on statistical deduction, prediction, and induction are now
pulished here:
http://en.wikipedia.org/wiki/Talk:Statistical_inference#deduction_and_induction_and_prediction
I kindly request your comments and tests and suggestions for what to do next
- Bo
ame
>category
>a deduct 10 NB. uncertain deduction in the general case
>
>-Original Message-
>From: programming-boun...@forums.jsoftware.com
>[mailto:programming-boun...@forums.jsoftware.com] On Behalf Of Bo Jacoby
>Sent: Friday, December 21, 2012 04:37
>To: progra
Thanks Brian!
You are perfectly right, / works and is nicer and shorter.
20 5 0(*`%/"2@(,: (%:@* -.))@((,: , 1"1) % +/@[))10
8 2 0
1 1 0
But J translates / into ´:3
*`%/"2@(,: (%:@* -.))@((,: , 1"1) % +/@[)
*`%`:3"2@(,: (%:@* -.))@((,: , 1"1) % +/@[)
I guess thats why, while
> 4!:0 <'s'
>3
> 4!:0 <'r'
>0
>
>The other alternative would be to turn this into a (N V V) fork by using ~
>resulting in (1 ,~ ,:) …untested.
>
>Cheers, bob
>
>On 2012-12-21, at 8:49 AM, Bo Jacoby wrote:
>
>> Thanks Brian!
>>
Yes, Brian, isn't it surprising?
a predict 100
75 21.4286 3.57143
9.09718 8.62055 3.89879
(-1+a)deduce 100
75 21.4286 3.57143
9.09718 8.62055 3.89879
(1+a)deduce 100
75 21.4286 3.57143
0j7.07107 0j6.70059 0j3.03046
a deduce 100
80 20 0
0j7.07107 0j7.0
Raul, thank you for your interest!
I don't quite understand what you are doing.
If a variable only assumes the values 0 and 1, then the mean value of that
variable is the same thing as the probability that it is =1. Otherwise there is
no mixing between probabilities and mean values.
Some
((0 3+*&5)^:30)1 0x NB. brute force solution
931322574615478515625 698491930961608886718
(,.3*4%~1-~])5^30x NB. closed form solution
931322574615478515625 698491930961608886718
Is Skip Cave saying that the closed form solution is inferior?
- Bo
>
>
Hi Skip Cave
Note that the closed form solution doesn't have to compute the intermediate
values.
ts=: (6!:2),7!:2
ts '((0 3+*&5)^:5000)1 0x' NB. brute force solution
0.244886 38848
ts '(,.3*4%~1-~])5^5000x' NB. closed form solution
0.0174891 27712
Here the closed form solution was
186728
closed 50 NB. using standard arithmetic
8.88178e34 6.66134e34
6!:2'closed 50' NB. timing
0.000110246
- Bo
Fra:Boyko Bantchev
Til: programm...@jsoftware.com
>Sendt: 14:52 søndag den 23. december 2012
>Emne: Re: [Jprogramming] arithmetic sequence
>
>On 23
Skip's conclusion did not follow from his data in the first place.
- Bo
>
> Fra: Boyko Bantchev
>Til: programm...@jsoftware.com
>Sendt: 16:44 søndag den 23. december 2012
>Emne: Re: [Jprogramming] arithmetic sequence
>
>On 23 Dece
7;
0.00487965
It cannot be concluded that 'closed' is generally slower than the brute force
computation. In the above cases 'closed' is faster.
- Bo
>
> Fra: Boyko Bantchev
>Til: programm...@jsoftware.com
>Sendt: 18:21 s
d form is not a shortcut.
- Bo
>
> Fra: Boyko Bantchev
>Til: programm...@jsoftware.com
>Sendt: 21:38 søndag den 23. december 2012
>Emne: Re: [Jprogramming] arithmetic sequence
>
>On 23 December 2012 21:21, Bo Jacoby wrote:
>> Other data giv
43e_5
>> (10) 6!:2'((0 3+*&5)^:500)1 0x'
>> 0.00487965
>>
>>
>> It cannot be concluded that 'closed' is generally slower than the brute
>> force computation. In the above cases 'closed' is faster.
>>
>>
>&g
what is your point?
- Bo
>
> Fra: Boyko Bantchev
>Til: programm...@jsoftware.com
>Sendt: 0:12 onsdag den 26. december 2012
>Emne: Re: [Jprogramming] arithmetic sequence
>
>On 25 December 2012 16:18, Bo Jacoby wrote:
>> I
mm...@jsoftware.com
>Sendt: 12:14 onsdag den 26. december 2012
>Emne: Re: [Jprogramming] arithmetic sequence
>
>On 26 December 2012 05:12, Bo Jacoby wrote:
>> what is your point?
>
>What is not clear to you?
>
>You quote some words of mine and say you disagree. Tha
s not always needed
2. The closed form solution is fast
- Bo
>
> Fra: Boyko Bantchev
>Til: programm...@jsoftware.com
>Sendt: 8:45 torsdag den 27. december 2012
>Emne: Re: [Jprogramming] arithmetic sequence
>
>On 27 December 2012 00:48, Bo Jacoby wrote:
chev
>Til: programm...@jsoftware.com
>Sendt: 12:32 fredag den 28. december 2012
>Emne: Re: [Jprogramming] arithmetic sequence
>
>On 28 December 2012 01:41, Bo Jacoby wrote:
>> To me it is not clear what the exact domain is.
>
>Then read the original post at
>http
re Multiplying complex numbes. Note that if a triangle 0,1,a is similar to
the triangle 0,b,c then c=a*b . So complex multiplication is the natural way
of expressing that the sides in similar triangles are proportional. (b%1)=(c&a)
. You only have to chose the two points 0 and 1.
- Bo
Henry, How is negative zero different from positive zero when taking the log?
^.%__ NB. log -0
__
^.%_ NB. log +0
__
- Bo
>
> Fra: Henry Rich
>Til: programm...@jsoftware.com
>Sendt: 0:38 torsdag den 17. januar 2013
>Emne: Re: [Jprogramming] Hermitian fro
>very small positive numbers.
>
>Linda
>
>-Original Message-
>From: programming-boun...@forums.jsoftware.com
>[mailto:programming-boun...@forums.jsoftware.com] On Behalf Of Bo Jacoby
>Sennt: Thursday, January 17, 2013 3:37 AM
>To: programm...@jsoftware.com
>Subject: Re
Henry,
^.%__ NB. this log(-0) is bad
__
it could have been
__j1p1
__j3.14159
in order to indicate the negative sign of -0.
- Bo
>
> Fra: Henry Rich
>Til: programm...@jsoftware.com
>Sendt: 11:29 torsdag den 17. januar 2013
>Emne: Re: [Jprogramming]
>
>> This is nice!
>>
>> %1&o.%_
>> _
>> %1&o.%__
>> __
>>
>>
>> The csc is very small for negative numbers close to zero and very
>> large for very small positive numbers.
>>
>> Linda
>>
>> --
ease see Saff and Snider's Chapter 3.
>>
>> Kip Murray
>>
>> Sent from my iPad
>>
>>
>> On Jan 17, 2013, at 4:22 AM, "Linda Alvord" wrote:
>>
>>> Isn't the log of negative numbers indefined?
>>>
>>
I had a very short look at Roger's Sudoku solver
http://www.jsoftware.com/jwiki/Essays/Sudoku
I made a sudoku solver some years ago, in Pascal, before I knew J. The sudoku
was represented by an array of shape 3 3 3 3 rather than of shape 9 9. This has
the advantage that not only rows and colum
David, the disadvantage of the SAF format is intolerable. The file format
exemplified in http://www.jsoftware.com/jwiki/IanClark/credo dosn't have this
disadvantage. Everything is kept in one file. The information you need is
easily extracted from the file.
- Bo
>___
Among the many answers in this thread the standard method is not seen, so here
it comes.
Let the sides of the rectangular chicken yard be x and y
The area is x*yDifferentiating the area gives 0=(y*dx)+(x*dy) which is zero
because the area is maximum.
The length of fence is 100= (2*x)+y
D
Hi J'ers
The communication below was sent to, but seemingly not received by,
.
So I resend itfor your information.
- Bo
>
> Fra: Bo Jacoby
>Til: "programm...@jsoftware.com"
>Sendt: 20:05 søndag den 24. februar 2013
>Emne: S
No, Kip. The median is a useless concept. It should not be implemented.
:) Bo.
>
> Fra: km
>Til: "programm...@jsoftware.com"
>Sendt: 23:29 søndag den 10. marts 2013
>Emne: [Jprogramming] Find the median
>
>The median of list 1 2 2 4 6 is 2 ("middle" value
tiles and the like distasteful too? They're very useful
>for examining empirical distributions, though some care is needed with
>interval bounds....
>
>Mike
>
>On 11/03/2013 7:08 AM, Bo Jacoby wrote:
>> No, Kip. The median i
If I understand the question correctly, the problem is to solve the inequality
k^n>10^93 for integer n.
k,.>.93%10^.k=.2+i.9
2 309
3 195
4 155
5 134
6 120
7 111
8 103
9 98
10 93
>
> Fra: mikel paternain
>Til: "programm...@jsoftware.com"
>Send
If there are n=1 variables and k=4 states, then the number of systen states is
k^n=4^1=4 and not n^k=1^4=1. I think that Mikel's formula is quite correct.
>
> Fra: Roger Hui
>Til: Programming forum
>Sendt: 8:19 onsdag den 1. maj 2013
>Emne: Re: [Jprogrammi
Transcomputational numbers
>
>
>On Wed, May 1, 2013 at 2:02 AM, Bo Jacoby wrote:
>> If I understand the question correctly, the problem is to solve the
>> inequality k^n>10^93 for integer n.
>..
>>
3 and 7 are primes, and (3+7)%2 is 5 which is a prime too. But 3 and 7 are not
consecutive primes, because there is a prime between 3 and 7, namely 5. So if
p < q and p is prime and q is prime and r= (p+q)%2 is prime too, then p
< r and r < q, and so p and q are not consecutive primes. Q
1 - 100 of 380 matches
Mail list logo
