![]() |
|
|
#2344 |
|
Aug 2006
3·1,993 Posts |
|
|
|
|
|
|
#2345 | |
|
"Forget I exist"
Jul 2009
Dumbassville
203008 Posts |
Quote:
I have a download of 2.5.1.exe it is there but the download info says very basic. Last fiddled with by science_man_88 on 2012-03-05 at 13:09 |
|
|
|
|
|
|
#2346 | |
|
"Forget I exist"
Jul 2009
Dumbassville
838410 Posts |
Quote:
Code:
partNo1(n)= a=Vec(select(v->vecmin(v)>1,partitions(n)));for(x=1,#a,if(#vecsort(a[x],,8)!=#a[x],a[x]=0;a[x]=Vec(a[x])));forstep(y=#a,1,-1,if(a[y]==[0],a=vector(y-1,n,a[n])));a Last fiddled with by science_man_88 on 2012-03-05 at 15:59 |
|
|
|
|
|
|
#2347 |
|
Aug 2006
3·1,993 Posts |
Now remember to use my() for all variables you use in your functions...
|
|
|
|
|
|
#2348 | |
|
"Forget I exist"
Jul 2009
Dumbassville
26·131 Posts |
Quote:
Last fiddled with by science_man_88 on 2012-03-10 at 14:36 |
|
|
|
|
|
|
#2349 | |
|
"Forget I exist"
Jul 2009
Dumbassville
26×131 Posts |
Quote:
Last fiddled with by science_man_88 on 2012-05-14 at 23:04 |
|
|
|
|
|
|
#2350 |
|
"Forget I exist"
Jul 2009
Dumbassville
838410 Posts |
okay I think I have this worked out:
Code:
ali(f)=g=vector(#partNo1(f-1)-1,k,partNo1(f-1)[k+1]);g Code:
partNo1(n)=
a=Vec(select(v->vecmin(v)>1,partitions(n)));
b=[];
for(x=1,#a,
a[x]=if(#vecsort(a[x],,8)!=#a[x],
[0],
Vecsmall(Vec(a[x])));
b=concat(b,
if((a[x][1]*a[x][#a[x]])!=0 && sigma(a[x][1]*a[x][#a[x]])-(a[x][1]*a[x][#a[x]])==(n+1),
a[x][1]*a[x][#a[x]])
)
);
return(vecsort(b,,8))
Last fiddled with by science_man_88 on 2012-05-14 at 23:57 |
|
|
|
|
|
#2351 |
|
"Forget I exist"
Jul 2009
Dumbassville
26·131 Posts |
I've played with going backwards and the Inverse home prime sequences. going with the inverse you just change to a forstep to concat in the other direction. the backwards home prime gets a little complicated but a few things we can use: home primes concat from lowest to highest so looking at the resulting string/ number working through it from the front end we can check every new prime found against the last to see if it's greater than or equal to it because they need to be at least as big to be in proper order. while reading it from the far end the same is true for IHP.
|
|
|
|
|
|
#2352 | |
|
"Forget I exist"
Jul 2009
Dumbassville
26·131 Posts |
Quote:
manually ( okay typing into pari) I found 18917 was prime then you realized what number starts with 0 normally none so it can't be that the next time it has a end of 1,3,7,or 9 is 18197053 and that works to be prime next thing to realize is that the original numbers next possible prime is supposed to be larger so it too must have at lest 8 digits 16449018 is 8 but doesn't work as it's even next one that it could be is 16449018227 but this leaves less than the length of this new one left so the next one couldn't be bigger a quick check shows that using the rest is prime so we have our 2 primes in this case 18197053 * 1644901822763687 = 31116694961017273454411 ( pari gives a different answer now and this is the answer in the factorDB) Last fiddled with by science_man_88 on 2012-07-10 at 18:53 |
|
|
|
|
|
|
#2353 |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
949710 Posts |
science_man_88: it is not a very good idea to publicly engage in meaningful conversations with yourself. At the very least, you really, really don't have to quote in full your own message?! Another board bluntly classifies such postings as post whoring. (They don't mince words, do they now?)
|
|
|
|
|
|
#2354 |
|
"Forget I exist"
Jul 2009
Dumbassville
26·131 Posts |
|
|
|
|
![]() |
| Thread Tools | |
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 |