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!

Advertisements

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.

 

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!

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!

Am I a Complete Moron In Using Google?

I guess I just can’t use internet search engines. I guess I have no skills or something. I thought it will be very easy to find some good metamodel for UML ORG (organization) diagrams. Well, I couldn’t.. Does it mean the particular metamodel doesn’t exist? 😀 Anyway, can someone help me find it? Or I’ll be forced to come up with my own ideas of how this metamodel could look like?

Published in: on Thursday, January 17, 2008 at 3:44 pm  Comments (3)  
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: , , , , , , , , ,

Cite of the Day

All our faith is pinned on Edgars

/Said by my boss on a seminar today/

P.S. Edgars – that’s my name if you are starting to look for a vocabulary, my dear reader.. 😉

Published in: on Tuesday, January 8, 2008 at 5:57 pm  Comments (2)  
Tags: , , , , , ,

My First Review

Yes, my first review was done tomorrow! I was selected to be the reviewer of a master’s paper I wrote before. I think, I did quite well with the task. I evaluated the paper to the mark 6, the supervisor had evaluated it to 7, and so he got a 7. Good, what’s done! J

Published in: on Tuesday, December 18, 2007 at 8:18 pm  Comments (2)  
Tags: , , , , ,

Me? A Reviewer? It Can’t Be True!

I am going to be a reviewer! I am getting a master’s paper tomorrow, and I have to give my review till Monday. It will be my first experience in this field, I have never reviewed any papers officially. I don’t know yet which type of reviewer will I be, but I tend to the captious one.. Will see!

P.S. The paper is of the field of Computer Science, and the title is as follows:
Solution Development and Analysis of a Corporative Portal Based on the ERP System

Presentation In English – Mission Impossible?

I’m going to present our new graphical tool building platform to some representatives of some enterprise. It would be nothing in normal conditions – to show, how it all works, to demonstrate a bit and that’s it. The thing is two of these representatives will be from outside the country (one from USA, and the other from Sweden, if I am not wrong), so all the presentation must be hold in English. It could be a problem for me – I have given a public speech in English only once, and this was after living in Germany for some days, so I could get used to speaking English a bit. Now it will not be possible, so I am very nervous at the moment. The presentation is set on Wednesday, so I have only one day for preparation. Uhh..