unforum

[JebJoya]

Meh, I'm still going with my "Of this I have found a remarkable demonstration. This margin [text box] is too narrow to contain it", and saying let's just wait until we can get more of a clue...

Seriously ^^ The above proof was good enough for Fermat, so it's good enough for me! (The other option is "trivial" which is a favourite proof of a number of my maths lecturers - I call it proof by intimidation, ie "this proof is trivial, so anyone that asks me a question about it is teh st00pid")

Right, I've got to get ready and to my gf's in 25 minutes, ready for our 9am <groan>

Jeb

[PuzzledPineapple]

Is anyone aware of a package similar to LaTeX that convert text to hand motions? Everything can be proved by hand-waving.

There exists a page somewhere out there in the huge big internet thing that has a great list of all the types of proof there are in the mathematical world that's hilarious to read and entirely irrelevant. The location of this page is left to the reader.

[JebJoya]

[Hunting4Treasure]

[philippa89]

[pest]

the question

[locqust]

trout me if some1 has mentioned this before....

when asked to show proof perhaps we r just supposed to show the equation working on a prime number and a non prime? rather than trying to prove whether the equation is real or not? I mean if they use this equation to do other higher math theories? Lets face it T-L-P was a degree or masters level proposition, this just could be a similar level of a maths equation to do.

I dont think that made sense....

[philippa89]

no that made sense, it would be much easier than proving or disproving the whole theory. would it matter which numbers you chose in your proof??

Someone posted a 'proof' in spring 2004 saying they had proved it. was this before the cards were written?? dont think it would be of much use though because noone really knows if its right.

[tanner]

[SteveC]

My feeling is that TLP's difficulty laid in the fact they thought it unlikely we'd identify the diagram. Hell, the topic was even a clue to that... Once it was discovered, it wasn't too tough (well, it was for me, but not for bright folk) to boil it down...

[wokerbee]

Hi everyone i have been trying to look for proof of riemanns work on prime numbers and found out that Hadamard and de la vallee poussin had proved riemanns work. There proof was based on the prime number theorem
The number of primes equal to or less than n tends to infinity as n/ln n.

I wondered if this was of any help or if im on the right lines or if this card is unsolvable as this is all i can think of. It also seems to fit what it is asking for.

This is the webpage i looked on http://www-groups.dcs.st-and.ac.uk/~history/Mathematicians/Riemann.html

[lauriek]

Any UK people see Numb3rs on ITV? last night? Was all about a mathematician who thought he'd worked out Riemanns, some criminals kidnapped his daughter to force him into producing a number seive based on the algorythm. Of course it turned out he'd made a mistake and not solved it at all...

[Daffy889]

[monkeytroll]

Pretty sure someone must have tried by now, but has anybody entered 'not provable' 'impossible' or something similar?
I know it's probably crap, but I was just thinking of the cheeky answer from Strange Loops.

[philippa89]

just tried those two, but not luck Any more suggestions i will try some out later. (well one more today and then 3 more tomorrow )