News for hackers. Stuff that matters.
Re:Project Euler by lll-o-lll on Thursday November 13, 2025 @03:52AM (#45912469)
Whelp, the opening “problem zero” stuffed me up.

> A number is a perfect square, or a square number, if it is the square of a positive integer. For example, is a square number because ; it is also an odd square. The first 5 square numbers are: , and the sum of the odd squares is . Among the first 881 thousand square numbers, what is the sum of all the odd squares?

I wanted to use Uiua, and hence:

/+ⁿ2+1⍜÷⇡ 2 881000

But Uiua doesn’t support big ints, just f64. So yuck, python to get an accurate answer. Just sad now.

Re:Project Euler by wodenokoto on Thursday November 13, 2025 @04:02AM (#45912541)
How did you get to problem 0? When I look at the list of problems it starts at 1: https://projecteuler.net/archives
Re:Project Euler by lll-o-lll on Thursday November 13, 2025 @04:41AM (#45912813)
It’s the “sign up” challenge
Re:Project Euler by janislaw on Thursday November 13, 2025 @04:07AM (#45912574)
This will become a practice of implementing bignums in your language of choice, which is a valuable exercise itself.
Re:Project Euler by gcanyon on Thursday November 13, 2025 @08:15AM (#45914539)
I did this (bignum) library for Livecode specifically for PE. https://github.com/gcanyon/bignum