Search results

...</math> remains as a '''formal variable''' without assuming any value. The numbers that we want to count are the coefficients carried by the terms in the form === Fibonacci numbers === ...

...</math> remains as a '''formal variable''' without assuming any value. The numbers that we want to count are the coefficients carried by the terms in the form === Fibonacci numbers === ...

...</math> remains as a '''formal variable''' without assuming any value. The numbers that we want to count are the coefficients carried by the terms in the form === Fibonacci numbers === ...

...</math> remains as a '''formal variable''' without assuming any value. The numbers that we want to count are the coefficients carried by the terms in the form === Fibonacci numbers === ...

...</math> remains as a '''formal variable''' without assuming any value. The numbers that we want to count are the coefficients carried by the terms in the form === Fibonacci numbers === ...

...</math> remains as a '''formal variable''' without assuming any value. The numbers that we want to count are the coefficients carried by the terms in the form === Fibonacci numbers === ...

...n|exponential functions]], and are useful in multiplying or dividing large numbers. * If you have x²=3, then you use the (square) [[Root (mathematics)|root]] to find out x: You get the result x = <math di ...

...q i\leq n</math>, be independent, uniformly distributed points in the unit square <math>[0,1]^2</math>. A point <math>P_i</math> is called "peripheral" if, f :'''Input:''' real numbers <math>U < 1</math>; ...

* [[Division (mathematics)|divide]] their weight by the [[exponentiation|square]] of their height ...to help decide whether people are too fat or too thin. The WHO uses these numbers for adults:<ref>{{cite web|url = http://www.who.int/bmi/index.jsp?introPage ...

||[[Square root]] of 5, [[Gauss]] sum ||<small>The ratio of a square and circumscribed or inscribed circles</small> ...

...of a real-valued argument ''x''. (This means both the input and output are numbers.) ...r, we can restrict both its domain and codomain to the set of non-negative numbers (0,+∞) to get an (invertible) bijection (see examples below). ...

* Step 1: Numbers can be [[Primality test#Probabilistic tests|probabilistically tested]] for Since <math>p\,</math> and <math>q\,</math> are distinct prime numbers, applying the [[Chinese remainder theorem]] to these two congruences yields ...

...or fixed-point arithmetic; when computing mathematical functions such as [[square root]]s, [[logarithm]]s, and [[sine]]s; or when using a [[floating point]] ...t occurs when [[physical quantity|physical quantities]] must be encoded by numbers or [[digital signal]]s. ...

<math>\square</math> ...to introduce the concepts of the <math>k</math>-cascade representation of numbers and the colex order of sets. ...

<math>\square</math> ...to introduce the concepts of the <math>k</math>-cascade representation of numbers and the colex order of sets. ...

:For <math>n>0</math>, the numbers of subsets of an <math>n</math>-set of even and of odd cardinality are equa For counting problems, what we care about are ''numbers''. In the binomial theorem, a formal ''variable'' <math>x</math> is introdu ...

:For <math>n>0</math>, the numbers of subsets of an <math>n</math>-set of even and of odd cardinality are equa For counting problems, what we care about are ''numbers''. In the binomial theorem, a formal ''variable'' <math>x</math> is introdu ...

:For <math>n>0</math>, the numbers of subsets of an <math>n</math>-set of even and of odd cardinality are equa For counting problems, what we care about are ''numbers''. In the binomial theorem, a formal ''variable'' <math>x</math> is introdu ...

:For <math>n>0</math>, the numbers of subsets of an <math>n</math>-set of even and of odd cardinality are equa For counting problems, what we care about are ''numbers''. In the binomial theorem, a formal ''variable'' <math>x</math> is introdu ...

:For <math>n>0</math>, the numbers of subsets of an <math>n</math>-set of even and of odd cardinality are equa For counting problems, what we care about are ''numbers''. In the binomial theorem, a formal ''variable'' <math>x</math> is introdu ...