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 functional-equations
Search options not deleted
user 46140
1
vote
Recurrence relation with two variables
The solutions look like a mess, so it's not too surprising that you always end up with one. If we follow Iosif Pinelis in dividing all by the last constraint by $\lambda$ and substituting $r = \frac{1 …
- 7,226
9
votes
Solving functional equation $f(xy)=f(x+y)$ and Diophantine equations
$7 \sim 12$ via $3, 4$
$12 \sim 35$ via $5, 7$
$35 \sim 264$ via $11, 24$
$264 \sim 41$ via $8, 33$
$41 \sim 420$ via $20, 21$
$420 \sim 43$ via $15, 28$
$43 \sim 156$ via $4, 39$
$156 \sim 25$ via $ …
- 7,226