mersenneforum.org  

Go Back   mersenneforum.org > Math Stuff > Computer Science & Computational Number Theory > PARI/GP

Reply
 
Thread Tools
Old 2010-10-10, 23:36   #1486
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

26×131 Posts
Default

Quote:
Originally Posted by CRGreathouse View Post
That's hard because some definitions require them to have a prime exponent, in which case they're not recurrence relations.
couldn't there be a side note ? lol

now if only I could prove which primes using the Lucas formulas
science_man_88 is offline   Reply With Quote
Old 2010-10-11, 00:29   #1487
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

3·1,993 Posts
Default

Quote:
Originally Posted by science_man_88 View Post
couldn't there be a side note ?
You could add it in if you like. You don't even need to log into Wikipedia to make changes.
CRGreathouse is offline   Reply With Quote
Old 2010-10-11, 00:36   #1488
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

26·131 Posts
Default

Quote:
Originally Posted by CRGreathouse View Post
You could add it in if you like. You don't even need to log into Wikipedia to make changes.
added in I still want to figure out what the V sequence would represent.
science_man_88 is offline   Reply With Quote
Old 2010-10-11, 00:46   #1489
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

175B16 Posts
Default

Quote:
Originally Posted by science_man_88 View Post
added in I still want to figure out what the V sequence would represent.
2^n + 1, Sloane's A000051.
CRGreathouse is offline   Reply With Quote
Old 2010-10-11, 00:50   #1490
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

26·131 Posts
Default

Quote:
Originally Posted by CRGreathouse View Post
2^n + 1, Sloane's A000051.
if we could find a P,Q that would work for the exponents to each if possible the hard part is if it has to be integer then the only way I see to get the Mersenne prime exponents started is 3,2 though I'm likely wrong.
science_man_88 is offline   Reply With Quote
Old 2010-10-11, 01:54   #1491
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

597910 Posts
Default

Quote:
Originally Posted by science_man_88 View Post
if we could find a P,Q that would work for the exponents to each if possible the hard part is if it has to be integer then the only way I see to get the Mersenne prime exponents started is 3,2 though I'm likely wrong.
What does "work" mean?
CRGreathouse is offline   Reply With Quote
Old 2010-10-11, 11:44   #1492
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

26×131 Posts
Default

Quote:
Originally Posted by CRGreathouse View Post
What does "work" mean?
succeed in creating the list in this case.

I found the p and q for 0 and positive integers numbers lol p=2 q= 1

Last fiddled with by science_man_88 on 2010-10-11 at 11:48
science_man_88 is offline   Reply With Quote
Old 2010-10-11, 20:34   #1493
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

3×1,993 Posts
Default

Quote:
Originally Posted by science_man_88 View Post
succeed in creating the list in this case.

I found the p and q for 0 and positive integers numbers lol p=2 q= 1
OK, so you're saying
If we could find a P,Q that would succeed in creating the list for the exponents to each if possible the hard part is if it has to be integer then the only way I see to get the Mersenne prime exponents started is 3,2 though I'm likely wrong.
So what is "the list", "succeed", and "started"?
CRGreathouse is offline   Reply With Quote
Old 2010-10-11, 23:19   #1494
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

26·131 Posts
Default

Quote:
Originally Posted by CRGreathouse View Post
OK, so you're saying
If we could find a P,Q that would succeed in creating the list for the exponents to each if possible the hard part is if it has to be integer then the only way I see to get the Mersenne prime exponents started is 3,2 though I'm likely wrong.
So what is "the list", "succeed", and "started"?
the list = Mersenne prime exponents
succeed = successfulness in the creation
started = already underway

look if P and Q need to be integers then 3*3-2*2 = 9-4 = 5 the next one so since P needs to be 3 Q=2 is the only way to get them started but as we proved that's also the start of 2^n+1.
science_man_88 is offline   Reply With Quote
Old 2010-10-12, 01:04   #1495
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

3·1,993 Posts
Default

Quote:
Originally Posted by science_man_88 View Post
the list = Mersenne prime exponents
succeed = successfulness in the creation
started = already underway

look if P and Q need to be integers then 3*3-2*2 = 9-4 = 5 the next one so since P needs to be 3 Q=2 is the only way to get them started but as we proved that's also the start of 2^n+1.
If we could find a P,Q that would create the list of Mersenne exponents, ___. The hard part is if it has to be integer then the only way I see to get the Mersenne prime exponents started is 3,2 though I'm likely wrong.
I can't entirely understand this, but it should be easy to show that there are no P, Q that yield the Mersenne prime exponents.

Ah yes, here we go. My program findrec says:
Code:
Cannot be described by a homogeneous linear recurrence relation with 19 or fewer coefficients.
of the first 39 Mersenne exponents. So not only can you not find P, Q (a 2nd-order homogeneous linear recurrence relation with particular starting conditions), you can't find *any* HLRR of order 2, or even 3 through 19.
CRGreathouse is offline   Reply With Quote
Old 2010-10-12, 11:44   #1496
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

20C016 Posts
Default

Quote:
Originally Posted by CRGreathouse View Post
If we could find a P,Q that would create the list of Mersenne exponents, ___. The hard part is if it has to be integer then the only way I see to get the Mersenne prime exponents started is 3,2 though I'm likely wrong.
I can't entirely understand this, but it should be easy to show that there are no P, Q that yield the Mersenne prime exponents.

Ah yes, here we go. My program findrec says:
Code:
Cannot be described by a homogeneous linear recurrence relation with 19 or fewer coefficients.
of the first 39 Mersenne exponents. So not only can you not find P, Q (a 2nd-order homogeneous linear recurrence relation with particular starting conditions), you can't find *any* HLRR of order 2, or even 3 through 19.
is there a formula for telling which in a lucas sequence are prime ?
science_man_88 is offline   Reply With Quote
Reply



Similar Threads
Thread Thread Starter Forum Replies Last Post
Why do I sometimes see all the <> formatting commands when I quote or edit? cheesehead Forum Feedback 3 2013-05-25 12:56
Passing commands to PARI on Windows James Heinrich Software 2 2012-05-13 19:19
Ubiquity commands Mini-Geek Aliquot Sequences 1 2009-09-22 19:33
64-bit Pari? CRGreathouse Software 2 2009-03-13 04:22
Are these commands correct? jasong Linux 2 2007-10-18 23:40

All times are UTC. The time now is 23:09.


Fri Aug 6 23:09:55 UTC 2021 up 14 days, 17:38, 1 user, load averages: 4.35, 4.02, 3.95

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

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.