Learning Greek..

Greek language is sooooo easy, you just can’t imagine! I am almost able to speak more or less fluently already 😀 And it’s so intuitive! For example, can you guess what does a word [ne] mean in Greek? What does you intuition say about that? Well, of course – it’s `yes`! 🙂 What else could it be!

 

Advertisements
Published in: on Tuesday, July 22, 2008 at 4:15 pm  Comments (2)  
Tags: , , , , , , ,

Today Is the Anniversary of My Death..

According to this source I have 55 years to live, starting from today.. Quite scary.. 😉

Published in: on Thursday, April 17, 2008 at 10:10 am  Leave a Comment  
Tags: , , , ,

The Curiosity About Prime Numbers

Everybody knows prime numbers. Most of us like prime numbers. Many of us love prime numbers. Some of us have noticed some curious things about prime number. Let me mention some of them:

2 – the curious thing about the prime number 2 is obvious – it is the smallest prime
3 – the smallest odd prime
11 – the smallest 2-digital prime
16 – the smallest number that is the fourth degree of some prime

Etc..

So, if we keep our mind busy thinking about curiosity of small integers, we will certainly be able to think of something interesting (related to primes) about every positive integer. But how far can we go? OK, we can think curious things about integers smaller than 10 – I’ll assume everyone can do that. Well, maybe we can assign a curio to every integer smaller than 100 as well. I guess, not everyone could do it so well this time, but, in fact, it could be possible for some of us. But what’s next? Can we go further till 1000? Can somebody tell me, for example, what is the curiosity about the integer 857 (it must be related to prime numbers)? Not instantly, I guess.. Therefore I was amazed by the theorem I found in this site:

Theorem. Every positive integer n has an associated prime curio.

And do you know what? There exists a proof for this theorem as well:

Proof: Let S be the set of positive integers for which there is no associated prime curiosity.  If S is empty, then we are done.  So suppose, for proof by contradiction, that S is not empty.  By the well-ordering principle S has a least element, call it n.  Then n is the least positive integer for which there is no associated prime curio.  But our last statement is a prime curio for n, a contradiction showing S does not have a least element and completing the proof.

Well, I don’t know about you, my dear reader, but I found this proof very exiting. It actually means we could think of a prime curiosity for every positive integer, if only we thought hard enough and long enough. Very beautiful result, indeed!

Max Mosley!

We support you!

P.S. I love reading the blogs when they are being furious about me, it’s very entertaining, and there is the odd one which defends me – well, now there are two odd blogs already! 😀

Published in: on Monday, February 18, 2008 at 2:39 pm  Comments (7)  
Tags: , , , , , , , , , ,

What Does This Function Do?

1. Please, give your answers in comments – what does the function written below do:

a)      recognizes prime numbers

b)      recognizes prime numbers in interval [100;999]

c)      neither a) nor b) is correct

d)      other variant (please, specify)

2. And the second question is – is this function a correct solution if the task is as follows: `Please, write a function that recognizes all the prime numbers consisting of exactly 3 digits`:

a) yes

b) no

The function (in C++):

bool f(int x) {

 for (int y=2;y<x;y++)

  if (x%y==0) return false;

 return true;

}

P.S. I wish all of you wrote your thoughts in order to make a student of mine understand the essence of the thing!

Question of the Day

Have you ever drunk some coffee during the coffee drinking time?

And, what do you know, I couldn’t remember any such occasion..

Published in: on Wednesday, January 23, 2008 at 7:29 pm  Comments (1)  
Tags: , , , , , , ,

Music – a Special Form of Mathematics

Music is the pleasure the human mind experiences from counting without being aware that it is counting

/Gottfried Leibniz/

I read it here and I found it to be true!

Published in: on Thursday, January 17, 2008 at 12:03 pm  Comments (2)  
Tags: , , , , , , ,

Random Number Generator – As Easy As 01, 10, 11..

Someone told me it is not a trivial task to make a good function generating a random number. What a fool I was to believe him! It turns out you can write down the function very easily. For example, in C++:

int getRandomNumber() {

   return 3; // proven to be random – obtained by throwing a dice

}

Not too complicated function, eh?

Published in: on Thursday, January 10, 2008 at 6:50 pm  Comments (2)  
Tags: , , , , , , , , ,

Blog Stats Is an Interpolation of What?

When looking at the diagram of `Dashboard à Blog Stats` in my WordPress, I can’t stop wondering about this curve – it must be an interpolation of some function. How could this function look like? What would be other arguments of this function except for the date (what are factors that affect the value of this function)? Can anybody define it precisely? Or not so precisely?

Published in: on Thursday, January 10, 2008 at 2:43 pm  Comments (7)  
Tags: , , , , , , , , , ,

I Bought a Car Today!

Oh yes, I did! Indeed! It’s my 3rd car already. After BMW and VW, now all my attention will be paid to my new Renault Megane. I am progressing if you look at the years of my cars – 1986, 1991, 1997.. Not bad, I would say, not bad at all. If the tendency continues, I will bye a car of the year 2004 in some 2009, and then a car of the year 2012 in some 2012 or 2013.. 😉

It’s a party this night! 8)

Published in: on Monday, January 7, 2008 at 7:56 pm  Comments (6)  
Tags: , , , , , , , , ,