[QUOTE=science_man_88;238432]You know nothing of a put down or even an attempt there, can't see one for the life of me.[/QUOTE]

Sorry, guy, no putdowns there. No matter how you may try perverting what I posted, there were no putdowns.

Now, let's prevent this thread from further derailing, and get back on track.

The original request still holds: Some math, or a clear explanation without ambiguity.

[QUOTE=3.14159;238433]Sorry, guy, no putdowns there. No matter how you may try perverting what I posted, there were no putdowns.

Now, let's prevent this thread from further derailing, and get back on track.

The original request still holds: Some math, or a clear explanation without ambiguity.[/QUOTE]

you lie through your teeth. on the other note I've already stated sumdigits(last result)==9, and the lucaslehmer title explain it all, also i never asked you, I asked the one who seemed not to put me down.

[QUOTE=science_man_88;238435]you lie through your teeth. on the other note I've already stated sumdigits(last result)==9, and the lucaslehmer title explain it all, also i never asked you I asked the one who seemed no to put me down.[/QUOTE]

[spoiler]Lied? When? This is too much fun!

Let's look at the definition of "lie";

[QUOTE=Dictionary][spoiler](Noun) [B]A false statement made with deliberate intent to deceive; an intentional untruth; a falsehood.[/B]
(Verb) [B]To speak falsely or utter untruth knowingly, as with intent to deceive.[/spoiler][/B]
[/QUOTE]

.. No lies told, no putdowns made. Hurl mud to your heart's desire, but it does no good.[/spoiler]

And, now: What does "sumdigits" do?

You claim to shoot me down is not a put down that's is false.If you can and are willing to shoot them down you think you're smarter. This is like calling them dumb, which is pretty much saying you moron.

"You're wrong, because you're a damn moron who doesn't have any idea what they're talking about."


Moron appears in both paths they are equal in this case.

[QUOTE=3.14159;238438]

And, now: What does "sumdigits" do?[/QUOTE]

if you don't remember look in this thread I made it here.

[QUOTE]you claim to shoot me down is not a put down that's is false.If you can and are willing to shoot them down you think you're smarter. This is like calling them dumb, which is pretty much saying you moron.
[/QUOTE]

I attacked your ideas. You are not your ideas. There was no reason to take this as a "personal attack". There were no putdowns. Like I said some time ago, if you insist on singing that there are, where there are none, you are free to do so.

[QUOTE]if you don't remember look in this thread I made it here.
[/QUOTE]

Where at?

[QUOTE=science_man_88;226878]I also did this with your knowledge:

[CODE]sumdigits(n) = if(n%9!=0,return(n%9),return(n%9+9))[/CODE]

but you might think it's kinda lame.[/QUOTE]

post 882 I believe.

[QUOTE=science_man_88;238443]post 882 I believe.[/QUOTE]

This can be simplified to x mod 9.

[QUOTE=3.14159;238444]This can be simplified to x mod 9.[/QUOTE]

No it can't as 0 becomes 9 so you must adapt it.

[QUOTE=science_man_88;238413][CODE]lucaslehmer2(p)= s=4;for(x=1,p-2,s=(s^2-2)%(2^p-1));if(x=p-2 && sumdigits(s)==9,print1(p","))[/CODE]

axn what are the possible improvements on this? This leads me to more curiosity than the first one I made. This one can help show all the exponents that have a sumdigits(last term)==9 not just the 2^p-1 is prime ones. If we can predict this one, maybe we can find a pattern in the p that make 2^p-1 prime (I'm guessing based on position in this supersuquence).[/QUOTE]

You write
[CODE]if(x=p-2 && ...[/CODE]
which means "set x to the value p-2, then if that value is nonzero continue to the next condition". This probably isn't what you intended.

Also, what is sumdigits? [url=http://oeis.org/A010888]A010888[/url]? [url=http://oeis.org/A007953]A007953[/url]? Something else?