query: Passing f[x][[1]] to FindRoot
positive_passages.docid: 27438
positive_passages.text: Prevent Part[] from trying to extract parts of symbolic expressions
negative_passages.docid: 96216
negative_passages.text: Using "find" non-recursively?
negative_passages.docid: 39830
negative_passages.text: Is "Arithmetic Expansion" the expected action on vars inside `[[` tests?
negative_passages.docid: 57036
negative_passages.text: find not recursive when given a pattern on the command line
negative_passages.docid: 98612
negative_passages.text: Is it possible to implement an equivalent syntax of (*x {\f(x)}) but the ordinate is specified first?
negative_passages.docid: 39749
negative_passages.text: Wagner's trick to monitor FindRoot no longer works in Mathematica version 8
negative_passages.docid: 63307
negative_passages.text: Generating sublists using multiplication ( * ) unexpected behavior
negative_passages.docid: 26431
negative_passages.text: Use findroot inside NDSolve
negative_passages.docid: 38875
negative_passages.text: How to write a function (piecewise) with bracket outside?
negative_passages.docid: 55186
negative_passages.text: How does A* pathfinding work?
negative_passages.docid: 41409
negative_passages.text: Ackermann Function primitive recursive
negative_passages.docid: 98860
negative_passages.text: roots doesn't work in a function
negative_passages.docid: 71402
negative_passages.text: Piping data through arbitrary functions in Clojure
negative_passages.docid: 114082
negative_passages.text: MATLAB: using the find function to get indices of a certain value in an array
negative_passages.docid: 90538
negative_passages.text: Two ways to map a function on a list: Which one is faster?
negative_passages.docid: 103323
negative_passages.text: Finding a primitive root of a prime number
negative_passages.docid: 32865
negative_passages.text: Finding the roots of Hypergeometric1F1[]