mathstodon.xyz is one of the many independent Mastodon servers you can use to participate in the fediverse.
A Mastodon instance for maths people. We have LaTeX rendering in the web interface!

Server stats:

2.7K
active users

#projecteuler

0 posts0 participants0 posts today
Matthew Slowe<p>A little bit of playing around in <a href="https://infosec.exchange/tags/Go" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Go</span></a> with some of the <a href="https://infosec.exchange/tags/ProjectEuler" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ProjectEuler</span></a> problems I'd not done before... and I quite like it. Certainly seems easier to get my head around than <a href="https://infosec.exchange/tags/rust" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>rust</span></a> </p><p>Note: I'm not looking to start a Go vs Rust debate... just that I've played a little with both and have found Go easier to work with for the things I've tried.</p><p><a href="https://infosec.exchange/tags/GoLang" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>GoLang</span></a> <a href="https://infosec.exchange/tags/RustLang" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>RustLang</span></a></p>
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>
LangerJan<p>Mein. Gott. <a href="https://chaos.social/tags/ProjectEuler" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ProjectEuler</span></a></p>
Akshar Varma<p>A few years ago, I had solved a lot of Project Euler problems <a href="https://mathstodon.xyz/tags/ProjectEuler" class="mention hashtag" rel="tag">#<span>ProjectEuler</span></a> problems in <a href="https://mathstodon.xyz/tags/Python" class="mention hashtag" rel="tag">#<span>Python</span></a>. I even had a lot of very useful utility functions to make things more modular and easier.</p><p>After seriously starting to learn <a href="https://mathstodon.xyz/tags/Haskell" class="mention hashtag" rel="tag">#<span>Haskell</span></a> sometime last year, I&#39;ve been slowly translating that old code. I translated the utility functions as a way to learn the new language. I made a lot of progress this week on the problems themselves and I&#39;ve realized how much better it is in Haskell.</p><p>Of course, a part of it is that I&#39;ve changed as a programmer, but the old Python code looks ugly compared to what I&#39;m now writing in Haskell. The functional paradigm with lazy evaluation seems to fit perfectly with the kind of problems on Project Euler.</p><p>My only &quot;complaint&quot; is that memoization is harder in Haskell. However, that&#39;s because I haven&#39;t spent any time figuring out how to do that well. It is not a language issue, but a me issue.</p><p>I&#39;ve definitely decided that I&#39;ll be finishing my &quot;solve substantial problems on Project Euler&quot; goal in Haskell and not use Python for that anymore.</p>
Graciano é entusiasta do ócio<p>I just did 2*3*4*5*6**7*8*9*10 to see the result like a moron</p><p>I am sutdying <a href="https://burnthis.town/tags/projectEuler" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>projectEuler</span></a> on rust, *please* do not send spoilers or suggestions</p>
LangerJan<p>The <a href="https://chaos.social/tags/ProjectEuler" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ProjectEuler</span></a> experience: You cannot even rely on formulas from Wikipedia. For real.</p>
LangerJan<p>I dare you to solve just one <a href="https://chaos.social/tags/ProjectEuler" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ProjectEuler</span></a> today:</p><p><a href="https://projecteuler.net/problem=836" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="">projecteuler.net/problem=836</span><span class="invisible"></span></a></p><p>(difficulty: 0-5% - for real, I swear)</p>
Mᴀʀᴋ VᴀɴᴅᴇWᴇᴛᴛᴇʀɪɴɢ<p>Finished the first hundred challenges in <a href="https://mastodon.social/tags/projecteuler" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>projecteuler</span></a>. Now, the next 100.</p>
Alejandro Baez<p><span class="h-card" translate="no"><a href="https://mastodon.online/@teotwaki" class="u-url mention" rel="nofollow noopener noreferrer" target="_blank">@<span>teotwaki</span></a></span> thank you! I haven't done these in a while, so I'm definitely lacking in these type of events. I used to do the <a href="https://fosstodon.org/tags/ProjectEuler" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ProjectEuler</span></a> problems daily for years... 😅 But that was years ago. 🤣</p><p>My bet however, this time was mostly time to do it. I had to squeeze between family and work. So like an hour to 2 hours a day at most. Else it was past midnight the next shot. 🫠</p>
CJ<p>I started doing <a href="https://alpha.polymaths.social/tags/projecteuler" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ProjectEuler</span></a> again today, and I keep coming up with awful solutions that take like 10 minutes to compute...</p><p>But on the bright side, said insane compute time led me to dive into the Sieve of Eratosthenes algorithm and get it working in Python because finding primes is hard.</p><p>Proud of myself since I hate doing math usually!</p>
Jaro Reinders<p>Solving Project Euler problem 1 in pure lambda calculus is not that hard:</p><p><a href="https://gist.github.com/noughtmare/7397c8821a8e8b12ff88ab04c8696983" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">gist.github.com/noughtmare/739</span><span class="invisible">7c8821a8e8b12ff88ab04c8696983</span></a></p><p><a href="https://social.edu.nl/tags/projecteuler" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>projecteuler</span></a> <a href="https://social.edu.nl/tags/lambdacalculus" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>lambdacalculus</span></a> <a href="https://social.edu.nl/tags/haskell" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>haskell</span></a></p>
Hamish Rickerby<p><strong>Project Euler 001</strong></p> <p><a href="https://peertube.nz/videos/watch/9675d2fa-3f7c-4be5-a0b0-61f3aaa271f0" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">peertube.nz/videos/watch/9675d</span><span class="invisible">2fa-3f7c-4be5-a0b0-61f3aaa271f0</span></a></p>
Alessandro<p>considerata "l'amicizia" di <a href="https://livellosegreto.it/tags/crystallang" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>crystallang</span></a> e <a href="https://livellosegreto.it/tags/ruby" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ruby</span></a> sto aggiungendo anche qualche scriptino in Ruby appunto.</p><p><a href="https://livellosegreto.it/tags/projecteuler" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>projecteuler</span></a></p>
Alessandro<p>Aggiornamento <a href="https://livellosegreto.it/tags/projecteuler" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>projecteuler</span></a> </p><p>Visto che siamo in 16(😢) a giocare con <a href="https://livellosegreto.it/tags/crystallang" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>crystallang</span></a>, alla fine ho pensato di raccogliere le soluzioni in un repo su framagit!<br>Non che le mie soluzioni siano particolarmente originali ed esemplari ma, magari possono essere utili, chissà! Condividere inoltre potrebbe aiutarmi a trovare la spinta per andare avanti senza mollare subito 😂</p><p>Qualche soluzione è anche in C (volevo vedere se ricordavo qualcosina dopo molti anni 😅)</p><p><a href="https://framagit.org/alephoto85/project-euler" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">framagit.org/alephoto85/projec</span><span class="invisible">t-euler</span></a></p><p><a href="https://livellosegreto.it/tags/programmazione" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>programmazione</span></a></p>
Alessandro<p>Iniziato Project Euler finalmente 🤣 (per ora con <a href="https://livellosegreto.it/tags/crystallang" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>crystallang</span></a> )</p><p>Esiste troppa roba interessante 😅</p><p><a href="https://projecteuler.net/" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="">projecteuler.net/</span><span class="invisible"></span></a></p><p><a href="https://livellosegreto.it/tags/projecteuler" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>projecteuler</span></a> <a href="https://livellosegreto.it/tags/programmazione" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>programmazione</span></a> <a href="https://livellosegreto.it/tags/dev" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>dev</span></a></p>
jeeger<p>Doing <a href="https://mastodon.social/tags/projecteuler" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>projecteuler</span></a> with <a href="https://mastodon.social/tags/clojure" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>clojure</span></a> has left me with an inability to write non-tailrecursive code.</p>
jeeger<p>Back on my Bullshit (<a href="https://mastodon.social/tags/projecteuler" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>projecteuler</span></a>).</p>
Rogue<p><a href="https://defcon.social/tags/10ThingsILoveRightNow" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>10ThingsILoveRightNow</span></a></p><p>- <a href="https://defcon.social/tags/CLion" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>CLion</span></a> <br>- <a href="https://defcon.social/tags/ProjectEuler" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ProjectEuler</span></a> <br>- <a href="https://defcon.social/tags/NoStarchPress" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>NoStarchPress</span></a> books<br>- <a href="https://defcon.social/tags/HogwartsLegacy" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>HogwartsLegacy</span></a> <br>- <a href="https://defcon.social/tags/Todoist" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Todoist</span></a> <br>- <a href="https://defcon.social/tags/Daylio" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Daylio</span></a> <br>- <a href="https://defcon.social/tags/Therapy" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Therapy</span></a> <br>- <a href="https://defcon.social/tags/BearApp" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>BearApp</span></a> <br>- <a href="https://defcon.social/tags/11ty" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>11ty</span></a><br>- <a href="https://defcon.social/tags/PrusaSlicer" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>PrusaSlicer</span></a></p>
Hongyu Yang<p>It's not a hard question per se but seeing I am one of the 3369 people who managed to solve this question still makes me feel proud of myself🥹</p><p>(From tomorrow on I'll work in my school library on my webinar project rather than solving algorithm questions in a coffeeshop🥺)</p><p><a href="https://mastodon.social/tags/algorithm" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>algorithm</span></a> <a href="https://mastodon.social/tags/mathematics" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>mathematics</span></a> <a href="https://mastodon.social/tags/projecteuler" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>projecteuler</span></a></p>
Hongyu Yang<p>Hey uhhh I'm sorry I'm procrastinating again today but let's go over how I approached this question.<br><a href="https://mastodon.social/tags/math" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>math</span></a> <a href="https://mastodon.social/tags/algorithm" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>algorithm</span></a> <a href="https://mastodon.social/tags/optimization" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>optimization</span></a> <a href="https://mastodon.social/tags/projecteuler" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>projecteuler</span></a></p>