Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with inequalities
Search options not deleted
user 1306
for questions involving inequalities, upper and lower bounds.
4
votes
Show that $(\sum_{k=1}^{n}x_{k}\cos{k})^2+(\sum_{k=1}^{n}x_{k}\sin{k})^2\le (2+\frac{n}{4})\...
It is a bit long for a comment.
Your question is about the matrix $A=(\cos((i-j)))_{i,j=1\ldots n}$, specifically, the maximum of the quadratic form $q(x)=(Ax,x)$ on the subset $M_+$ of the unit sp …
- 16.9k
10
votes
An Linear Algebra Inequality
If you replace determinants by traces, then this inequality is just Cauchy-Schwarz for the inner product $(X,Y)=\mathop{\mathrm{tr}}(XY^T)$ on the space of matrices. Now, we just have to recall that d …
- 33.8k
3
votes
A property of unimodal sequences
For $k=0$ (a decreasing sequence), the proof is more or less the key idea that makes Leibniz convergence test work, for instance. Since the total alternating sum is zero, you are always reduced to the …
- 16.9k