query: How pow function works in this case?
positive_passages.docid: 149036
positive_passages.text: C++ pow function get a weird result
negative_passages.docid: 90307
negative_passages.text: How to compute the above limit
negative_passages.docid: 111757
negative_passages.text: how fork works with logical operators
negative_passages.docid: 3101
negative_passages.text: Meaning of a set in the exponent
negative_passages.docid: 1948
negative_passages.text: How do you raise a Java BigInteger to the power of a BigInteger without doing modular arithmetic?
negative_passages.docid: 59679
negative_passages.text: How is exponentiation defined in Peano arithmetic?
negative_passages.docid: 133614
negative_passages.text: Why is $x^{\log_x n}=n$?
negative_passages.docid: 2048
negative_passages.text: Compute the radius of convergence of the power series $\sum_{n=0}^{\infty} n!x^n$
negative_passages.docid: 71432
negative_passages.text: What does the expression $1^n$ mean as a function argument?
negative_passages.docid: 146326
negative_passages.text: Question about Big O notation for asymptotic behavior in convergent power series
negative_passages.docid: 73708
negative_passages.text: Recursive power function: Why does this work if there's no initial return value?
negative_passages.docid: 83019
negative_passages.text: how are the math node operations in cycles calculated?
negative_passages.docid: 38636
negative_passages.text: A basic question about exponentiation: when is $a^{xy}=(a^x)^y$?
negative_passages.docid: 33934
negative_passages.text: understanding floating point variables
negative_passages.docid: 102717
negative_passages.text: Real analysis of powers
negative_passages.docid: 68026
negative_passages.text: Why is the maximum value of an unsigned n-bit integer 2^n-1 and not 2^n?
negative_passages.docid: 69299
negative_passages.text: Why do these two multiplication operations give different results?