4:41 AM
5:03 AM
@Sahaj should be deleted. It is a very basic question already answered in the first comment.

10 hours later…
3:30 PM
D1.

2 hours later…
5:29 PM
This is a duplicate of a question I asked earlier
0

Let S(x) denotes the sum of digits of x.If m and n are two positive integers such that $(S(m))^2 =n$ and $(S(n))^2 =m$ is true.Then find m,n. I made my start to this question such that $S(m)\equiv m\pmod 9$ so $n\equiv m^2\pmod 9$ and $m≡n^2(mod 9)$ so $n≡m^2≡n^4(mod 9)$ so $n^4-n≡0(mod 9)$ so e...

1 hour later…
6:39 PM
Custom: I am closing this question, since it seems to depend on the inclusion of an image which is no longer accessible. As such, the question no longer makes sense. (No Roomba: accepted answer) Domain coloring of Riemann zeta function‭ - Dimen‭ 2018-08-30 11:03:11Z
0

I've discovered a proof for the Collatz Conjecture. It's fairly straightforward, though a bit lengthy. I've heard there's a prize for solving this problem. To be eligible for the prize, the proof must be published in respected mathematical journals. But, I am not a mathematician and don't have ti...

2 hours later…
8:25 PM
0

Given the polynomial $x^n - 3x^{n-1} + 2x + 1$ with following roots $x_1, x_2, ..., x_n$, find the sum $S = \sum_{k=1}^n\frac{x_k}{x_k-1}.$ I imagine it's some Vieta's involved, I tried splitting the sum as so: $S = \sum_{k=1}^n\left(\frac{x_k-1+1}{x_k-1}\right) = n - \sum_{k=1}^n\frac{1}{x_k-1}$...

Duplicate

3 hours later…
11:45 PM