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!

]]>

Â

]]>

]]>

Â

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.

Â

]]>

]]>

]]>

]]>

*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

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!

]]>

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!

]]>

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!

]]>