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 proof-writing
Search options not deleted
user 702548
For questions about the formulation of a proof. This tag should not be the only tag for a question and should not be used to ask for a proof of a statement.
1
vote
0
answers
33
views
Problem from Kenneth Rosen's Discrete Mathematics and its Applications, Section 1.8 [duplicate]
Let S = X1 * Y1 + X2 * Y2 + · · · + Xn * Yn, where X1, X2 , . . . ,
Xn and Y1, Y2, . . . , Yn are orderings of two different sequences of
positive real numbers, each containing n elements.
…
- 222