I believe this was discussed previously in a sense but I thought I would bring up my two cents on how to approach the remaining tasks.

Judging by the amount of time it takes to complete a nx11 and nx12 set and basing on the premise that this project has a limited number of days (not in actuality but could happen if a major hardware failure takes place), would it not be prudent to run the nx7, nx8, nx9, and nx10 tasks first and then come back and do the nx11 and finally nx12? I feel as though it would ensure that the largest number of sets are complete should the unfortunate day come where the project goes offline for uncontrollable reasons as the admin warned us that the project is no longer supported by the university.

Again, I'm not telling anyone how to do their job, I'm just throwing my opinion out there and hoping to contribute as much as possible to mathematics through this projects as possible in the (potentially) limited time we have.

Keep on crunching!

I believe this was discussed previously in a sense but I thought I would bring up my two cents on how to approach the remaining tasks.

Judging by the amount of time it takes to complete a nx11 and nx12 set and basing on the premise that this project has a limited number of days (not in actuality but could happen if a major hardware failure takes place), would it not be prudent to run the nx7, nx8, nx9, and nx10 tasks first and then come back and do the nx11 and finally nx12? I feel as though it would ensure that the largest number of sets are complete should the unfortunate day come where the project goes offline for uncontrollable reasons as the admin warned us that the project is no longer supported by the university.

Again, I'm not telling anyone how to do their job, I'm just throwing my opinion out there and hoping to contribute as much as possible to mathematics through this projects as possible in the (potentially) limited time we have.

Keep on crunching!

Just to clarify, the project is supported by the university, but no new hardware will be approved. The SSD is relatively new, so we should be good for several more years, as the SSD is usually the first thing to go in a BOINC server.

The reasoning behind the ordering of the searches is driven by aspects of the algorithm. Congruences in the lower tiers are skipped if they are duplicated in the higher tier searches. For this reason, it is important to do the higher tier searches to guarantee everything has been covered for the entire row. In other words, it is more important to complete all columns in a row before moving on to the next row. I hope that helps explain the reasoning.

Understood, thanks for the clarification!

I believe this was discussed previously in a sense but I thought I would bring up my two cents on how to approach the remaining tasks.

Judging by the amount of time it takes to complete a nx11 and nx12 set and basing on the premise that this project has a limited number of days (not in actuality but could happen if a major hardware failure takes place), would it not be prudent to run the nx7, nx8, nx9, and nx10 tasks first and then come back and do the nx11 and finally nx12? I feel as though it would ensure that the largest number of sets are complete should the unfortunate day come where the project goes offline for uncontrollable reasons as the admin warned us that the project is no longer supported by the university.

Again, I'm not telling anyone how to do their job, I'm just throwing my opinion out there and hoping to contribute as much as possible to mathematics through this projects as possible in the (potentially) limited time we have.

Keep on crunching!

Just to clarify, the project is supported by the university, but no new hardware will be approved. The SSD is relatively new, so we should be good for several more years, as the SSD is usually the first thing to go in a BOINC server.

The reasoning behind the ordering of the searches is driven by aspects of the algorithm. Congruences in the lower tiers are skipped if they are duplicated in the higher tier searches. For this reason, it is important to do the higher tier searches to guarantee everything has been covered for the entire row. In other words, it is more important to complete all columns in a row before moving on to the next row. I hope that helps explain the reasoning.

2 hopefully short questions then:
1) if the Boinc Community paid for an hardware upgrades would that be acceptable?

2) Can you please explain a little more basically to this non math guy what you mean by " In other words, it is more important to complete all columns in a row before moving on to the next row." ie VERY basically, so if you have holes in the nx7 column why does it make sense to finish the nx11 column first and then go back to the nx7 column? Are you saying we are closer to finish nx11 and since nx7 has more holes its for later on? Is it too hard to do both at once, or is that beyond the capabilities due to the rules from ASU?

I believe this was discussed previously in a sense but I thought I would bring up my two cents on how to approach the remaining tasks.

Judging by the amount of time it takes to complete a nx11 and nx12 set and basing on the premise that this project has a limited number of days (not in actuality but could happen if a major hardware failure takes place), would it not be prudent to run the nx7, nx8, nx9, and nx10 tasks first and then come back and do the nx11 and finally nx12? I feel as though it would ensure that the largest number of sets are complete should the unfortunate day come where the project goes offline for uncontrollable reasons as the admin warned us that the project is no longer supported by the university.

Again, I'm not telling anyone how to do their job, I'm just throwing my opinion out there and hoping to contribute as much as possible to mathematics through this projects as possible in the (potentially) limited time we have.

Keep on crunching!

Just to clarify, the project is supported by the university, but no new hardware will be approved. The SSD is relatively new, so we should be good for several more years, as the SSD is usually the first thing to go in a BOINC server.

The reasoning behind the ordering of the searches is driven by aspects of the algorithm. Congruences in the lower tiers are skipped if they are duplicated in the higher tier searches. For this reason, it is important to do the higher tier searches to guarantee everything has been covered for the entire row. In other words, it is more important to complete all columns in a row before moving on to the next row. I hope that helps explain the reasoning.

2 hopefully short questions then:
1) if the Boinc Community paid for an hardware upgrades would that be acceptable?

2) Can you please explain a little more basically to this non math guy what you mean by " In other words, it is more important to complete all columns in a row before moving on to the next row." ie VERY basically, so if you have holes in the nx7 column why does it make sense to finish the nx11 column first and then go back to the nx7 column? Are you saying we are closer to finish nx11 and since nx7 has more holes its for later on? Is it too hard to do both at once, or is that beyond the capabilities due to the rules from ASU?

1.) Last I asked, the answer to that was no. I believe it was some kind of university policy.

2.) Rows and columns refer to the 2D batch status. The MxN search is basically the same as the Mx(N+1) search, but the Mx(N+1) has a larger discriminant bound so it finds more but also takes longer. Any shared congruences are redundant, so we remove those from the smaller discriminant case. So completing Mx(N+1) guarantees we have also completed MxN. The same principle applies to the other dimension of the matrix, so completing (M+1)xN is important in order to guarantee MxN is complete.

I hope that answers the question and is not too long winded.

I believe this was discussed previously in a sense but I thought I would bring up my two cents on how to approach the remaining tasks.

Judging by the amount of time it takes to complete a nx11 and nx12 set and basing on the premise that this project has a limited number of days (not in actuality but could happen if a major hardware failure takes place), would it not be prudent to run the nx7, nx8, nx9, and nx10 tasks first and then come back and do the nx11 and finally nx12? I feel as though it would ensure that the largest number of sets are complete should the unfortunate day come where the project goes offline for uncontrollable reasons as the admin warned us that the project is no longer supported by the university.

Again, I'm not telling anyone how to do their job, I'm just throwing my opinion out there and hoping to contribute as much as possible to mathematics through this projects as possible in the (potentially) limited time we have.

Keep on crunching!

Just to clarify, the project is supported by the university, but no new hardware will be approved. The SSD is relatively new, so we should be good for several more years, as the SSD is usually the first thing to go in a BOINC server.

The reasoning behind the ordering of the searches is driven by aspects of the algorithm. Congruences in the lower tiers are skipped if they are duplicated in the higher tier searches. For this reason, it is important to do the higher tier searches to guarantee everything has been covered for the entire row. In other words, it is more important to complete all columns in a row before moving on to the next row. I hope that helps explain the reasoning.

2 hopefully short questions then:
1) if the Boinc Community paid for an hardware upgrades would that be acceptable?

2) Can you please explain a little more basically to this non math guy what you mean by " In other words, it is more important to complete all columns in a row before moving on to the next row." ie VERY basically, so if you have holes in the nx7 column why does it make sense to finish the nx11 column first and then go back to the nx7 column? Are you saying we are closer to finish nx11 and since nx7 has more holes its for later on? Is it too hard to do both at once, or is that beyond the capabilities due to the rules from ASU?

1.) Last I asked, the answer to that was no. I believe it was some kind of university policy.

2.) Rows and columns refer to the 2D batch status. The MxN search is basically the same as the Mx(N+1) search, but the Mx(N+1) has a larger discriminant bound so it finds more but also takes longer. Any shared congruences are redundant, so we remove those from the smaller discriminant case. So completing Mx(N+1) guarantees we have also completed MxN. The same principle applies to the other dimension of the matrix, so completing (M+1)xN is important in order to guarantee MxN is complete.

I hope that answers the question and is not too long winded.

It does AND I understand now, thank you VERY much!!