Timeline for inequality for sum $\sum_{j_{i}=1,i=1,\cdots,k}^{n}\gcd(j_{1},j_{2},\cdots,j_{k})$
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 23, 2020 at 13:47 | vote | accept | math110 | ||
| Apr 23, 2020 at 2:17 | history | edited | GH from MO |
edited tags
|
|
| Apr 23, 2020 at 2:17 | answer | added | GH from MO | timeline score: 1 | |
| Apr 22, 2020 at 4:23 | comment | added | math110 | oh,I don't understand，can you post your answer,Thanks,this problem is from web | |
| Apr 22, 2020 at 3:55 | comment | added | Lucia | No, it is easy to prove. Try, and throw out all that you wrote about the case k=2. And this doesn't seem like a research level problem -- where does it come from? | |
| Apr 22, 2020 at 3:48 | comment | added | math110 | Thanks, exchange the sums maybe is not easy to prove?Thanks | |
| Apr 22, 2020 at 3:45 | comment | added | Lucia | Just use $n=\sum_{d|n} \phi(d)$ and exchange sums. The inequality drops at once. | |
| Apr 22, 2020 at 3:01 | history | edited | math110 | CC BY-SA 4.0 |
edited title
|
| Apr 22, 2020 at 1:48 | history | edited | math110 | CC BY-SA 4.0 |
edited title
|
| Apr 22, 2020 at 1:39 | history | edited | math110 | CC BY-SA 4.0 |
added 104 characters in body
|
| Apr 22, 2020 at 1:33 | history | asked | math110 | CC BY-SA 4.0 |