Return to Answer

In 1979, when Wolfram was 20, he got his PHD. He thought that he need a better CAS than Macsyma to do physics, and then began to write SMP (the "Symbolic Manipulation Program"). In 1981, the first version of SMP was released. SMP was the predecessor of Mathematica. Though it had a deep influence on Mathematica, none of its code was ever used for Mathematica.

In 1986, Wolfram decided to write an "ultimate computation system". He began to write the code in 1986, and founded the Wolfram Research in 1987. And finally, Mathematica 1.0 was released on June 23, 1988.

Mathematica 1.0 http://blog.stephenwolfram.com/data/uploads/2013/06/1b.png

I didn't find Mathematica 1.0. In fact, Mathematica 1.0 had neither a Windows nor a Linux version. However, I found Mathematica 2.0 on a Chinese website. It can still run on Windows XP.

We can't write f[i_, 1 | i_ | n] = "N" because Alternatives was introduced in Mathematica 2.0. Still, it shows the power of pattern matching.

Or we can implement the Euclidean algorithm, using pattern matching:

All the functions above are introduced in Mathematica 1.0.

Wolfram got his PHD in 1979, when he was 20. He thought that he needed a better CAS than Macsyma to do physics, so he began to write SMP (the "Symbolic Manipulation Program"). The first version of SMP was released in 1981. SMP was the predecessor of Mathematica. Though it had a deep influence on Mathematica, none of its code was ever used for Mathematica.

In 1986, Wolfram decided to write an "ultimate computation system". He started writing the code in 1986, and founded the Wolfram Research in 1987. Finally, Mathematica 1.0 was released on June 23, 1988.

I didn't find Mathematica 1.0. In fact, Mathematica 1.0 had neither a Windows nor a Linux version. But I found Mathematica 2.0 on a Chinese website. It can still be run on Windows XP.

We can't write f[i_, 1 | i_ | n] = "N" because Alternatives was introduced in Mathematica 2.0.

Or we can use the Euclidean algorithm with pattern matching:

All the functions above were introduced in Mathematica 1.0.

Just like Julia and R, this is a matrix solution. In Mathematica, you can define a sparse matrix using pattern matching.

Just like Julia and R, this is a matrix solution. In Mathematica, you can define a sparse matrix using pattern matching.

gcd[a_, 0] := a
gcd[a_, b_] := gcd4[b, Mod[a, b]]

gcd[a_, 0] := a
gcd[a_, b_] := gcd[b, Mod[a, b]]