Need help!

I wanted to step into the usage of Visual Basic in Visual Studio 2008 (well, actually, `wanted` is not the right word here.. but, anyway, my job forced me to do that), but I stumbled upon such an error when trying to open an existing VB project.. 😦

I surfed the net then and discovered I am not alone in this situation.. However, everybody says reinstalling does not solve the problem.. What can I do now? Any VS VB specs here? Help me if you can, please!

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!


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

Just a Simple and Innocent Question

Is it true that every even number greater than 2 can be written as a sum of two primes?.. 😉

Published in: on Wednesday, July 16, 2008 at 5:30 pm  Comments (18)  
Tags: , , , ,

Jack Edmonds – One of the Last Century’s Greatest Mathematicians

I am turning to all of you, my dear readers, with this announcement/application.


I have to tell about the great American mathematician Jack Edmonds, and his works in my PhD course after a couple of weeks, and I am now collection all possible information regarding to this man. I have read his most famous article `Paths, Trees, and Flowers`, I have found some citations other people said about him, I have studied some problems connected with his work, etc.


What am I asking – can you tell me something more about Jack Edmonds, like some facts from his biography, some interesting stories about him or that he has told, about his personality, etc. It surprised me how little information I could find about his life, including the title of his dissertation – I just couldn’t find it.. So, can you point me, where can I find something more about him? The most valuable would be to get to know, what impact his most famous work left on the subsequent mathematicians – either your own opinions or citations of some famous mathematicians or other people..


P.S. Some photos of Jack Edmonds would also be appreciated.


I Ran Up 6 Km Yesterday

And I established my left ankle is injured today.. 😦

Published in: on Wednesday, April 23, 2008 at 10:00 am  Leave a Comment  
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: , , , ,

My Decision

I am starting to run regularly this week! Tomorrow is my first regular run!

Published in: on Monday, April 14, 2008 at 1:51 pm  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


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!