unforum

[baf]

[CherokeeParkes]

I have a question has anyone examined the LaTeX program that is meantioned in the letter?

[dps05]

I've been using LaTeX to write reports for Uni for the past couple of months. It is just a typesetting / formatting programme - you write the commands in in plain text (with lots of \s , {}s and _s), then turns it into a .PS or .PDF - making it look all professional-like.

You can find it and download it for free here. But I think you need the packages that go with it from here.

And there are some handy tutorials

[JebJoya]

DISCLAIMER: This post was written when I was VERY tired, and has little or no actual content, however there might be something in there useful to somebody.

Also, anyone that actually needs to use LaTeX, I used this guide here to teach me, it's really simple - honestly!
$$\zeta (s) := \sum_{r=1}^{\infty } s^{-r}$$
You see, not that difficult really! (Okay, that was kind of off the cuff and I don't know if it's all correct, but you see my point!)

Honestly, with this card I feel that either what MC have said should be taken at face value - i.e. "prove it... oh, you can't? nah nah nah nah nah!" or else there is a clue somewhere in there.

As other people have suggested, we could enter the Perplexian who proved it's name, or name of his proof, satisfying

[dps05]

Nice one Jeb! Both the LaTeX link and the whole post (rambling as it was ) I'm in no way a complex analyst, but if that's even what's needed to prove Riemann's hypothesis I'll give it a go! I'll also ask around my department (maths) when I get back next week - there are a couple of lecturers that dabble in that area.

[DJ FreeMason]

39 pages of backposts to read is a lot. But that's beside the point.

dps, if you can prove the Reimann function, then you will have done what no one else has, send it to the $1M people first then send it to MC.

I, personally, have to agree with JebJoya on this that either there is no solution, in which case the people at Mind Candy are just jerking us around, or they have the intention that someone in Perplex City has solved it.

Personally, I've been trying to see if I can get access to the Library services in Perplex City Acadamy. If there's any place that could have the answer that could. Unfortunately, I write this at my school's computer and they've disabled looking at the source code so it could be a dead end there and I'm just wasting time. I'm trying to think of any other places where the answer could be hidden.

[Enigmaster]

This from PostSecret has some relevance, just after the 4th postcard:

[x_x]

Seems suspect but can anyone plug that number into the forumla to see if it qualifys as counter-proof?

My system cant seem to handle a number that large.

[DJ FreeMason]

Scratch the Library textfields as anything useful. They are hard coded to say "You're not supposed to see this." However, I found a chunk of javascript commented out of the page. I don't know Java so I can't understand what its saying. What little C++ I remember isn't helping. If anyone knows Java, I'm going to post the code below.

[BrianEnigma]

[DJ FreeMason]

Damn. I was hoping I was onto something.

I've been trying to think who could solve the Reimann sum in Perplex City. Has anyone contacted Sente to see if he has any ideas who would be intelligent enough to do it? I mean it can't really hurt. I can send one off.

As for the prime number, the number is exceedingly large. The beginning and ending digits (about 15000 digits each). The text file alone is 5.23 MB. And honestly, much as I'd like to trust the person that they're not lying, I have to question the validity of the post. The site that you listed had a number of joke things. Punching in the 2^13466971-1 into google gives 88 Xanga, Live Journal, and Google group pages that say "The Reimann sum is false". I haven't seen a single credible source for it. All I've seen is that the number is prime, nothing that disproves Reimann.

Calculating that the Reimann sum is false would require a program to be able to handle the whole of the number as well as be able to calculate it. I would think that since the number is 4053946 digits long, it would certainly take a lot of RAM and processor power.

[tarazades]

The card states that the largest known prime as of 2004 was 7235733 this was discovered by josh findley, also Louis de Branges posted pages on the internet that prove the theory. Which can be found at Department of Mathematics, Purdue University. When you go to put your answer in on the perplexcity site it asks you to show your proof. Has anyone tried putting in the proof of that largest prime number quoted on the bottom of the card? I have had a quick look for this but can't find the proof.

[Bendover]

you should go back and read at least the last 5-6 (really should do them all) pages to get an idea of where we are at with this card. if there is an answer it is going to be written (at least at this point) by Louis De Branges

[hexDa3m0n]

[Sparkybuzzed]

Just saw this on the Perplex City Sentinel...

Mind Candy and the Academy have confirmed that card #238, Riemann, does require proving the Riemann Hypothesis.

Here's the link: Click Me

That's a bit ridiculous.[/url]