mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 25 of 280
Search took 0.06 seconds.
Search: Posts Made By: carpetpool
Forum: And now for something completely different 2020-06-03, 18:00
Replies: 45
Views: 5,398
Posted By carpetpool
Post p = 1 mod 4 increases the odds of such a prime,...

p = 1 mod 4 increases the odds of such a prime, as N = 6*p^n+1 is congruent 7 mod 8, but there is still 1/3 chance --- which at 965K digits, I'm not sure if anyone would be willing to test if N |...
Forum: And now for something completely different 2020-05-30, 19:44
Replies: 45
Views: 5,398
Posted By carpetpool
Post There is also this (https://oeis.org/A332763)...

There is also this (https://oeis.org/A332763) possible sequence I am approaching the T5K range for. It would be interesting to find a prime (k=6) making the "Divides Phi" achievable class...
Forum: And now for something completely different 2020-05-18, 17:10
Replies: 19
Views: 412
Posted By carpetpool
Post How did you sieve them though? I figured you...

How did you sieve them though? I figured you could use the -w option BTW.
Forum: And now for something completely different 2020-05-17, 19:26
Replies: 19
Views: 412
Posted By carpetpool
Post Srsieve is for numbers of the form k*b^n+-c and...

Srsieve is for numbers of the form k*b^n+-c and sr2sieve requires that k=1 or c=1. Thus, you would have to find a program that sieves your requested forms, or use the -f switch in pfgw instead of a...
Forum: And now for something completely different 2020-05-17, 06:55
Replies: 19
Views: 412
Posted By carpetpool
Post I don't know of any utility that does this but...

I don't know of any utility that does this but srfile:

>>> srfile --help
srfile 0.6.17 -- A file utility for srsieve.
Usage: srfile [OPTION ...] <INFILE ...>
-o --output FILE Write...
Forum: Miscellaneous Math 2020-05-15, 18:39
Replies: 16
Views: 365
Posted By carpetpool
Post You seem to have the right idea. You want to...

You seem to have the right idea. You want to calculate 2^n for some integer n. However, this integer n is the one you want to test for primality, and not even 2^n, but 2^n mod n. (n may have,...
Forum: sweety439 2020-05-15, 18:33
Replies: 162
Views: 9,043
Posted By carpetpool
Post Sieving/Reserving MP 11 Ranges will be...

Sieving/Reserving MP 11

Ranges will be updated and posted later.
Forum: And now for something completely different 2020-05-15, 08:06
Replies: 19
Views: 412
Posted By carpetpool
Post You don't want to use -G, or at least it's not...

You don't want to use -G, or at least it's not the simplest way to accomplish what you're asking. The text files are essentially 'prp' files, I combined them into one abcd file:

srfile -a...
Forum: sweety439 2020-05-09, 00:32
Replies: 162
Views: 9,043
Posted By carpetpool
Post I'm working on a posting sieve files for some...

I'm working on a posting sieve files for some sequences so situations like these won't occur again. Anybody can test them as long as they reserve that sequence. I'm expecting to have some sequences...
Forum: Science & Technology 2020-04-22, 20:48
Replies: 15
Views: 750
Posted By carpetpool
Post When will a COVID-19 vaccine be out?

With the world in scramble to finding a vaccine to put a halt to the coronavirus pandemic, and countries suffering for months... here seem to be the most optimistic of results:

With over 70...
Forum: Abstract Algebra & Algebraic Number Theory 2020-04-18, 06:06
Replies: 0
Views: 804
Posted By carpetpool
Post Field mapping to fractional elements

Suppose we have a number field K = Q(ℽ) where ℽ is a root of the polynomial f of degree d.

Define C(f)n to be the n-th coefficient of f. Suppose we have integers a and q where f(a) = 0 mod q (i.e....
Forum: carpetpool 2020-04-11, 02:19
Replies: 2
Views: 713
Posted By carpetpool
Post I've been back on researching the task again. I...

I've been back on researching the task again. I thought I might share some new results, if they are not known already:

x^5 + (n^2 + n + 4)*x^4 + (-2*n^2 - 2*n + 2)*x^3 + (-n^4 - 2*n^3 - 10*n^2 -...
Forum: Lounge 2020-03-14, 02:07
Replies: 21
Views: 1,743
Posted By carpetpool
Post My school just got shut down until April because...

My school just got shut down until April because of COVID-19. Prior a lot of students hadn't been showing up and a couple students started a petition to shut down all schools and community colleges...
Forum: carpetpool 2020-03-12, 02:50
Replies: 0
Views: 366
Posted By carpetpool
Post Orders of consecutive elements does not exceed floor(sqrt(p))

For some prime p, let m = ordp(2) be the multiplicative order of 2 mod p, and m2 = ordp(3) be the order of 3 mod p. Let L be the least common multiple of m and m2 (L = lcm(m,m2)).

Does a prime p...
Forum: PARI/GP 2020-03-11, 01:07
Replies: 2
Views: 892
Posted By carpetpool
Post I've modified the code with some print...

I've modified the code with some print statements:

rset(n)={
prime_fact_r=[];
cr=1;
cr_max=round(log(n))^2;
q=2*round(log(log(n)));
while(cr<cr_max,
q=nextprime(q+1);
if(n^2%q!=1 &...
Forum: PARI/GP 2020-03-08, 01:05
Replies: 2
Views: 892
Posted By carpetpool
Post Comparison to ECPP?

For PARI/GP:

rset(n)={
prime_fact_r=[];
cr=1;
cr_max=round(log(n))^2;
q=2*round(log(log(n)));
while(cr<cr_max,
q=nextprime(q+1);
if(n^2%q!=1 & n%q!=0,
Forum: enzocreti 2020-03-03, 06:12
Replies: 1
Views: 278
Posted By carpetpool
Post IF N is odd, it can NEVER be congruent to -...

IF N is odd, it can NEVER be congruent to - (10^m*2^n) mod 216 (unless m and n are both zero), so I don't see the point to go any futher.
Forum: carpetpool 2020-03-03, 00:34
Replies: 3
Views: 338
Posted By carpetpool
Smile I was curious to find composites passing one of...

I was curious to find composites passing one of these two tests. To my suprise, not a single [p,a] pair with (p, |a|) < 100k!

(21:18) gp > for(p=1,100000, if(isprime(p)==0, for(a=1,p, D=a^2+4;...
Forum: carpetpool 2020-03-01, 20:43
Replies: 3
Views: 338
Posted By carpetpool
Post Yes, thanks for catching that. Indeed what I said...

Yes, thanks for catching that. Indeed what I said was false. I meant Jacobi(D | p) = -1 not Jacobi(a | p) = -1..

(12:34) gp > kronecker(D,p)
%43 = 1
(12:34) gp >

For a = 5, I found those in...
Forum: carpetpool 2020-03-01, 17:52
Replies: 3
Views: 338
Posted By carpetpool
Post Patterns in primes (no counterexamples)

Lemma: Let D = a^2+4 and p be a prime such that Jacobi(D | p) = -1.

Then
(x^2 + a*x - 1)^p = x^3 - x^2 + (a^2 + 2)*x - a^2 - 5 mod(p, x^4+D*x^2+D)
Or
(x^2 - a*x - 1)^p = x^3 - x^2 + (a^2 +...
Forum: enzocreti 2020-03-01, 02:10
Replies: 5
Views: 484
Posted By carpetpool
Post We cannot prove or disprove this at the moment,...

We cannot prove or disprove this at the moment, but it should be implied there exist infinitely many pairs by one of Dickinson's conjecture. The pattern continues:

(18:08) gp > g=[]; for(i=1,2000,...
Forum: enzocreti 2020-03-01, 02:02
Replies: 1
Views: 229
Posted By carpetpool
Post Ahhh, simple modular arithmetic: N = {344...

Ahhh, simple modular arithmetic:

N = {344 mod 559, 215 mod 1763} = 14319 mod 22919
N = {344 mod 559, 344 mod 1763} = 344 mod 22919

Now,

344 = 129 mod 215
14319 = 129 mod 215
Forum: Conjectures 'R Us 2020-02-23, 18:33
Replies: 804
Views: 61,055
Posted By carpetpool
Post Work in progress for R243 but here's what I got...

Work in progress for R243 but here's what I got so far.


8402*3^1000015-1 is not prime. RES64: 1083868805BDF281. OLD64: A595DEC63F84FDBB Time : 1059.216 sec.
6628*3^1000025-1 is not prime. ...
Forum: enzocreti 2020-02-23, 17:14
Replies: 5
Views: 484
Posted By carpetpool
Post You could always make one yourself if it doesn't...

You could always make one yourself if it doesn't exist:

(09:13) gp > g=[]; for(i=1,300, if(isprime(30*i^2-1), g=concat(g,i)))
(09:13) gp > g
%5 = [1, 3, 4, 10, 14, 17, 18, 21, 22, 25, 29, 34,...
Forum: carpetpool 2020-02-15, 20:06
Replies: 5
Views: 638
Posted By carpetpool
Post I can't seem to get away with it :down: (x -...

I can't seem to get away with it :down:

(x - 1)^(t*n + n) = x^n - 1 mod(n, x^r - 1) where t = 2*r*(n^((r - 1)/2) - 1) if jacobi(n | r) = -1
or
(x - 1)^(t*n + n) = x^n - 1 mod(n, x^r - 1) where...
Showing results 1 to 25 of 280

 
All times are UTC. The time now is 07:38.

Fri Jun 5 07:38:38 UTC 2020 up 72 days, 5:11, 0 users, load averages: 1.17, 1.21, 1.12

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, 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.