mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 12 of 12
Search took 0.01 seconds.
Search: Posts Made By: bhelmes
Forum: Miscellaneous Math 2020-09-29, 22:05
Replies: 29
Views: 3,390
Posted By bhelmes
A peaceful and pleasant night for you, I...

A peaceful and pleasant night for you,


I have primes p ~ 120 bits big,

I want to factorize p-1,
I do a f=gcd (8*9*25*7*11*13*17*19*23*29*31*37*41, p-1) and
check wether 2^[(p-1)/f]=1 mod p...
Forum: Miscellaneous Math 2020-08-28, 20:35
Replies: 29
Views: 3,390
Posted By bhelmes
I have some datas up to 2^40 for the primesieving...

I have some datas up to 2^40 for the primesieving for the polynomial

f(n)=2n²-1;
http://devalco.de/quadr_Sieb_2x%5E2-1.php#4a


I think the density of "non reducible primes" (p=f(n))
is an...
Forum: Miscellaneous Math 2020-08-09, 15:49
Replies: 29
Views: 3,390
Posted By bhelmes
A peaceful day for you, LaurV ...

A peaceful day for you, LaurV






I think I will use the function f(n)=2n²-1 from n=1 up to 2^40,
will calculating the factors / primes f(m) with f>m and will storing the m for each f, will...
Forum: Miscellaneous Math 2020-07-21, 22:54
Replies: 29
Views: 3,390
Posted By bhelmes
In general : let f(n)=2n²-1 f(n0)=r ...

In general :

let f(n)=2n²-1

f(n0)=r

then the substitution is n=f(n0)*k+n0 with the following division by f(n0)


I think I will combine the sieving algorithm with the prediction by adding...
Forum: Miscellaneous Math 2020-07-20, 20:20
Replies: 29
Views: 3,390
Posted By bhelmes
A peaceful evening for you, perhaps my...

A peaceful evening for you,

perhaps my mathematical skill is not the best in explaining,
but i am sure that the math behind it is right.

Therefore I try again to explain it and will give an...
Forum: Miscellaneous Math 2020-05-21, 08:58
Replies: 29
Views: 3,390
Posted By bhelmes
A peaceful day for you, LaurV who should...

A peaceful day for you, LaurV


who should type a 20 digits example ?

I will give a second example which is working:


f(n)=n²+1
f(92)=5*1693
Forum: Miscellaneous Math 2020-05-20, 20:07
Replies: 29
Views: 3,390
Posted By bhelmes
A peaceful and pleasant night for you, ...

A peaceful and pleasant night for you,

Perhaps I should explain the algorithm and the solution a little bit better.


I have the factorisation of
f(n)=n²+1=r*p where r element of N and p is...
Forum: Miscellaneous Math 2020-05-16, 20:04
Replies: 29
Views: 3,390
Posted By bhelmes
A peaceful and pleasant night for you, ...

A peaceful and pleasant night for you,




Yes, there is a mathematical possibility:


f(x)=x²+1
f(27)=10*73
Forum: Miscellaneous Math 2020-05-09, 18:56
Replies: 29
Views: 3,390
Posted By bhelmes
if p=x²+1 then x | p-1 if p | (x²+1) ???...

if p=x²+1 then x | p-1


if p | (x²+1) ???


Can I calculate q=x²+1 with q=r*p and x and r known; then f | p-1 ; f ???


If someone knows a good answer would be very nice to get it.
Forum: Miscellaneous Math 2020-05-07, 21:47
Replies: 29
Views: 3,390
Posted By bhelmes
A peaceful and pleasant night for you, if...

A peaceful and pleasant night for you,


if I regard only the primes p>=5 with p=x²+1 (x>1) and
the primes p with p | (x²+1 ) with p > x


can i derive any suggestion about the factorisation...
Forum: Miscellaneous Math 2019-09-17, 14:20
Replies: 29
Views: 3,390
Posted By bhelmes
A peaceful day for you, Let f(n)=2n²-1, n...

A peaceful day for you,


Let f(n)=2n²-1, n elem. of N


i am looking for p|f(n) with p prime and t|(p-1) with t is prime and t > 56 bits


can i make a better estimation than
Forum: Miscellaneous Math 2019-08-26, 19:57
Replies: 29
Views: 3,390
Posted By bhelmes
factorisation for p-1, p is prime

A peaceful evening for everyone,


is the factorisation of p-1, where p is prime, mathematical an easier problem
than the factorisation of f*g, where f and g are unknown primes ?


Thanks in...
Showing results 1 to 12 of 12

 
All times are UTC. The time now is 04:17.

Thu Oct 1 04:17:26 UTC 2020 up 21 days, 1:28, 0 users, load averages: 1.98, 2.24, 2.10

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.