mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 25 of 96
Search took 0.02 seconds.
Search: Posts Made By: JM Montolio A
Forum: Forum Feedback 2018-12-16, 22:48
Replies: 1,050
Views: 110,846
Posted By JM Montolio A
msg deleted

msg deleted
Forum: Forum Feedback 2018-12-16, 22:45
Replies: 1,050
Views: 110,846
Posted By JM Montolio A
msg deleted.

msg deleted.
Forum: Forum Feedback 2018-12-16, 22:42
Replies: 1,050
Views: 110,846
Posted By JM Montolio A
msg deleted

msg deleted
Forum: enzocreti 2018-12-16, 22:37
Replies: 157
Views: 3,669
Posted By JM Montolio A
The prime numbers dont follows any rule. ...

The prime numbers dont follows any rule.

They are the small few survivors after all the rules applied.

At infinite only the gap fills the black space, and they looks like lonely stars.
Forum: Forum Feedback 2018-12-16, 22:11
Replies: 1,050
Views: 110,846
Posted By JM Montolio A
Forum: Forum Feedback 2018-12-16, 22:02
Replies: 1,050
Views: 110,846
Posted By JM Montolio A
Question Im computing DedekindNumber(9)

Someone owns a Cray?

Thanks.
Forum: Forum Feedback 2018-12-16, 21:59
Replies: 1,050
Views: 110,846
Posted By JM Montolio A
Question Two questions.

How to send a msg to moderators?

I get troubles updating my email.

Someone knows a website to search for people
interested on computing Dedekind Numbers?

Thanks.
Forum: Forum Feedback 2018-12-16, 21:55
Replies: 1,050
Views: 110,846
Posted By JM Montolio A
Question About computing Dedekind(9)

Hi.

How to send a msg to the moderators team?
I get troubles using my account.
I cant update the email address.

Someone knows what is the right website
to search for people interested on ...
Forum: Miscellaneous Math 2018-12-11, 15:22
Replies: 8
Views: 1,044
Posted By JM Montolio A
Thumbs up What means TL , DR, OP ?

" I'd love to see calculation ideas"

Well, Im computing D(n) for last 4 months.
Today best options i have are x-compressed sets and computing shorcuts.
I find many others interesting ways but i...
Forum: Miscellaneous Math 2018-03-09, 09:20
Replies: 18
Views: 821
Posted By JM Montolio A
Are the cumulative product of (B^g). ...

Are the cumulative product of (B^g).

Starting with 1.

And not the last step.

Thats gives "bits one of D"="number steps".

Rules are related to tserie used.
Forum: Miscellaneous Math 2018-03-09, 09:12
Replies: 18
Views: 821
Posted By JM Montolio A
Are the cumulative product of (B^g). Last...

Are the cumulative product of (B^g).

Last step not.
Forum: Miscellaneous Math 2018-03-08, 19:50
Replies: 18
Views: 821
Posted By JM Montolio A
Not. 29(5^M)-11=13D. 13 + 11 = (5^0)*24...

Not.

29(5^M)-11=13D.

13 + 11 = (5^0)*24
13 + 24 = (5^0)*37
13 + 37 = (5^2)*2
13 + 2 = (5^1)*3
13 + 3 = (5^0)*16
13 + 16 = (5^0)*29.
Forum: Miscellaneous Math 2018-03-08, 19:15
Replies: 18
Views: 821
Posted By JM Montolio A
and you get something with log(), pi, i, etc. ...

and you get something with log(), pi, i, etc.
Not.

Solve: 29(5^m)-11 = 13*D
Forum: Miscellaneous Math 2018-03-08, 17:46
Replies: 18
Views: 821
Posted By JM Montolio A
Type? Integer, of course. Solutions? The first...

Type? Integer, of course.
Solutions? The first m.
Forum: Miscellaneous Math 2018-03-08, 09:07
Replies: 18
Views: 821
Posted By JM Montolio A
Smile How to solve: k(b^m)-z=n*d. ?

How to solve: k(b^m)-z=n*d. ?

With know values for k,b,z,n.
Forum: Miscellaneous Math 2018-03-07, 11:46
Replies: 10
Views: 921
Posted By JM Montolio A
You never sleeps ?

You never sleeps ?
Forum: Miscellaneous Math 2018-03-07, 11:42
Replies: 28
Views: 1,549
Posted By JM Montolio A
Question I suspect M(n) = znorder( Mod( 2,n) ). M...

I suspect M(n) = znorder( Mod( 2,n) ).

M properties proof that Mersenne numbers are square free.

Properties of znorder must also proof it.

I think.
Forum: Miscellaneous Math 2018-03-07, 11:36
Replies: 10
Views: 921
Posted By JM Montolio A
Question Whats is a fast algorithm for compute znorder(Mod(2,p)).

whats is a fast algorithm for compute znorder(Mod(2,p)).
for p prime but big.
Forum: Miscellaneous Math 2018-03-07, 09:45
Replies: 25
Views: 2,848
Posted By JM Montolio A
I never find any rule for primes. I believe...

I never find any rule for primes.

I believe that is the only rule true here.

If you detect a rule, wrong way.
Forum: Lounge 2018-03-06, 19:20
Replies: 11
Views: 1,138
Posted By JM Montolio A
About "best in life?". For me is "Never stop...

About "best in life?". For me is "Never stop trying."
I supose for you must be "Never stop trying... divisors."

:-)
Forum: Miscellaneous Math 2018-03-06, 19:02
Replies: 23
Views: 1,350
Posted By JM Montolio A
"so far, failed,.... Dr. Sarcasticus." n ...

"so far, failed,.... Dr. Sarcasticus."


n 3 M 2 Dbit 1 D 1
n 5 M 4 Dbit 2 D 3...
Forum: Information & Answers 2018-03-06, 18:48
Replies: 14
Views: 3,673
Posted By JM Montolio A
Give me reasons to use a supercomputer for GIMPS....

Give me reasons to use a supercomputer for GIMPS. Many apps for a HPC are medical. Molecular Design. Chemicals. Physics simulation. Math modeling. Math equations. But for NT, few users. System...
Forum: Miscellaneous Math 2018-03-06, 18:35
Replies: 23
Views: 1,350
Posted By JM Montolio A
I put some trace on the code. n 3 n 3...

I put some trace on the code.

n 3
n 3 + e 1 = (2^g 2)(e' 1)
n 3 M 2 Dbit 1 D 1

n 5
n 5 + e 1 = (2^g 1)(e' ...
Forum: Miscellaneous Math 2018-03-06, 18:03
Replies: 23
Views: 1,350
Posted By JM Montolio A
Well. Step to step, Doc. I think M() can have...

Well. Step to step, Doc.
I think M() can have one full correct axiomatic definition. BUT ALSO I post the pseudocode, at other forum. And the C code here. The theory of the M function start solving...
Forum: Miscellaneous Math 2018-03-06, 10:37
Replies: 23
Views: 1,350
Posted By JM Montolio A
Question The C code for M() function.

On the zip the C code.

gcc -o ..
Showing results 1 to 25 of 96

 
All times are UTC. The time now is 11:12.

Sat Nov 28 11:12:40 UTC 2020 up 79 days, 8:23, 3 users, load averages: 1.37, 1.26, 1.17

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.