mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 25 of 1000
Search took 0.15 seconds.
Search: Posts Made By: Citrix
Forum: Puzzles 2020-10-23, 06:41
Replies: 31
Views: 1,393
Posted By Citrix
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: 2,522
Posted By Citrix
Possible hint if I understand the question...

Possible hint if I understand the question correctly (I agree that the language is not very clear).


Hint:...
Forum: Software 2020-09-24, 05:31
Replies: 61
Views: 6,773
Posted By Citrix
I tried to replace mulmod by powmod to avoid...

I tried to replace mulmod by powmod to avoid unnecessary multiplication. I get an error during run time. Any idea why the calculations are not being done correctly?


void ...
Forum: Software 2020-09-24, 03:45
Replies: 61
Views: 6,773
Posted By Citrix
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: 61
Views: 6,773
Posted By Citrix
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: 61
Views: 6,773
Posted By Citrix
I modified sr1sieve to read any Q from command...

I modified sr1sieve to read any Q from command line and got significant benefit for low weight series. I am trying to combine the benefit with your faster FPU/AVX code.

The problem modifying...
Forum: Software 2020-08-22, 02:12
Replies: 61
Views: 6,773
Posted By Citrix
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: 457
Views: 37,690
Posted By Citrix
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: 457
Views: 37,690
Posted By Citrix
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: 3,279
Posted By Citrix
Thinking about this further... all primes in B1...

Thinking about this further... all primes in B1 are not necessary and it does not need to be an absolute multiple of powersmooth(1000000). Some primes can be twice, some three times etc.

Turning...
Forum: Puzzles 2020-08-05, 03:57
Replies: 28
Views: 3,560
Posted By Citrix
This should follow a binomial distribution-I...

This should follow a binomial distribution-I suspect. Though no proof as bits are not independent.
Forum: Math 2020-08-05, 03:16
Replies: 23
Views: 3,279
Posted By Citrix
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: 1,512
Posted By Citrix
N~ 100,000 bits + m <1000 We could also...

N~ 100,000 bits +
m <1000

We could also define k and c to be less than 2^64.
Forum: Miscellaneous Math 2020-08-02, 06:11
Replies: 14
Views: 1,512
Posted By Citrix
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: 4,754
Posted By Citrix
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: 1,512
Posted By Citrix
Why? b can be composite. eg. 7*6^100+11

Why? b can be composite.

eg. 7*6^100+11
Forum: Miscellaneous Math 2020-08-01, 18:35
Replies: 14
Views: 1,512
Posted By Citrix
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: 1,512
Posted By Citrix
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: 3,279
Posted By Citrix
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: 3,279
Posted By Citrix
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: 3,279
Posted By Citrix
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:...
Forum: Software 2020-07-17, 23:57
Replies: 35
Views: 4,622
Posted By Citrix
Could someone post a 64 bit windows console...

Could someone post a 64 bit windows console binary. Thanks.
Forum: Software 2020-07-03, 06:06
Replies: 457
Views: 37,690
Posted By Citrix
Since 8+2=10 You can do it by 2 bitshift...

Since 8+2=10

You can do it by 2 bitshift operations, 1 addition, 3-4 compare operations, 1 subtraction. Still faster than fkbnsieve for each individual n.
Forum: Software 2020-06-22, 04:39
Replies: 457
Views: 37,690
Posted By Citrix
I downloaded the latest version of mtsieve and...

I downloaded the latest version of mtsieve and compiled it. gcwsievecl.exe does work and did not crash. :smile:

The cl code is not working properly. I will play with it and let you know.

The...
Forum: Software 2020-06-21, 23:09
Replies: 457
Views: 37,690
Posted By Citrix
I tried your file. I have to copy the CL...

I tried your file.
I have to copy the CL folder to mtsieve for it to compile.
gcwsievecl still crashes.
Showing results 1 to 25 of 1000

 
All times are UTC. The time now is 20:33.

Wed Nov 25 20:33:54 UTC 2020 up 76 days, 17:44, 3 users, load averages: 1.50, 1.58, 1.60

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.