Embed Notice

HTML Code

<blockquote style="position: relative; padding-left: 55px;"><section><a href="https://mathstodon.xyz/users/julesh/statuses/113713077818632495">julesh (julesh@mathstodon.xyz)'s status on Wednesday, 25-Dec-2024 19:51:11 JST</a><a href="https://mathstodon.xyz/@julesh" title="julesh@mathstodon.xyz"><img src="https://gnusocial.jp/avatar/180791-48-20231002164329.webp" width="48" height="48" alt="julesh" style="position: absolute; left: 0; top: 0;">julesh</a><div><a href="https://mathstodon.xyz/@julesh/113713052244363539" rel="in-reply-to">in reply to</a></div></section><article><p>Here is a funny Haskell implementation:<br>ghci&gt; let foo n = sum [p*q | p &lt;- [0..n], q &lt;- [0..n], p + q == n + 1]</p></article><footer><a rel="bookmark" href="https://gnusocial.jp/conversation/4253176#notice-8312496">In conversation</a><time datetime="2024-12-25T19:51:11+09:00" title="Wednesday, 25-Dec-2024 19:51:11 JST">about a month ago</time> <span>from <span><a href="https://mathstodon.xyz/@julesh/113713077818632495" rel="external" title="Sent from mathstodon.xyz via ActivityPub">mathstodon.xyz</a></span></span><a href="https://mathstodon.xyz/@julesh/113713077818632495">permalink</a><h4>Attachments</h4><ol><li><label><a rel="external" href="https://gnusocial.jp/attachment/3772996">ghci&gt; map foo [0 .. 100]
[0,1,4,10,20,35,56,84,120,165,220,286,364,455,560,680,816,969,1140,1330,1540,1771,2024,2300,2600,2925,3276,3654,4060,4495,4960,5456,5984,6545,7140,7770,8436,9139,9880,10660,11480,12341,13244,14190,15180,16215,17296,18424,19600,20825,22100,23426,24804,26235,27720,29260,30856,32509,34220,35990,37820,39711,41664,43680,45760,47905,50116,52394,54740,57155,59640,62196,64824,67525,70300,73150,76076,79079,82160,85320,88560,91881,95284,98770,102340,105995,109736,113564,117480,121485,125580,129766,134044,138415,142880,147440,152096,156849,161700,166650,171700]</a></label><br><a href="https://media.mathstodon.xyz/media_attachments/files/113/713/076/423/668/727/original/a1a4d8bb2c23cfc4.png" rel="external">https://media.mathstodon.xyz/media_attachments/files/113/713/076/423/668/727/original/a1a4d8bb2c23cfc4.png</a></li></ol></footer></blockquote>

Corresponding Notice

Embed this notice
julesh (julesh@mathstodon.xyz)'s status on Wednesday, 25-Dec-2024 19:51:11 JST julesh
in reply to
Here is a funny Haskell implementation:
ghci> let foo n = sum [p*q | p <- [0..n], q <- [0..n], p + q == n + 1]
In conversationabout a month ago from mathstodon.xyzpermalink
Attachments
1. ghci> map foo [0 .. 100] [0,1,4,10,20,35,56,84,120,165,220,286,364,455,560,680,816,969,1140,1330,1540,1771,2024,2300,2600,2925,3276,3654,4060,4495,4960,5456,5984,6545,7140,7770,8436,9139,9880,10660,11480,12341,13244,14190,15180,16215,17296,18424,19600,20825,22100,23426,24804,26235,27720,29260,30856,32509,34220,35990,37820,39711,41664,43680,45760,47905,50116,52394,54740,57155,59640,62196,64824,67525,70300,73150,76076,79079,82160,85320,88560,91881,95284,98770,102340,105995,109736,113564,117480,121485,125580,129766,134044,138415,142880,147440,152096,156849,161700,166650,171700]
  https://media.mathstodon.xyz/media_attachments/files/113/713/076/423/668/727/original/a1a4d8bb2c23cfc4.png

Public

Embed Notice

HTML Code

Corresponding Notice