Recent content by colt

It's the base of the log, (x-2) ^ {y} = x² -4x -5. The statement is to solve it. From a video where the presenter receives random questions about several subjects. Someone asked it, a comment about it mentioned the roots and I got curious about whether this has a solution or not.

Homework Statement solve the log x²-4x-5 on the base x-2.[/B] Homework Equations I read a comment from someone that also saw the question that says: The Attempt at a Solution If it was x²-4x+4, that would be igual (x-2)² and the answer would be 2, but I have no idea the guy got these...

True, that's a better solution. On a side note, anyone here has any experience using yuml? If someone does, the problem is that I don't know uml, so I tried to make my diagram through modifications of given samples in the yuml website. But I wasn't able to combine the two geometric shapes that I...

I am sorry, I forgot that there is more than one pumping lemma so I aborted the copy that I was doing. Very clever from my part. Anyway I attached a screenshot of the proof:

It says that |xy| < p. But I don't understand why even after reading the proof. If I have a four state DFA, whose last state is the one that is going to repeat for a given input string of length p, |x| is already going to be four, since it represents the states necessary to reach the repetition...

I am doing a project of an entity relationship model and a doubt came: Should repeated attributes of the entities be shared? Or I must reproduce these to every entity? In another words, if two of my entities are books and magazines, shall I have a single publisher attribute, or one for each?

What do you mean by nxn function? Anyway, thanks for the help.

No it wasn't C99. Anyway I putted 'n' as the first parameter and now I am getting these two error messages: The lines 183 and 184 are: contaOcorrenciasIfElse (n,a[][n], ocorrenciasA [n], i,j); contaOcorrenciasFormula (n,e[][n], ocorrenciasE [n], i,j); If I pass C99 as option to the...

Hi I have these functions: void posicaoIfElse (int e [][n], int i, int j, int k, int m, int n) { ... ... } void posicaoFormula (int e [][n], int i, int j, int k, int m, int n) { ... ... } that I calls through posicaoFormula (e,i,j,k,m,n); printf ("\n"); posicaoIfElse...

Hi, I have a program that is entering a infinite loop in the last if else of this loop. The program is printing 3 endless times. Here is the code that generates it: else { for (j=1;j<n;j++) { if (j<=(n/2)) { a[1][j] = j-1; printf ("%d", a[1][j]); }...

True I copied wrongly, it is (1,-2,1) Anyway I am not being able to row reduce it. Here are my two attempts: 1°: \begin{pmatrix} - \upsilon & 0 & 1 \\ 1 & - \upsilon & -3 \\ 0 & 1 & 3 - \upsilon \end{pmatrix}. L2 -> L2 + 3L1 \begin{pmatrix} - \upsilon & 0 & 1 \\ 1 - 3\upsilon & -...

Homework Statement Find The values of "Find the values of \upsilon for which the homogeneous system (A - \upsilon I)X = 0 has non trivial solution e for these values of \upsilon, find a base for the solution space from the system. Which A being = \begin{pmatrix} 0 & 0 & 1 \\ 1 & 0 & -3 \\ 0...

Yes, I have to admit that I was suspicious about this distributive. Thanks for pointing it out. I see it now. Thanks

How? The identity is irrelevant, so only the a^{-1} is left, and I already distributed it without seeing any meaningful result Ah yes, had forgotten this one. Didn't really understand. Can you try to explain it once more?

I was only able to develop it until here: A(A^{-1}[I + BA^{-1}]^{-1}) + B(A^{-1}[I + BA^{-1}]^{-1}) = AA^{-1}[I + BA^{-1}]^{-}) + BA^{-1}[I + BA^{-1}]^{-1} = I[I + BA^{-1}]^{-1} + BA^{-1}[I + BA^{-1}]^{-1} = [I + BA^{-1}]^{-1} + B[A^{-1} + A^{-1}BA^{-1}]^{-1} = I know that...