The title of this article is clearly borrowed from Richard Feynman and is the name given to his first selection of highlights from The Feynman Lectures on Physics. Then Feynman borrowed the phrase from Stravinsky, who borrowed it from Haydn, who no doubt borrowed it from someone else, so the upshot of all this plagiarism is that I don’t feel too bad about the process. In any case, my six easy pieces are responses to questions posed on Q&A site Quora. All were written within a few months of this article being published and all are connected to other articles on this site. Some have been revised or extended somewhat from their original form. They are presented in reverse chronological order.
PIECE 1: Can a Group have an Odd Number of Elements?
For an introduction to the important and beautiful Mathematical concept of Groups, please see Glimpses of Symmetry, Chapter 2 – What is a Group?
I’d like you to consider three things (please note in each case it is important to state both the Group’s set and the binary operator applied to members of this set).
The Group of Rotations of an Equilateral Triangle under Composition
What we are interested in is rotations that leave the triangle in a position indistinguishable (without labelling) to where it started. The first row of mini-diagrams above shows such rotations happening to an equilateral triangle. Speaking of labels, the triangle above has its vertices labelled so we can see what happens when we turn it. The second row of mini-diagrams are maps of starting and ending vertices. So with a turn of clockwise, the red vertex is now where the green vertex used to be. With a turn of , the red vertex is now where the blue vertex used to be and so on.
A few points:
- We just have clockwise rotations here. Obviously a turn of clockwise is the same as a turn of anticlockwise, so we don’t need both.
- The first column of the diagram shows a rotation of , or equivalently , both of which mean that the ending position is the same as the starting one – even with labelling.
- If we do one clockwise turn of , followed by a second one, this is the same as one clockwise turn of . Equally two clockwise turns of are the same as one clockwise turn of .
- Finally both a clockwise turn of , followed by a clockwise turn of (or vice versa) and three clockwise turns of either or are the same as the “do nothing” rotation of .
These observations are enough to show that this is a Group (see Glimpses of Symmetry, Chapter 3 – Shifting Shapes for a full proof).
The order of this Group, which is called or Cyclic Group Three, is clearly , an odd number.
One example is enough to show that Groups can have an odd order, but let’s not stop here.
The Group of Integers under Addition Modulo 3
Addition modulo some number is about remainders. A brief refresher.
Consider Natural Numbers , and . Then we say that divides remainder if there exists a fourth Natural Number such that:
So divides remainder because:
When we talk about Natural Numbers (or typically Integers) modulo 3, we mean that all we care about is what the remainder is and nothing else. To illustrate:
because:
or:
because:
We can see that using modulo 3 we reduce all Natural Numbers (or again Integers) to the set which is precisely the remainders that can occur when dividing by .
We assert that this set (typically labelled as one of , , or ) forms a Group under addition. A full proof (for the generic case ) is provided in a section of Glimpses of Symmetry, Chapter 2 – What is a Group?, but let’s just note the following here:
This should give you a good sense that our assertion is true and we have found a second Group of odd order 3.
Again, let’s not stop here.
The Group of Cube Roots of Unity under Multiplication
The equation:
may be written as:
In this form, it is a polynomial of degree . As such it must have precisely roots. In this case, one is a Real Number and the other two are Complex Numbers, the full set of cube roots is:
Obviously cubing any of these numbers, by definition, gets us back to . What about some other multiplications?
In general, if we set , then we can write the three elements of our set as .
Again I will assert that this is a Group (see a section of Glimpses of Symmetry, Chapter 11 – Root of the Problem for a proof of the genic case of roots of unity).
The Group of the cube roots of unity is of order as well, so we have yet another example of a Group of odd order.
In closing, a couple of observations.
- Each of the Groups we have met above generalises to a degree of and this obviously includes all of the format (aka odd numbers). So the rotation Group of a regular heptagon is of order . The Natural Numbers modulo is a Group of order . The thirty-first roots of unity form a Group of order . And so on… That’s a lot of Groups of odd order.
- As the attentive reader may have noticed, all of the Groups we dealt with above are essentially the same Mathematical object in different clothes. Formally we say that the Groups are isomorphic to each other, which means that they share the same “shape” and properties. We will leave a further exploration of isomorphisms for another day.
PIECE 2: Is 55 a Prime or a Composite Number?
So the initial reaction is of course “why on Earth are you wasting everyone’s time with trivial questions like this?” But then I recall my three-year-old daughter asking me earlier today “how do car engines work?” and I think, “maybe it’s worth providing a proper answer”, so here we go:
Let’s start with some definitions. The Natural Numbers are the set:
Consider two Natural Numbers, and . is said to be a Factor of if there exists some third Natural Number, , such that:
When using letters (or mixing letters and numbers), we often elide the sign and instead write:
For example. is a factor of as:
But is not a factor of as there is no Natural Number, , such that:
Of course gives the right answer, but is not a Natural Number, it’s a Rational Number, so doesn’t count (pun intended).
We can also list the factors of , i.e. ( is a factor of any Natural Number and any Natural Number is a factor of itself, hence and appear in this list) and note the number of them, i.e. six.
OK, with that groundwork completed, on to a definition of Prime Numbers.
A Prime Number is a Natural Number with precisely two factors. A moment’s thought will lead us to conclude that these must be the number itself and .
This definition also implies that is not Prime as it has precisely one factor, not two.
However, is a Prime Number as its only factors are .
The first ten Prime Numbers are:
However, as proved by Euclid ^{[1]}, they go on for ever. Putting it another way, there are an infinite number of Primes.
It can be shown ^{[2]} that any Natural Number can be decomposed to a product of Prime factors, one that is unique up to the order of multiplication (e.g. is the same as ).
By way of contrast, a Composite Number is a Natural Number with more than two factors. By listing its six factors above, we have shown that is therefore a Composite Number.
So what about ?
Well you don’t have to be a Fields Medalist to note that:
with both and being Prime. Thus its factors are . As there are four of these, is a Composite Number.
PIECE 3: Can 996 be Divided by 2?
I’m going to take a leap of faith and explain this as I might to my three-year-old.
First you probably mean that the thing you are dividing by is what is colloquially known as a whole number ^{[3]} (something like , or , or ). I could quite happily divide by or even if I wanted to.
Second what you probably mean is divided with no remainder. So divided by is with no remainder as but divided by is with a remainder of as .
Here is the thing, every whole number is either a multiple of and another whole number (and hence divisible by with no remainder) or more than a multiple of and another whole number (divisible by remainder ). According to which category a whole number falls, it is called even (divisible by with no remainder) or odd (divisible by with remainder ).
That is, if is a whole number, there is some other whole number, , such that one of the following holds:
All the even numbers end in one of . All the odd numbers end in one more, so . Your number ends in , so it is even and thus divisible by .
PIECE 4: How can be Irrational if is Equal to a Circle’s Circumference over its Diameter??
It sounds as if you need to read The Irrational Ratio.
First some related questions:
- How can the hypotenuse of a right angled triangle where the two shorter sides are of length one be irrational?
- How can the area of a regular pentagon with sides of length one be irrational?
- How can the Golden Ratio be irrational – it even has “ratio” in the name for heavens sake?
The answer is that Irrational does not mean “not a ratio” and instead means “not a Rational Number”. Rational Numbers are a specific type of ratio, one that might be termed ratios of whole numbers (as wooly a term as that might be). Specifically Rational Numbers are the set:
Where is the Integers and is the Natural Numbers.
We then have that none of , , , or ^{[4]} are Rational Numbers. Neither is that most seminal of numbers, , or Euler’s Number.
In fact, the vast majority of Real Numbers are Irrational, so is in very good (and very numerous) company.
PIECE 5: How Many Sides does a Circle have?
A circle can be thought as the limit ^{[5]} of a sequence of regular polygons whose number of sides increases.
If we inscribe a square in a circle, then it is not a great approximation to the circle. If we double the number of sides, we get an inscribed octagon. This more closely approximates the circle. Double again and we get a -gon, which is closer to a circle again. A -gon is closer than a -gon and so on.
If we define the perimeter of a regular -gon inscribed in a circle with unit radius (where is a Natural Number) as and its number of sides as , then we have:
and
Then tells us that, in the limit, the polygons become a circle. tells us that, in the limit, the number of sides is infinite. The latter suggests that the number of sides of a circle is infinite.
However if we introduce a third concept, to denote the length of one of the sides of our -gon, then we also have:
So each of the sides of our limiting polygon consists of a line segment (if we can call it that) of length zero. It is unclear – to say the least – that we can claim that these are really sides. Given this, the number of sides would be zero.
There are things to be said about both answers, but if we define a side as something with a non-zero length, then stating that a circle has no sides feels like the more accurate statement.
PIECE 6: Could you Convert an Imaginary Number to Real Number?
Convert sort of implies that the number is somehow the same, but now Real. That’s the same as saying that I can convert to by adding . Clearly this “conversion” changes the number. The same goes for any imaginary number. You can do all sorts of things to an imaginary number (one of the form where ) to make it Real, but it won’t be the same number anymore.
There is a well known isomorphism ^{[6]}:
If we have just an imaginary number , then we have:
This is getting close to a Real number, it includes the same Real twice, albeit one entry being the negative of the other. That’s as close as you are going to get in my opinion ^{[7]}.
<< | The Irrational Ratio | Six More Easy Pieces | >> |
Part of the peterjamesthomas.com Maths and Science archive. |
Notes
^{ [1]} | A version of Euclid’s proof is laid out in a section of A Brief Taxonomy of Numbers. |
^{ [2]} | An outline proof of the Prime Factorisation Theorem is provided in a section of Glimpses of Symmetry, Chapter 8 – Simplicity. |
^{ [3]} | Either Natural Number or Integer might work better. |
^{ [4]} | is the symbol given to the Golden Ratio: |
^{ [5]} | See a section of Euler’s Number for an overview of limits. |
^{ [6]} | Actually what I have written here is a bit misleading, or rather my use of the term isomorphism is not entirely accurate. First I am comparing the Complex Numbers to the General Linear Group of degree 2. In order to treat as a Group under multiplication, I need to exclude (see a section of Glimpses of Symmetry, Chapter 7 – Imaginary Battleships for a proof). Also, the range of our function is not all of , but rather the Subgroup indicated by the general form of the matrices. An isomorphism could also be between and the designated matrices, where both are treated as Fields as well of course, but simmilar comments would still apply. |
^{ [7]} | There is also a formulation that eschews matrices and instead defines the binary operation differently from normal multiplication, but the two structures are equivalent. |
Text & Images: © Peter James Thomas 2018. |