q){sum x where 0=min x mod/:(3,5)}til 1000 k) {+/ &: 0=min x {x-y*x div y}/:(3,5)}(!)1000
or mix and match without lambdas is even shorter and more obfuscated q)sum (&:) 0=min ((!)1000) mod/: (3,5)
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
q){sum x where 0=min x mod/:(3,5)}til 1000
k) {+/ &: 0=min x {x-y*x div y}/:(3,5)}(!)1000
or mix and match without lambdas is even shorter and more obfuscated
q)sum (&:) 0=min ((!)1000) mod/: (3,5)