Recent content by Irene Kaminkowa

Sure, since the expression under the root becomes negative

My answer is 5.085⋅105 J/m3? Regards to your teacher )

But have it in your mind. Derive the final formula.

Energy density is ω = W / V = E / (Ad) where W - energy, V - volume, d - distance between the plates. Capacity of the system (actually, we consider a capacitor) C = ε0A/d Energy W = Q2/2С Hope, it is enough to find the solution.

What is the distance between plates?

Speaking about ends 22016 ends with 6 22015 ends with 8 Thus (22016 + 5)m + 22015 ends with 9 n = 4k + 3

Another way $$ \int \frac{dx}{sin(2x)} = \int \frac{dx}{2sinx~cosx} = \int \frac{dx}{2cos^2 x~tanx} = \begin{bmatrix} t = tan x\\ dt = \frac{dx}{cos^2x} \end{bmatrix} = \frac{1}{2}\int \frac{dt}{t}= \frac{1}{2}ln|t| + C = \frac{1}{2}ln|tan x| + C $$

Actually, it is: https://en.wikipedia.org/wiki/Inverse-square_law

anahita, you can siply use finite differencies: https://en.wikipedia.org/wiki/Finite_difference

Data failed to replicate himself in his daughter, who became "unstable". His brother was an "evil twin", kind of "unstable" either. Thus, humans are the only rational choice. Not being too smart, you won't be too dangerous )

If N is not too big, you can find "brute force" numerical solution. The code is simple. No "conventional solver" is needed. Or, you can find Cij and then feed any solver with them.

In the second equation there is a misprint The correct equation is (a+c-b)x2-2(a-c)x+(a+c+b) = 0 The proof is not difficult. Just find the discriminant.

According to the sacred book ;) dereferenced pointers are recommended instead of array substript, that is *(*(*(A + i) + j)+k) instead of A [i ][j ][k ] As for transformation of a 3D array into 1D, the rule is simple Assume d1,d2,d3 - dimensions Then A[i ][j ][k ] = A_line [k + d3⋅(j + d2⋅i)]

Another approach dy/dx = 2x(y+1) dy/(y+1) = 2xdx y+1 = Cex2

Is remLista for removal? Then, look at your pushBack. When do you use malloc? Free is the symmetric operation: you are to deallocate your node. Here you can find the thorough instructions both for recursive and iterative implementation: https://www.cs.bu.edu/teaching/c/linked-list/delete/