Forum: Software
2021-01-11, 01:35
|
|
Replies: 543
Views: 65,872
|
|
Forum: Puzzles
2021-01-05, 07:03
|
|
Replies: 13
Views: 1,414
|
|
Forum: And now for something completely different
2020-12-22, 02:18
|
|
Replies: 8
Views: 833
|
|
Forum: Software
2020-12-03, 04:52
|
|
Replies: 4
Views: 1,173
|
|
Forum: Puzzles
2020-10-23, 06:41
|
|
Replies: 31
Views: 4,320
Cannot say about the origin. The badge could...
Cannot say about the origin. The badge could belong to a group, trade organization etc. It could just be for decorative purposes.
Oil lamp = Service
Lightning bolt= Illumination
Statue of...
|
|
Forum: Puzzles
2020-10-02, 05:47
|
|
Replies: 34
Views: 5,927
|
|
Forum: Software
2020-09-24, 05:31
|
|
Replies: 118
Views: 21,267
|
|
Forum: Software
2020-09-24, 03:45
|
|
Replies: 118
Views: 21,267
Robert, I think you are correct. I came to the...
Robert, I think you are correct. I came to the same conclusion when reviewing the code. Though for sr1sieve there would not be any need to calculate b^d (mod p) for particular d values as there is no...
|
|
Forum: Software
2020-09-21, 17:26
|
|
Replies: 118
Views: 21,267
I am looking at BestQ code
uint32_t ...
I am looking at BestQ code
uint32_t GenericSubsequenceHelper::RateQ(uint32_t Q, uint32_t s)
{
uint32_t baby, giant, work;
ChooseSteps(&baby, &giant, Q, s);
|
|
Forum: Software
2020-08-22, 03:48
|
|
Replies: 118
Views: 21,267
|
|
Forum: Software
2020-08-22, 02:12
|
|
Replies: 118
Views: 21,267
Calculating best Q for srsieve2.exe
Moving this from the other thread:
A faster automated way of finding the bestQ would be
1) Set BASE_MULTIPLE to the gcd of differences of all consecutive terms left
For N1, N2, N3, N4, ......
|
|
Forum: Software
2020-08-18, 23:02
|
|
Replies: 543
Views: 65,872
All candidates in post below need Q >720 ...
All candidates in post below need Q >720
https://www.mersenneforum.org/showpost.php?p=355682&postcount=4
You can read the posts in the above thread (towards the end). We were finding benefit of...
|
|
Forum: Software
2020-08-18, 17:53
|
|
Replies: 543
Views: 65,872
Feature request for srsieve2.exe
In...
Feature request for srsieve2.exe
In CisOneSubsequenceHelper.cpp can you create an option to bypass the code to calculate the ii_BestQ if the user can use the -Q flag and specify it from the...
|
|
Forum: Math
2020-08-05, 05:31
|
|
Replies: 23
Views: 9,343
|
|
Forum: Puzzles
2020-08-05, 03:57
|
|
Replies: 28
Views: 9,828
|
|
Forum: Math
2020-08-05, 03:16
|
|
Replies: 23
Views: 9,343
Your idea seems interesting!
If we could...
Your idea seems interesting!
If we could find a N with low hammer weight then we can use it for testing all p-1 candidates again and again so this would be useful. We could use dynamic programming...
|
|
Forum: Miscellaneous Math
2020-08-02, 07:25
|
|
Replies: 14
Views: 4,287
|
|
Forum: Miscellaneous Math
2020-08-02, 06:11
|
|
Replies: 14
Views: 4,287
Your point for prime b makes sense. Thanks.
...
Your point for prime b makes sense. Thanks.
For small k values and large n values only 1-2 b values will be possible.
For small n a large number of b values will be possible.
I am more...
|
|
Forum: Miscellaneous Math
2020-08-02, 05:48
|
|
Replies: 46
Views: 10,042
I am not sure if you are aware or not - your...
I am not sure if you are aware or not - your sequence is a recursive quadratic polynomial. You can just specify the seed and the depth level.
x_next=f(x) where f(x)=x^2-x+1
2-->3-->7-->43-->
...
|
|
Forum: Miscellaneous Math
2020-08-02, 05:23
|
|
Replies: 14
Views: 4,287
|
|
Forum: Miscellaneous Math
2020-08-01, 18:35
|
|
Replies: 14
Views: 4,287
Thanks.
A faster way might be to to :- ...
Thanks.
A faster way might be to to :-
calculate max_n = log(N)/log(2)
then for all n from 2 to max_n you calculate corresponding b value (use log to solve)
int(N^(1/n))=b
Since this is...
|
|
Forum: Miscellaneous Math
2020-08-01, 16:08
|
|
Replies: 14
Views: 4,287
Power number
Given a natural number N is there a fast way to test if the number is of the form k*b^n+-c where b^n contributes to 99% size of N; c<m*n where m is small.
Brute force could be one way:-...
|
|
Forum: Math
2020-07-30, 12:01
|
|
Replies: 23
Views: 9,343
1. correction:Replace p-1 with smallest n such...
1. correction:Replace p-1 with smallest n such that 2^n==1 (mod p). Then calculate the LCM
2. 2^1, 2^2, 2^3, ..., 2^7920 (mod 23#) -- only consider terms greater than 23# otherwise the number is...
|
|
Forum: Math
2020-07-30, 03:22
|
|
Replies: 23
Views: 9,343
Discrete log:-
You need to take LCM of p-1 of...
Discrete log:-
You need to take LCM of p-1 of all the prime factors p1,p2, in p#
LCM=3960
Then you take 2^1...2^3960 (mod N#) find the number with least number of '1' and that is your solution.
...
|
|
Forum: Math
2020-07-29, 03:12
|
|
Replies: 23
Views: 9,343
I am not sure if I understand your question...
I am not sure if I understand your question correctly.
From what I understand you are looking for X*N# where the number of '1' bits are very low.
Another way of phrasing this problem would be:...
|
