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!

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: , , , , , ,

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..

A Math Game

I attended the seminar for PhD students on Thursday and we played one game there. It turned out to be very interesting, so I want to share this with you, my dear reader.

So the rules are as follows:

The team consists of seven people, all labeled with one label – either red or green. The manager of the game do the labeling based on random label generator, that it, the possibility to get the green (or red) label for every person is equal to 0,5. Before the labeling process people are allowed to speak to each other and to agree on some strategy of the game. After the labeling is done, no communication is allowed, except everyone can see labels of other persons. The goal of the game is to guess the color of his label for some of the participants of the team. The guessing happens when the manager of the game asks it all the persons one after another. Every person can either pass (don’t guess his color), or guess his color, but it is not allowed for every person of the team to pass. When a person is surveyed and he makes a guess, the game ends – the team wins if the person guesses correctly, and loses if the guess is wrong.

The actual process can be seen like this:

  1. all the persons of the team is allowed to talk whatever they want for some time;

  2. the time is up, and all the persons settle in a row or whatever;

  3. the manager of the game goes to each person, chooses a label (remember – the probability of both colors is the same) and sticks it to forehead of that particular person (in the way person does not see the label);

  4.  when all the persons are labeled, everyone is allowed to look around to see the labels of other persons;

  5. when the looking is done, the manager of the game starts asking the question `What’s your color?` to each of the participants in an arbitrary order;

  6. person can say either `I pass` or name one of two possible colors – red or green (except for the last person who is forced to guess the color if it comes to him);

  7. if some person says `I pass`, the manager asks the same question to the next person;

  8. if some person guesses the color, the game is over and the team wins or loses depending on the correctness of the guess.

 So, you task is now to come up with a strategy that gives the biggest probability for a team to win. And it would be nice, of course, to motivate this strategy and/or to calculate the winning probability of your strategy. Who offers the best strategy (the biggest winning probability) wins (sorry, no prices though).

Published in: on Saturday, December 8, 2007 at 3:07 am  Comments (1)  
Tags: , , , , , ,

Interesting Research Field

I can’t find the site right now, but I remember one scientist telling his research area in one short sentence:

My research is about what we can’t do with computers we don’t have.

He was, of course, working with quantum computing.. Can someone tell me the name of that scientist?

An Unexplained Phenomenon

1. A mistique 

2. Two dots at the end of the sentence??

3. Hello, World

Please, give your explanations in comments!

Published in: on Wednesday, November 14, 2007 at 6:23 pm  Comments (10)  
Tags: , , , ,