Discussion about math, puzzles, games and fun. Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ • π ƒ -¹ ² ³ °
You are not logged in.
Post a reply
Topic review (newest first)
By the way, I was looking over at Rosetta Code. There is a problem that attracts my attention. It's this one. How can it be done in M?
I remember that problem.
I solved that problem.
It is not a brilliant problem for L5.
I agree. It most certainly seems like a Brilliant problem.
Sounds like a Brilliant problem!
Actually you do not keep the entire list.
Oh, I get it. But, I do not think I am going to use the Harshad function so often that I need a list such as a prime list.
You keep a list and expand upon it each time you need a higher number. M keeps a very big list of primes in memory. But although it would be faster it is harder to program so stick with what you have there.
I still do not get it.
Sort of like using NextPrime.
By doing what M does.