Recent content by tawi

It should do this: http://d1gjlxt8vb0knt.cloudfront.net//wp-content/uploads/NewPermutation.gif But for some reason the string suddenly starts to elongale, shorten...

Yes, I am an idiot. So far I have done this but the swap function is not working properly.. Not sure why. permu(output); function swap(str: String; firstIndex: Integer; secondIndex: Integer): String; var tmp : Char; begin tmp:=str[firstIndex]; str[firstIndex]:=str[secondIndex]...

Hello, I have a code in C/ C++and I have just learned I am going to need it in a version compatible with Free Pascal. I would never bother anyone with it but as I need it pretty quickly and my knowledge of Pascal is very poor I would spend ages rewriting this and it probably woudn't even work at...

You mean writing ##ax^3 + bx^2 + cx + d = p## which will give us system of four equations with the same LHS and RHS will always be the result for the individual elements of the basis? So the first equation would be ##ax^3 + bx^2 + cx + d = c##, second ##ax^3 + bx^2 + cx + d = d##, third ##ax^3...

Yes, the last one should in fact be p(1).

so for ##p'(0)## we'll have ##c##, for ##p'(1)## we will have ##3a^2+2b+c##, for ##p(0) d## and for ##p(1) a^3+b^2+c+d##... How will the final solution look like then? Just a vector with these elements?

Homework Statement 1) In a vector space V of all real polynomials of third degree or less find basis B such that for arbitrary polynomial p \in V the following applies: [p]_B = \begin{pmatrix} p'(0)\\p'(1)\\p(0)\\p(1)\end{pmatrix} where p' is the derivative of the polynomial p. Homework...

Is there an easy way to sort the columns? Can't think of any. I feel like if I wanted to do that the code would be just as long as the one I have already written.

Homework Statement I should write a program that determines how many columns of a given matrix are a permutation. The user will input some number N <=20 which will be the size of our matrix NxN. Then he will input the individual elements of the matrix by rows. I need to find out how many...

Well "poset" as partially ordered set. What kind of ordering am I assuming? That is up to me, my task is to find out whether such a set exists and if so, what is the least amount of elements it can have.

Homework Statement My task is to find out what is the lowest # of elements a poset can have with the following characteristics. If such a set exists I should show it and if it doesn't I must prove it. 1) has infimum of all its subsets, but there is a subset with no supremum 2) has two maximal...

Hmmm.. it also would put spaces in between the results. I don´t know.. This probably also isn´t the way it is supposed to be done.

Maybe some sort of recursion?

I am almost 100% sure this can be done with some basic stuff, without using anything external. Defining a function or a procedure would probably make no difference here, right?

What do you mean? There are no more restrictions than what I have written there.