Hi all!
Dipping my toes into APL.
I have written a solution to [Project Euler problem 1](https://projecteuler.net/problem=1), which asks for the sum of all multiples of 3 or 5, below 1000:
`euler1 ← {+/ ⍸ 0 = (3 | ⍳ (⍵ - 1)) ^ (5 | ⍳ (⍵ - 1))}`
`euler1 10` gives 23, the sum of 3, 5, 6 and 9, as described in the problem there.
It seems like it should be possible to simplify my solution a bit.
I have watched a couple of Conor Hoekstra's videos, among others, so I have seen this concept of forks, for example.