"The poet only asks to get his head into the heavens. It is the logician who seeks to get the heavens into his head. And it is his head that splits." G.K. Chesterton

Sunday, May 30, 2010

UNSAFE PROFANATION


An artist doesn't need a lecture on the value of art or the creative process in general. It is a blessing of the muses, a charitable gesture of serendipity for which all artists yearn like junkies. Why is that? Because both the creative process and inspiration are what an artist's soul feeds on and is defined by, which makes them sacred. They're sacred gifts whose value largely springs from their ephemeral and inconsistent nature due to the muses' capriciousness.

Therefore it seems natural that to a genuine apprentice of the muses the acquisition of a respect for the value of this gift and the recognition of its instantiations in the form of "perceivable artworks" is inevitable. It follows that the role of an art school should be both to aid the apprentice of the muses to evoke the longing for this gift, and nurture a respect for its instantiations.

It has come to my attention that during a recent social function at the Queensland College of Art (Griffith University), students have been physically tampering with an unfinished sculpture of one of their absent colleagues. This included climbing on the sculpture en masse, and ultimately soiling it with sand and what appears to be alcohol. Whereas such behavior should be generally labeled as disrespectful or thoughtless in the least, within the artistic community it is nothing short of a profanation.

One may be tempted to endorse a more sympathetic stance, and claim that the students deserve a measure of consideration due to their sheer ignorance. As a proof of their naivety serves the fact that by publishing their photos of the function's activities on Facebook, they did not care to exclude those of the sculpture being tampered with. To the contrary, judging by the number of photographs depicting the activity in question, it seems that it was one of the evening's highlights. Imagine the fury of young "Phidias" upon discovering that the profanation of the progeny of his inspiration served as a vehicle of base amusement to a herd of intoxicated morons.

Pleading ignorance, may get the students off the hook, but the story does not end there. A senior  lecturer and a PhD student were present at the function, as evidenced by the published photographs, which makes them passive participants. What is one to say of the ignorance of those senior figures of an artistic and academic institution? Why didn't they react? Did they succumb to a momentary primitive group think? Were they so overwhelmed by the libations as to be completely oblivious of the surrounding goings on? Or maybe their formal statuses are merely empty labels masking equally ignorant individuals? Surely all those alternatives seem equally unthinkable!

The senior academics are denied a plea of ignorance. If that was granted, what would that imply about the school (QCA) which they represent? After all it would be dreadful to permit the thought that the "Art" in QCA is also just an empty label. So let's give the school the benefit of the doubt and suppose there does exist a genuine spirit of art within its walls. But that would seem inconsistent with the described incident!

What went wrong? Consider this. I'm quite sure that once the story surfaces, the highest ranking bureaucrats of Griffith University Inc. who are more concerned with avoiding liability suits, and making a profit then actually focusing on educating the youths would be appalled that such misconduct had occurred: "damaging a piece of art without taking the appropriate safety measures? The photos clearly depict students climbing the sculpture without adequate headgear and goggles! This is an outrage!".

Saturday, May 29, 2010

A lesson from Bach

This anecdote has been attributed to the biography of young Johann Sebastian Bach.
One evening, Johann was playing his latest sonata to a German baroness at her estate. When he had finished, the baroness exclaimed with a bewildered delight: “Ah! Maestro! It was wonderful!… But what did you mean by it?" Bach promptly approached the keyboard again, and replayed the sonata. When he had finished, he turned to the baroness and explained: “That, dear madam, is what I meant.”

Tuesday, May 25, 2010

Tangibility of the transcendental

I was doing a bit of reading about transcendental numbers today, and had an idea of constructing my own well defined transcendental. I was inspired by the Liouville constant.

Anyway, my idea was to construct a number which is a base 10 concatonation of the digits of consecutive prime numbers:
mp =  0.2357911131719232931...
or the natural numbers:
mN = 0.12345678910111213...
The construction proceeded as follows. First we define the function lambda:


Now we can express the numbers as infinite sums:





Where pn is the n'th prime.

Initially I thought this to be an exercise in creative procrastination, since firstly the idea is dead simple, and secondly who would be silly enough in going to the trouble of formulating such numbers. Surely only a fresh graduate with too much time on his hands.

To my surprise the idea behind those numbers has been already formulated by not one, but a few mathematicians. My mN is in fact a constant previously formulated by D. G. Champernowne. And it turns out that mp is already known as the
Copeland-Erdos constant:



Notice the striking similarity in the formulation - I have formulated mp completly oblivious to the Copeland-Edros formulation. The similarity lies in the fact that my lambda function acts a lot like the floor of base 10 logarithm of y, plus 1. In fact the relation is the following:


Which makes the sums in the exponents of the definitions of mp and the Copeland-Edros constant equal, since for each i we subtract 1 i.e. we subtract 1, k times, we need to add k back to the sum.

Well, I guess I feel better knowing that I'm in good company deeming quite obscure and prima facie pointless ideas valuable. I knew that both mN and mp are irrational, but now I also know that mN is in fact transcendental (mission accomplished!), and hence don't have to provide a proof, which i feel would be a herculean task.

Saturday, May 22, 2010

Who is lying?

Here's a rather simple and fun logic puzzle.

We have three people; Alice, Bob and Cecil. One of them is a liar. You have to determine who is the liar, and give reasons for your choice, based on the following information. Alice claims that Bob is a liar. Bob claims that Cecil is a liar. Cecil claims that both Alice and Bob are liers. Who's lying and why?

Answer in comments.

Sunday, May 16, 2010

Infinitude of primes, courtesy of Euclid

I love this proof:
Take any finite list of prime numbers p1, p2, ..., pn. It will be shown that some additional prime numbers not in this list exist. Let P be the product of all the prime numbers in the list:
P = p1p2...pn. Let q = P + 1: 1 more than this product. Then, q is either prime or not:
- If q is prime then there is at least one more prime than is listed.
- If q is not prime then some prime factor p divides q.
This factor p is not on our list: if it were, then it would divide P (since P is the product of every number on the list); but as we know, p divides P + 1 = q. Then p would have to divide the difference of the two numbers* which is (P + 1) − P or just 1. But no prime number divides 1 so there would be a contradiction, and therefore p cannot be on the list. This means at least one more prime number exists beyond those in the list. (Wikipedia)

* If some integer k divides two integers a, b then k divides a-b.
This will be immediate to some, but I'll provide a small proof of that fact for clarity's sake.
Proof:
k divides a -->  a = kx, where x is an integer, by def. of "divides"
k divides b -->  b = ky, where y is an integer, by def. of "divides"
a-b = kx - ky = k(x-y)
but x-y is an integer
Hence k divides a-b, by definition of "divides".

Sunday, May 9, 2010

Arithmetic sequences in digits of primes

THEOREM
Here's a fun fact about prime numbers: there are only 5 prime numbers, whose digits (there are bound to be more if we consider positive integers) express an arithmnetic sequence with common difference 1. They are 23, 67, 89, 4567 and 23456789.

123456789 is not a prime.

PROOF
By exhaustion :)

Lucid Sententia XVII

Those who can clearly see impermanence as an intrinsic quality of nature, and live with a lucid accompaniment of this truth, will have their memories project a rich multitude of possibilities onto the present thus rendering it richer, and as such more mysterious and worthy of wonder.

Thursday, May 6, 2010

A primes generator written in MATLAB

The algorithm below uses the principle of the Sieve of Eratosthenes, only it doesn't start with a set of integers, but rather extends the p array (array of primes) by checking if any successive integer to the seed is divisible by any elements of p - if not, then that integer is a prime and becomes an element of the p array thereby extending it.

Zoom in, in the browser view options for better readibility - I had to leave it small in order to preserve the neat format of the code and the comments.

function y=primelist(n)
p=[2];
%the seed for our primes set
k=1;%array index number
x=1;%denotes the nature of the candidate in the inner loop
i=1;%an arithmetically progressing variable added to failed candidates
   while p(length(p))<n
%p(length(p)) is always the last element of p
     while x==1
     %c will take a 0 value if p(length(p))+i is composite 
     c=floor((p(length(p))+i)/p(k))-((p(length(p)))+i)/p(k);
        if c==0
           x=0;%so a composite will yield x=0
        else if c~=0 && k<length(p)
                k=k+1;
%if not composite try next p element
            else %if c~=0 && k==length(p)
                x=2;% x=2 denotes p(length(p))+i is prime
            end
        end
     end
     if x==0 %&& k<=length(p)
        i=i+1;%hence we try the next successive integer
        x=1;%and hence reset x fo rum the inner loop again
        k=1;%
we start from the first p element again
       else if x==2%once the candidate is verified...
                p=[p (p(length(p))+i)];
%it is adjoined to p
                i=1;
%search starts at next Z after the last prime
                x=1;%x is reset in order to run the inner loop again
                k=1;
%we start from the first p element again
           end
    end
  end%the final output can naturally vary depending on what's desired
p(length(p)-1)%greatest prime smaller than n
%length(p)-1%number of primes up to an including the last one p
%p'%here we get a raw list of primes in the command window
end



Comments and feedback are welcome :)