Musned<p>🧑💻 Write a script to “Find the sum of all the multiples of 3 or 5 below 1000” in O(1), i.e. constant time.<br>The solution is simple and elegant, try it out.</p><p>This problem is from <a href="https://mastodon.online/tags/ProjectEuler" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ProjectEuler</span></a>. <br><a href="https://mastodon.online/tags/coding" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>coding</span></a> <a href="https://mastodon.online/tags/math" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>math</span></a> <a href="https://mastodon.online/tags/python" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>python</span></a> <a href="https://mastodon.online/tags/haskell" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>haskell</span></a></p>