mersenneforum.org

mersenneforum.org (https://www.mersenneforum.org/index.php)
-   Math (https://www.mersenneforum.org/forumdisplay.php?f=8)
-   -   Math rendering engine (https://www.mersenneforum.org/showthread.php?t=4576)

mdettweiler 2010-06-17 16:51

[quote=Xyzzy;218990]We have implemented this solution. How does it look to you all?[/quote]
The numerous examples in this thread look good to me in IE8.

rajula 2010-06-17 16:59

[QUOTE=Xyzzy;218990]We have implemented this solution. How does it look to you all?[/QUOTE]

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

ccorn 2010-06-17 17:07

[QUOTE=Xyzzy;218990]We have implemented this solution. How does it look to you all?[/QUOTE]Looks good both in Firefox 3.0.6 and Safari 4.0.5. Thanks!

Xyzzy 2010-06-17 17:11

1 Attachment(s)
It still looks the same here.

:mike:

ccorn 2010-06-17 17:25

[QUOTE=Xyzzy;219001]It still looks the same here.

:mike:[/QUOTE]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
:tu:

Uncwilly 2010-06-17 20:31

[QUOTE=mdettweiler;218994]The numerous examples in this thread look good to me in IE8.[/QUOTE]IE7 is ok.

lfm 2010-06-18 15:36

[QUOTE=Xyzzy;74523]Small ones can be checked in Linux.

[code]$ factor 121645100409356287
121645100409356287: 25561 4759011791767[/code][/QUOTE]

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

[url]http://www.gnu.org/software/coreutils/manual/html_node/factor-invocation.html[/url]

cheesehead 2010-06-19 06:21

[quote=Xyzzy;219125][URL]http://www.gnu.org/software/coreutils/manual/html_node/factor-invocation.html[/URL][/quote]From that page:

[quote]Factoring large prime numbers is, in general, hard.[/quote]

Batalov 2011-01-14 19:05

Just testing... testing... testing... [TEX]1..2..3...[/TEX]
[QUOTE=A.Kulsha]
[TEX]Osc(z) = \sum_{\rho} f(\rho) \frac{\Gamma(\rho)\zeta'(\rho)}{\rho}(-z)^{-\rho}[/TEX]
...
It appears that
[TEX]f(\rho)=-|\zeta'(\rho)|^{-2}
[/TEX]
so the conjecture becames
[TEX]
Osc(z) = -\sum_{\rho}\frac{\Gamma(\rho)}{\rho\zeta'(1-\rho)}(-z)^{-\rho}[/TEX]
where the sum is taken in order of increasing the absolute value of [TEX]\rho[/TEX][/QUOTE]


All times are UTC. The time now is 17:50.

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.