Discussion about math, puzzles, games and fun.   Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ • π ƒ -¹ ² ³ °

You are not logged in.

Write your message and submit
|
Options

Topic review (newest first)

bobbym
2013-07-07 22:16:35

Hi;

I can provide the core commands but you must tell how you want the game to be played.

anonimnystefy
2013-07-07 19:10:29

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?

bobbym
2013-07-07 17:54:24

I remember that problem.

Agnishom
2013-07-07 17:49:44

I solved that problem.

BTW, I have a 17 MB list of primes, so I did not have to compute the primes again

bobbym
2013-07-07 17:16:36

It is not a brilliant problem for L5.

You do not need the whole list to speed everything up but you do not require it for a program that run infrequently. CSBFC.

anonimnystefy
2013-07-07 15:23:20

I agree. It most certainly seems like a Brilliant problem.

Agnishom
2013-07-07 14:49:50

anonimnystefy wrote:

I want to find the 1000th Harshad number in base 5.

Sounds like a Brilliant problem!

anonimnystefy
2013-07-07 13:12:05

No?

bobbym
2013-07-07 11:01:07

Actually you do not keep the entire list.

anonimnystefy
2013-07-07 06:02:56

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.

bobbym
2013-07-07 05:42:52

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.

anonimnystefy
2013-07-07 05:39:53

I still do not get it.

bobbym
2013-07-07 05:02:39

Sort of like using NextPrime.

anonimnystefy
2013-07-07 05:00:40

Hm?

bobbym
2013-07-07 04:56:37

By doing what M does.