User Portlet User Portlet

Discussions
I need to find 2-digit numbers that are divisible by the sum of their digits. I think about 'select' and 'mod', but I don't know how do this.
I have a questions. Let:`s[1]=3, s[2]=5, t[1]=1, s[n_] := t[n - 1] - t[n - 2] + 4, t[n_] := t[n - 1] + s[n - 1]` and I must count t[100]. Mathematica all the time counts, but does not give the result. Thank you in advance for your...
Let 'A' be the matrix of degree 5 of the matrix elements A = Table[Sin[(n - m)^2*x], {n, 1, 6}, {m, 1, 6}] How to draw a graph of the function?--> `f[x]=detA` and determine the minimum value of this function in the range of `{[Pi]/2,...