You are not logged in.
Hi,
We can approximate by simulation (J again):
a=:3+9*?10000000#0
b=:4+11*?10000000#0
>./((10*a)+(25*b))*(20>a+b)=424.953939391672
which is close to the exact answer of 425.
Brief explanation:
1) Get random uniform values in the range for x and y.
2) Get the maximum of 10x+25y among the values where x+y<=20
From the LPP:
(3 5 12 12 3)([: >./ (10 * [) + 25 * ]) 15 15 8 4 4= 425
We can easily obtain the tacit definition using
sim=: 13 : '>./((10*x)+(25*y))'Typing in sim gives the tacit definition. We can then use that output to build more complicated definitions.
Hi,
I think I got a hang of doing things in J.
Here's a simulation for an approximate answer:
sim=: 3 : '0=+/+/(2 4 8 16)=/2+/\(20?20){5#1 2 4 8'
((!20)%(!5)^4)*(+/%#)(sim "0) 1000000#0= 135712661.692608
Hi,
Yes, the answer's right.
Hi,
A simulation is also close, in J:
a=:4#(i.13)
sim =: 3 : '1=+/(?3#52){a'
(+/%#)(sim"0)1000000#0≈ 0.001373
One way by programming:
In python:
(sum([i*[1]+2*i*[2]+3*i*[3]+4*i*[4] for i in range(1,21)],[]))[2047]=4
It has many softwares I probably never use.
Having less processes means higher responsiveness. Boot time also will be reduced.
Okay, I'll see.
I'm thinking of installing debian, and compile the latest kernel for only the hardware I use.
No, linux mint.
I'm used to its applets. Do you use LXDE? Can I have multiple panels in that?
I use MATE.
Yes, I was trying a way to use only the formulas for sector and square, could not proceed that way.
That's right.
Anybody will, once they realize how compact the code can get!
Functional programming is very powerful once we get a hang of it.
Hi,
How do you get the first 100 squares with your favorite language?
In J, it's simple:
(1+i.100)^2Range[100]^2 in Mm?
That's right.
Yes, frontend just like a PC version.
Documentation is not available in it, we have to rely on online docs.
You're welcome.
Hi Agnishom,
Yes, it includes v10. The zipped file has raspbian image which is 3GB.
yes, most of the smartphones also have that architecture.
another CPU architecture.
Yeah, but I think they don't support ARM.
Yes, I can use it for a few functions like obtaining a gf, which is not yet available in sage.
Yes, it's version 10, not even out for PC.
In[8]:= ClearSystemCache[]; Timing[fubar[7777777777];] Out[8]= {0.499203, Null}
And it took 4.37s in raspbian VM, not bad I think.
The answer I linked to is unnecessarily long. We can solve simply by using Maclaurin series for complex numbers:
Yeah, hope so.