mersenneforum.org January 2022
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

2022-01-10, 06:06   #12
Max0526

"Max"
Jun 2016
Toronto

25·29 Posts

Quote:
 Originally Posted by Walter Just to add on to my previous response: the number of primes that can be generated with the max and min wheel in my solution corresponds to the same values that Zoozie posted (741 primes for the min wheel and 1992 primes for the max wheel). Now, to be fair, I see multiple wheels that generate the same number of primes, but it gives me some additional confidence that my solution is right.
If I skip 5 and 8 in my circle: PRIMES: 1860, CMAX = 21258 > 19690.
Greater number of primes doesn't necessarily mean higher score of the circle.
Also, below 8300 for the min so far.

 2022-01-10, 07:33 #13 Walter   "Walter S. Gisler" Sep 2020 Switzerland 11112 Posts Oops. I had hard coded something for the n=7/d=5 case. After changing this, I am getting the following values: min: 8265 max: 23209 Anyone else getting those values?
 2022-01-10, 11:17 #14 Zoozie   Jan 2021 2×3 Posts I avoided posting the scores since this could make people skip exhaustive search to find the solution.
2022-01-10, 13:23   #15
Max0526

"Max"
Jun 2016
Toronto

92810 Posts

Quote:
 Originally Posted by Walter Oops. I had hard coded something for the n=7/d=5 case. After changing this, I am getting the following values: min: 8265 max: 23209 Anyone else getting those values?
Got the same min/max!
Quote:
 Originally Posted by Zoozie It took about 2 minutes to solve in java for n=7,d=5. I did not really optimize except first generating cache of small primes. The n=8, d=6 was solved in some hours, did not time it. For n=8, d=6: wheeel for maximum solution had 1992 primes wheel for minimum solution had 741 primes.
And the same number of primes!

Last fiddled with by Max0526 on 2022-01-10 at 13:44

 2022-01-10, 17:11 #16 Max0526   "Max" Jun 2016 Toronto 11101000002 Posts Just for the fun of it, anybody wants to try coding n = 9, d = 7 and n = 10, d = 8 cases?
2022-01-11, 12:58   #17
Walter

"Walter S. Gisler"
Sep 2020
Switzerland

3×5 Posts

Quote:
 Originally Posted by Max0526 Just for the fun of it, anybody wants to try coding n = 9, d = 7 and n = 10, d = 8 cases?
With n = 9, d = 7 I get the following values:

min: 117390
max: 194304

And with n = 10, d = 8:

min: 1747537
max: 1772281

The runtime was about 13000 seconds for the n = 9 case. For the n = 10 case, I used 4 threads, which resulted in a runtime of 12400 seconds.

 2022-01-11, 13:54 #18 Max0526   "Max" Jun 2016 Toronto 11101000002 Posts Code: With n = 9, d = 7 I get the following values: min: 117390 max: 194304 And with n = 10, d = 8: min: 1747537 max: 1772281 Massive amount of computation is done here! I need to rewrite Python into Java to be able to compete with your run times. Will post my results when it's done. Send these min/max results to IBM too. Sometimes they award **.
2022-01-11, 22:47   #19
SmartMersenne

Sep 2017

7·19 Posts

Quote:
 Originally Posted by Max0526 Send these min/max results to IBM too. Sometimes they award **.
Not with the new puzzlemaster. He is lazy to do anything extra or even the minimum expected things on time.

2022-01-12, 07:47   #20
Zoozie

Jan 2021

2×3 Posts

Quote:
 Originally Posted by SmartMersenne Not with the new puzzlemaster. He is lazy to do anything extra or even the minimum expected things on time.

Agree! He updates scores only 2 times a month. We can still not see who has solved this month.

Also solution to December challenge still gives a 404.

2022-01-12, 19:27   #21
Max0526

"Max"
Jun 2016
Toronto

25×29 Posts

Quote:
 Originally Posted by Zoozie Agree! He updates scores only 2 times a month. We can still not see who has solved this month. Also solution to December challenge still gives a 404.
Both are available as of this morning.

Last fiddled with by Max0526 on 2022-01-12 at 19:27

2022-01-17, 14:09   #22
dg211

Jun 2016

110002 Posts

I get the same answers for n = 9, d = 7 and n = 10, d = 8. It is possible to do it with a lot less computation - my single threaded C++ code took about 3.5s for n = 9, d = 7 and about 32s for n = 10, d = 8. Almost all of the time for n = 10 (like 31.9s) was spent generating a list of 8 digit primes.

Quote:
 Originally Posted by Walter With n = 9, d = 7 I get the following values: min: 117390 max: 194304 And with n = 10, d = 8: min: 1747537 max: 1772281 The runtime was about 13000 seconds for the n = 9 case. For the n = 10 case, I used 4 threads, which resulted in a runtime of 12400 seconds.

 Similar Threads Thread Thread Starter Forum Replies Last Post gd_barnes Conjectures 'R Us 5 2022-07-18 04:01 rogue Conjectures 'R Us 15 2021-12-19 21:20

All times are UTC. The time now is 05:01.

Sat Aug 20 05:01:20 UTC 2022 up 2 days, 2:29, 0 users, load averages: 1.33, 1.24, 1.20

Copyright ©2000 - 2022, 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.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎𝜍 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔