## Wolfram Language, the Language of Mathematica is now Free!

The language that powers Mathematica is now available for free! Head here or here to read more about this new release. Or go straight to the download page to start tinkering with it.

The language that powers Mathematica is now available for free! Head here or here to read more about this new release. Or go straight to the download page to start tinkering with it.

Dipping into Lists

A more appropriate heading for this would be “How a logical truth can be a lexical lie”, but hey, gotta have that clickbaity title. But nevertheless, I will frame this article as if I am addressing the title.

Apparently, sociologists/psychologists classify lies with a three tier system; primary, secondary, and tertiary. According to an article on Psychology Today, children as young as 2-3 tell have developed the ability to tell lies. And children of age 7-8 have developed the skill to tell what is dubbed “tertiary lies”, which are lies that are *“more consistent with known facts and follow-up statements”. *

But how does telling a lie relate to mathematics? And exactly what tools can you use for such?

There exists a branch of logic, where logic is a branch of math, called propositional logic. Propositional logic is all about combining statements. A statement is something you proclaim, that is either true or false.…

…I recently saw a post on Quora asking what people generally find exciting about Linear Algebra, and it really took me back, since Linear Algebra was the first thing in the more modern part of mathematics that I fell in love with, thanks to Dr Erwin. I decided to write a Mathemafrica post on concepts that I believe are foundational in Linear Algebra, or at least concepts whose beauty almost gets me in tears (of course this is only a really small part of what you would expect to see in a proper first Linear Algebra course). I did my best to keep it as fluffy as I saw necessary. I hope you will find some beauty as well in the content. If not, then maybe it will be useful for the memes. The post is incomplete as it stands. It has been suggested that this can be made more accessible to a wider audience than as it stands by possibly building up on it, so I shall work on that, but for now, enjoy this!

I’ve been getting a lot of questions about absolute values, and so I thought I would try and clarify things here as much as possible. I’ll give some basic definitions and intuition, and then go through some examples, from easier to harder.

The absolute value function is just….a function. You give it a number, and it returns a number. In the same way that is a function. You give it a number and it returns that number multiplied by itself. So the absolute value function, which we write as takes a number and returns the same number if the number was positive, and the negative of the number if it was negative, thus returning always a positive number.

We can think of this as the function “how far away from the point 0 (the origin) on the real number line is x?”. It doesn’t care about what direction it is, only how far away it is.…

NB. I was sent this book as a review copy.

This book is without a doubt the most enjoyable, stimulating book of mathematical physics (and occasionally more pure branches of maths) puzzles that I have ever read. It’s essentially a series of cleverly, and occasionally fiendishly put-together mathematics and physics challenge questions, each of which gets you thinking in a new and fascinating way.

The level of mathematics needed is generally only up to relatively basic calculus, though there is the occasional diversion into a slightly more complex area, though anyone with basic first year university mathematics, or even a keen high school student who has done a little reading ahead, would be able to get a lot from the questions.

I found that there were a number of ways of going through the questions. Some of them are enjoyable to read, and simply ponder. For me, occasionally figuring out what should be done, without writing anything down, was enough to be pretty confident that I saw the ingenuity in the puzzle and the solution and I was happy to leave it at that.…

Recall the definition of a group:

A set G is “upgraded” into a **group** if it satisfied the following axioms under **one** binary operation (*) :

- Closure:
- Associativity:
- Identity:
- Inverse:

An **Abelian group** is a group that is follows the axioms 1 – 4 with the addition of one property:** **

- Commutativity:

In addition to the axioms, the following properties of groups are important to note:

- Uniqueness of the identity element
- Uniqueness of the inverse element
- Cancellation law
- Inverse property (extended)

Uniqueness of an element in mathematics means there exists only one such element with that property. We prove uniqueness by making an assumption that there are two elements in the set that satisfy the property, and show that if such a situation holds, then the two elements must be equal!

We use * to denote the binary operation between elements and “QED” to signal the end of the proof.

The remainder of the post aims to go through the proofs of these properties!…

**Binary operations** are operations such as addition, subtraction, multiplication, division, modulus etc. that are applied to two quantities.

example 1: is an example of an expression with addition as the binary operation

example 2: Let f and g be functions defined on sets A to B. Then the composition of the functions is a binary operation

We will use * to denote an arbitrary (general) binary operation.

A set G is “upgraded” into a **group** if it satisfied the following axioms under **one** binary operation (*) :

- Closure:
- Associativity:
- Identity:
- Inverse:

An **Abelian group** is a group that is follows the axioms 1 – 4 with the addition of one property:** **

- Commutativity:

For the remainder of this post, we will explore these axioms and look at some examples

Closure:

This means we can take any elements in the set G and perform the operation defined by * and the result will also be an element in the group.…

Prove that for every positive integer , is divisible by 64.

This question screams proof by induction, so we start with the base case, which in this case is :

which is indeed divisible by 64.

Now, let’s assume that it holds true for some positive integer . ie:

for .

Now let’s see how we can use this to prove that the statement holds true for . For we have:

where we have manipulated the expression to contain the left hand side of the inductive hypothesis. Thereby, plugging in the inductive hypothesis, we get:

but clearly is an integer, so this is divisible by 64 and thus the statement holds true for , thus it holds true for all positive integers

The question is as follows:

If and and , find .

So, let’s think about the information given and what we are trying to find. We want to find the complex number which satisfies this slightly strange set of constraints, and the constraints are given in terms of and . So, by the looks of things, the answer will depend on and so the final expression should be a function of .

Now let’s explore the constraints. In fact, let’s simply take and as two complex numbers, but importantly two numbers which differ only by a real number , so wherever they lie in the complex plane, they have the same imaginary part and differ only by an real part.

Now, the constraints are about the arguments of the two complex numbers. It doesn’t tell us anything about the magnitude of the numbers, so all the information tells us is the direction are in relation to the origin.…