193 is the next one like 79.

my original hypothesis was when I saw all the factors that (factor/p)%8=0 I assumed it was always true then I found 43 and it didn't work then I hypothesized it might be because it had 3 factors and noticed that if one of the lower 2 factors/p aren't divisible by 8 neither is the third but one of them can be divisible by 8 and not necessitate the third to be. that's about how far I've got into hypothesizing as i haven't figured out a pattern in the 4 and 5 factor ones.

[QUOTE=science_man_88]my original hypothesis was when I saw all the factors that (factor/p)%8=0 I assumed it was always true then I found 43 and it didn't work then I hypothesized it might be because it had 3 factors and noticed that if one of the lower 2 factors/p aren't divisible by 8 neither is the third but one of them can be divisible by 8 and not necessitate the third to be. that's about how far I've got into hypothesizing as i haven't figured out a pattern in the 4 and 5 factor ones.[/QUOTE]

Are you sure this isn't the law of small numbers at work again?

[QUOTE=3.14159;223400]Are you sure this isn't the law of small numbers at work again?[/QUOTE]

[CODE]for(x=1,50,print(((factor(2^prime(x)-1)\prime(x))/8)%1==0","x))[/CODE]

is a code I tried to prove it it seems to work for every Mersenne number in a prime index any way to change it to check only factors less than 2^n-1 would help.

[CODE]for(x=1,10,print((floor(factor(2^prime(x)-1)\prime(x)))%8))[/CODE]

yeah I figured I had an error there's one thing I have to ask. How do I check to see if it ever matches 0 0 for the response is it as simple as a if instead of the print ?

[CODE](21:06) gp > for(x=1,10,print((floor(factor(2^prime(x)-1)\prime(x)))%8))
Mat([1, 0])
Mat([2, 0])
Mat([6, 0])
Mat([2, 0])
[2, 0; 0, 0]
Mat([6, 0])
Mat([6, 0])
Mat([2, 0])
[2, 0; 0, 0]
[0, 0; 6, 0; 0, 0][/CODE]

I want to check for those 0, 0 parts

First: We'll save the value like so:
[code]f=factor(2^prime(x)-1)\prime(x))%8;[/code]
so your code is now
[code]for(x=1,10,f=factor(2^prime(x)-1)\prime(x))%8;print(f))[/code]

[QUOTE=science_man_88;223404][CODE]for(x=1,10,print((floor(factor(2^prime(x)-1)\prime(x)))%8))[/CODE]

yeah I figured I had an error there's one thing I have to ask. How do I check to see if it ever matches 0 0 for the response is it as simple as a if instead of the print ?[/QUOTE]

I'm not quite sure what you want. If you want to check if it's *equal* to 0,0 then do
[code]if(f!=Mat([0,0]),print(f" is nonzero"))[/code]
rather than
[code]print(f)[/code]

If you want to check if any of the components are zero, it's best to make a special function for that:
[code]anyZero(M)={
for(i=1,#M[,1],
if(M[i,1] == 0 && M[i,2] == 0, return(1))
);
0
};
addhelp(anyZero, "anyZero(M): Returns 1 if any row of the n x 2 matrix M is all zeros, or 0 otherwise.")[/code]

Then you can do whatever you want with it:
[code]if(anyZero(f), zeroCount++, print(f" has no all-zero rows"))[/code]

But I'll admit I don't understand the purpose behind any of this.

I'm trying to prove my hypothesis that most prime index Mersenne's that aren't prime have a factor that (factor\n)%8==0 and I have a phrase for the exceptions I'm finding to cover them.

OK, so you need only check the first component.

[QUOTE=CRGreathouse;223450]OK, so you need only check the first component.[/QUOTE]

yeah well I know printing takes a long time so I only want it to print prime(x) if (factor\n)%8==0 which I can't seem to pull off.

[QUOTE=science_man_88]I'm trying to prove my hypothesis that most prime index Mersenne's that aren't prime have a factor that (factor\n)%8==0 and I have a phrase for the exceptions I'm finding to cover them.
[/QUOTE]

Wait.. I seem to forget what the \ function is. Is it the floor function? By the way, are you still working on the trial factor code?

[QUOTE=3.14159;223453]Wait.. I seem to forget what the \ function is. Is it the floor function? By the way" Are you still working on the trial factor code?[/QUOTE]

\ is floor and in a way but I'm trying to get more specific.