https://charlesreid1.com/w/index.php?action=history&feed=atom&title=Project_Euler%2F234 2026-06-19T11:36:30Z Revision history for this page on the wiki MediaWiki 1.39.12 https://charlesreid1.com/w/index.php?title=Project_Euler/234&diff=30625&oldid=prev 2026-06-17T21:19:08Z

<p>Create Project Euler/234 - Semidivisible Numbers (via create-page on MediaWiki MCP Server)</p> <p><b>New page</b></p><div>==Problem Statement==<br /> <br /> &#039;&#039;&#039;Semidivisible Numbers&#039;&#039;&#039;<br /> <br /> For an integer n ≥ 4, we define the lower prime square root of n, denoted by lps(n), as the largest prime ≤ √n and the upper prime square root of n, ups(n), as the smallest prime ≥ √n.<br /> <br /> So, for example, lps(4) = 2 = ups(4), lps(1000) = 31, ups(1000) = 37.<br /> <br /> Let us call an integer n ≥ 4 semidivisible, if one of lps(n) and ups(n) divides n, but not both.<br /> <br /> The sum of the semidivisible numbers not exceeding 15 is 30, the numbers are 8, 10 and 12. 15 is not semidivisible because it is a multiple of both lps(15) = 3 and ups(15) = 5. As a further example, the sum of the 92 semidivisible numbers up to 1000 is 34825.<br /> <br /> What is the sum of all semidivisible numbers not exceeding 999966663333?<br /> <br /> ==Flags==<br /> <br /> {{ProjectEulerFlag}}</div>

Admin