mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 25 of 1000
Search took 0.53 seconds.
Search: Posts Made By: axn
Forum: Cloud Computing 2020-08-10, 05:28
Replies: 1,003
Views: 44,537
Posted By axn
Yes, they fixed that within a day or so.

Yes, they fixed that within a day or so.
Forum: Wagstaff PRP Search 2020-08-09, 03:02
Replies: 386
Views: 33,570
Posted By axn
176k-177k

2^176021+1 = 33983817171714707083
2^176047+1 = 147239857768207753
2^176081+1 = 8800538544431775377603
2^176087+1 = 10673216986920486596130931
2^176089+1 = 203380380311264969
2^176161+1 =...
Forum: GPU Computing 2020-08-06, 05:23
Replies: 10
Views: 476
Posted By axn
For toe-dipping, entry level brand new GTX 1650...

For toe-dipping, entry level brand new GTX 1650 would be the better value. The performance difference (absolute and power efficiency) in mfaktc between 10xx & 16xx is no joke.
Forum: Puzzles 2020-08-05, 16:47
Replies: 27
Views: 856
Posted By axn
LOL. More like too dumb, too slow :smile: ...

LOL. More like too dumb, too slow :smile:

BTW, Interested in the your problem and solution approach.
Forum: Lounge 2020-08-05, 09:42
Replies: 3,958
Views: 235,422
Posted By axn
Real air vehicles have curves.

Real air vehicles have curves.
Forum: Puzzles 2020-08-05, 09:39
Replies: 27
Views: 856
Posted By axn
136110417:717547 173564051:717463

136110417:717547
173564051:717463
Forum: Puzzles 2020-08-05, 08:14
Replies: 27
Views: 856
Posted By axn
Minor improvements from brute force: ...

Minor improvements from brute force:
27275863:717813
93899447:717739
Forum: Puzzles 2020-08-03, 13:24
Replies: 27
Views: 856
Posted By axn
Iterating thru all odd numbers, starting from 3, ...

Iterating thru all odd numbers, starting from 3,
3:720673
9:720566
21:720169
59:720143
89:719926
127:719857
237:719477
261:719250
817:719025
Forum: Miscellaneous Math 2020-08-02, 16:47
Replies: 14
Views: 250
Posted By axn
Let's take m=1000 so we have the largest search...

Let's take m=1000 so we have the largest search space.

When N is about 1e5 bits, the first n that satisfies m*n > b is n_min~=4500, and b_max ~=4.5 million

When N is about 1e6 bits, it is n_min...
Forum: Miscellaneous Math 2020-08-02, 06:40
Replies: 14
Views: 250
Posted By axn
Ah! You're thinking 99% as an exact number,...

Ah! You're thinking 99% as an exact number, whereas I'm pretty sure OP intended to give the general flavor of the structure of the number. Meaning, b^n part is the dominant term.
Forum: Miscellaneous Math 2020-08-02, 06:38
Replies: 14
Views: 250
Posted By axn
That still leaves surprisingly large search...

That still leaves surprisingly large search space.

How big is N? Less than 1000 bits? More than million bits?

How small is m? Less than 1000? More than million?
Forum: Miscellaneous Math 2020-08-02, 06:05
Replies: 14
Views: 250
Posted By axn
"Size of N" is the digit length of N, which is...

"Size of N" is the digit length of N, which is basically O(log(N))
Forum: Miscellaneous Math 2020-08-02, 06:03
Replies: 14
Views: 250
Posted By axn
Sure, b can be composite. But a composite b must...

Sure, b can be composite. But a composite b must also pass a prime b check as a necessary condition.

For example, consider N=7*6^100+11. It will pass the b=2 check.

? N=7*6^100+11;
?...
Forum: Miscellaneous Math 2020-08-02, 02:23
Replies: 14
Views: 250
Posted By axn
That will not probably work. Due to the presence...

That will not probably work. Due to the presence of k, a large range of b's will be perfectly plausible for any given n.

I think we can slightly optimize the previous b-based approach to only look...
Forum: Miscellaneous Math 2020-08-01, 17:51
Replies: 14
Views: 250
Posted By axn
You have to start with b^k > |c| and check both...

You have to start with b^k > |c| and check both N%b^k and N%b^(k+1) are the same. Of course, without any size limits on b or c, this is going to take forever to rule out all potential b's.

If b &...
Forum: Factoring 2020-07-30, 10:14
Replies: 8
Views: 282
Posted By axn
Correct. Technically each curve has the same...

Correct. Technically each curve has the same chance of success, if there is a factor of appropriate size there to be found. But our apriori probability that there is such a factor gets lowered, every...
Forum: PARI/GP 2020-07-30, 09:54
Replies: 12
Views: 418
Posted By axn
No. You give a real valued expression in one...

No. You give a real valued expression in one variable, and it will find one real-valued solution where the expression becomes zero. So you recast your equation as 2^x-8=0 and just give the left side...
Forum: PARI/GP 2020-07-30, 07:52
Replies: 12
Views: 418
Posted By axn
? ?solve solve(X=a,b,expr): real root of...

? ?solve
solve(X=a,b,expr): real root of expression expr (X between a and b), where expr(a)*expr(b)<=0.

Your sample equation boils down to 2^x+1=0, which doesn't have real roots. Let's try with...
Forum: PrimeNet 2020-07-28, 17:03
Replies: 16
Views: 503
Posted By axn
... and the result will most likely be garbage.

... and the result will most likely be garbage.
Forum: Wagstaff PRP Search 2020-07-28, 16:58
Replies: 386
Views: 33,570
Posted By axn
175k-176k

2^175039+1 = 15484028432318997071449
2^175129+1 = 2888518630291839590281
2^175261+1 = 2848252779458437457
2^175493+1 = 325457568819025683667387
2^175493+1 = 75725050851772673224508113465282811...
Forum: Hardware 2020-07-28, 07:43
Replies: 13
Views: 386
Posted By axn
Ryzen 5 3600[XT] is 6-core 32MB part

Ryzen 5 3600[XT] is 6-core 32MB part
Forum: Forum Feedback 2020-07-25, 16:43
Replies: 4
Views: 243
Posted By axn
Ubuntu 20.04 >> Settings >> Appearance >> Window...

Ubuntu 20.04 >> Settings >> Appearance >> Window Colors >> Dark
Same thing.

But each website will still do its own thing.
Forum: Forum Feedback 2020-07-25, 12:40
Replies: 4
Views: 243
Posted By axn
Question Dark mode / theme / style

What would it take to get a dark mode / theme in the forum?
Forum: Math 2020-07-25, 04:17
Replies: 22
Views: 699
Posted By axn
Agreed. I did add two qualifiers in my statement,...

Agreed. I did add two qualifiers in my statement, "small multiplier" and "minimise ... significantly" for that reason.

There is one interesting observation, though. We know how to make the lowest...
Forum: Math 2020-07-25, 02:48
Replies: 22
Views: 699
Posted By axn
In my past trial/error of similar problems, the...

In my past trial/error of similar problems, the improvement was roughly O(log(#trial)*log(N)) bits. But it was bruteforce(running multipliers in sequence)/random methods. Maybe there is a better way...
Showing results 1 to 25 of 1000

 
All times are UTC. The time now is 06:52.

Tue Aug 11 06:52:04 UTC 2020 up 25 days, 2:38, 1 user, load averages: 2.10, 2.44, 2.58

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.