Recent content by Max.Planck

I want to get the index of the function with the highest value for that particular x, and if there are several, the last index should be returned.

I want to take the arg max over a number of functions as below, however it is possible that there are multiple i's for which the result is maximal. How do i denote that I want to take the last possible i, for example if it results in 3 and 5 I want it to return 5, is there notation available for...

Ah of course, thank you.

Doesnt this imply that p does not divide p choose k?

Agreed. I don't understand this. Ok thanks.

Hi. I don't understand the following proof. Lemma Let p be a prime number and 1<=k<=p-1, then: {p \choose k} \equiv 0 \pmod{p} Proof {p \choose k} = \frac{p!}{k!(p-k)!}. Since p | p! but p \not | k! \land p \not | (p-k)! the proof follows. I think here what you want to show is that p divides...

Just putting up some suggestions, maybe someone has experience with them? Switserland - ETH Zürich - EFPL Lausanne Netherlands - TU Delft - Leiden University Germany - Karlsruhe Insititute of Technology - TU München Sweden - KTH Denmark - Aarhus - Copenhagen

C++ is a fine language to learn. It allows you to program in various paradigms, allows you to make very efficient programs and is widely used. However, it is a very large language, and, it has a lot of features that only serve to maintain compatibility with old standards. But, if you stick to...

Im looking for a good university in Europe do to a MSc in Computer Science. I'm especially interested in Theoretical Computer Science, algorithms & data structures and machine learning. Any recommentations?

Anyone?

U(15) is not cyclic, but it is a power of a squarefree number right?

No, i don't see it.

In case it is prime it is cyclic then. But when it is nonprime I only see looking through the elements for a generator as the only solution.

Not really, for example U(12) is not cyclic. How can I easily check without looking through all the elements for a generator.

The operation is multiplication mod n, sorry forgot to mention.