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 function-construction
Search options not deleted
user 54422
For questions on writing functions (pure or using Set/SetDelayed) for any purpose, including the features that may be incorporated in those functions, such as options, patterns and conditions.
1
vote
1
answer
167
views
Recursive Calls to a function, how? [closed]
I want to create a function (or anything, really) that is capable of calling its own logic.
The idea is as follows:
Funccall[a_,b_,n_]:=
For[i=1,i<=n,i++,{Return[i*(4+i/3)*Funccall[a,b,n-1];}
or so …
- 185