• Create Account

Banner advertising on our site currently available from just \$5!

# LaTeX (eqn tag) is failing

Old topic!
Guest, the last post of this topic is over 60 days old and at this point you may not reply in this topic. If you wish to continue this conversation start a new topic.

2 replies to this topic

### #1Bacterius  Crossbones+   -  Reputation: 10554

Posted 02 January 2013 - 11:30 PM

It seems the LaTeX tag has been having issues lately, it does not seem to properly recognize its own tag, and does not stop at the [/eqn] but keeps going for some reason.

What seems to happen is the forum munches everything up until the last [/eqn] closing tag in the post. If this happens to be an invalid image name (to be sent to the render service the forum uses) the typesetted equation won't even come up (as in the screenshot). Otherwise it'll just display ordinary text caught in between equations. The result is you can only have one equation.. per post. It also means essentially 100% of posts having used typesetted equations, are now unreadable.

Steps to reproduce:

1. enter an equation

2. try and post that, it works

3. enter another one somewhere else

4. post again, it'll come out wrong

[eqn]ax + b[/eqn]
this is not inside eqn tags
[eqn]ax^2 + bx + c[/eqn]

this is not inside eqn tags

Can anyone reproduce? I don't think it's a browser issue, but Chromium here.

PS:  this can also be observed in this sticky, see how roverstu's sample got mangled as well.

The slowsort algorithm is a perfect illustration of the multiply and surrender paradigm, which is perhaps the single most important paradigm in the development of reluctant algorithms. The basic multiply and surrender strategy consists in replacing the problem at hand by two or more subproblems, each slightly simpler than the original, and continue multiplying subproblems and subsubproblems recursively in this fashion as long as possible. At some point the subproblems will all become so simple that their solution can no longer be postponed, and we will have to surrender. Experience shows that, in most cases, by the time this point is reached the total work will be substantially higher than what could have been wasted by a more direct approach.

- Pessimal Algorithms and Simplexity Analysis

### #2Michael Tanczos  Senior Staff   -  Reputation: 5536

Posted 03 January 2013 - 05:43 PM

I can confirm this bug.. the new upgrade broke the code.

### #3Bacterius  Crossbones+   -  Reputation: 10554

Posted 27 January 2013 - 07:20 AM

The slowsort algorithm is a perfect illustration of the multiply and surrender paradigm, which is perhaps the single most important paradigm in the development of reluctant algorithms. The basic multiply and surrender strategy consists in replacing the problem at hand by two or more subproblems, each slightly simpler than the original, and continue multiplying subproblems and subsubproblems recursively in this fashion as long as possible. At some point the subproblems will all become so simple that their solution can no longer be postponed, and we will have to surrender. Experience shows that, in most cases, by the time this point is reached the total work will be substantially higher than what could have been wasted by a more direct approach.

- Pessimal Algorithms and Simplexity Analysis

Old topic!
Guest, the last post of this topic is over 60 days old and at this point you may not reply in this topic. If you wish to continue this conversation start a new topic.

PARTNERS