June 23, 1988 is when we launched Version 1.0 of Mathematica. Today—almost 38 years later—we’re launching Version 15 of what—in recognition of how far it’s expanded beyond “math”—we now call Wolfram Language. It’s an impressive release, with a lot of new core functionality. It might perhaps seem (…)

The Erd?s unit distance problem asks for the largest possible number u(n) of unit distances among n points in the plane. This is equivalent to finding maximally dense unit-distance graphs. A recent OpenAI announcement concerns the asymptotic problem: the old n^(1+o(1)) expectation is false.

In or out of school, the opportunities to learn and grow in your career are endless, and Wolfram is proud to bolster those with educational resources, from courses to textbooks. We are happy to share conversations with two authors whose books cover applications of Wolfram technology in (…)

Every semester or two, students ask me about the implications of re-compression, especially of JPEG files. Compression comes in two main kinds—Lossless, which is completely invertible, meaning you get exactly what you put in when you decompress, and Lossy which ‘throws out’ things deemed (…)

I am writing a novel. It’s a historical fiction thing. Apparently, that means I need to do a lot of research on what life was like in the 1920s. ? My problem last night was, my character moves to Boston from Chicago, and in order to give the city texture, we need to introduce characters, […]