Math rendering engine - Page 5

mdettweiler · 2010-06-17, 16:51

Quote:

Originally Posted by Xyzzy

We have implemented this solution. How does it look to you all?

The numerous examples in this thread look good to me in IE8.

rajula · 2010-06-17, 16:59

Quote:

Originally Posted by Xyzzy

We have implemented this solution. How does it look to you all?

Looks good in both Firefox (3.6.3) and Chrome (5.0.375.70 beta).

ccorn · 2010-06-17, 17:07

Quote:

Originally Posted by Xyzzy

We have implemented this solution. How does it look to you all?

Looks good both in Firefox 3.0.6 and Safari 4.0.5. Thanks!

Xyzzy · 2010-06-17, 17:11

It still looks the same here.

ccorn · 2010-06-17, 17:25

Quote:

Originally Posted by Xyzzy

It still looks the same here.

lynx, w3m, links or elinks? My guess is lynx.

Mini-Geek · 2010-06-17, 17:30

I can add to the list of browsers it looks good in:
Opera 10.00
Opera 10.53

Uncwilly · 2010-06-17, 20:31

Quote:

Originally Posted by mdettweiler

The numerous examples in this thread look good to me in IE8.

IE7 is ok.

lfm · 2010-06-18, 15:36

Quote:

Originally Posted by Xyzzy

Small ones can be checked in Linux.

Code:

$ factor 121645100409356287
121645100409356287: 25561 4759011791767

That's actually I think part of the "BSD games" package which is often found on Linux systems true enough. I suppose it is really found on more Linux systems than BSD systems by now. I suspect you could easily build it for ms-windows or apple too if you felt like it.

In its most common form it only supports native integers so the input is limited to 2 billion and some on 32 bit systems.

Xyzzy · 2010-06-18, 17:19

http://www.gnu.org/software/coreutil...nvocation.html

cheesehead · 2010-06-19, 06:21

Quote:

Originally Posted by Xyzzy

http://www.gnu.org/software/coreutil...nvocation.html

From that page:

Quote:

Factoring large prime numbers is, in general, hard.

Batalov · 2011-01-14, 19:05

Just testing... testing... testing... $1..2..3...$

Quote:

Originally Posted by A.Kulsha

$Osc(z) = \sum_{\rho} f(\rho) \frac{\Gamma(\rho)\zeta'(\rho)}{\rho}(-z)^{-\rho}$
...
It appears that
$f(\rho)=-|\zeta'(\rho)|^{-2}<br />$
so the conjecture becames
$<br /> Osc(z) = -\sum_{\rho}\frac{\Gamma(\rho)}{\rho\zeta'(1-\rho)}(-z)^{-\rho}$
where the sum is taken in order of increasing the absolute value of $\rho$

2010-06-17, 17:11	#48
Xyzzy "Mike" Aug 2002 3×2,741 Posts	It still looks the same here. Attached Thumbnails

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
Google Compute Engine	GP2	Cloud Computing	32	2018-01-23 02:16
New math rendering engine	Xyzzy	Math	68	2015-12-21 00:40
An opportunity for search engine optimisation	fivemack	Aliquot Sequences	6	2015-11-17 20:31
Search engine feedback requested.	Xyzzy	Forum Feedback	2	2007-05-28 04:22
New search engine	jasong	Science & Technology	1	2006-08-24 17:09

2010-06-17, 17:30	#50
Mini-Geek Account Deleted "Tim Sorbera" Aug 2006 San Antonio, TX USA 4267₁₀ Posts	I can add to the list of browsers it looks good in: Opera 10.00 Opera 10.53

2010-06-18, 17:19	#53
Xyzzy "Mike" Aug 2002 3×2,741 Posts	http://www.gnu.org/software/coreutil...nvocation.html