-
21 опыт с бросанием монеты
Mathematics: coin-tossing experimentУниверсальный русско-английский словарь > опыт с бросанием монеты
-
22 поведение игрока полагающегося на случай
Aviation medicine: coin-tossing behaviorУниверсальный русско-английский словарь > поведение игрока полагающегося на случай
-
23 поведение игрока, полагающегося на случай
Makarov: coin-tossing behaviourУниверсальный русско-английский словарь > поведение игрока, полагающегося на случай
-
24 поведение человека полагающегося на случай
Aviation medicine: coin-tossing behaviorУниверсальный русско-английский словарь > поведение человека полагающегося на случай
-
25 поведение человека, полагающегося на случай
Makarov: coin-tossing behaviourУниверсальный русско-английский словарь > поведение человека, полагающегося на случай
-
26 схема бросания монеты
Mathematics: coin-tossing modelУниверсальный русско-английский словарь > схема бросания монеты
-
27 бросание
Синонимический ряд:1. выбрасывание (сущ.) выбрасывание; выкидывание; вышвыривание2. швыряние (сущ.) запускание; кидание; метание; пускание; шварканье; швыряние -
28 подбрасывание
-
29 подбрасывание
n. tossing, flipping (of coin)Русско-английский словарь математических терминов > подбрасывание
-
30 розыгрыш
м1) (займа, лотереи) drawing; ( посредством жребия) tossing (of) a coin2) ( шутка) practical joke• -
31 подбрасывание
n.tossing, flipping (of coin)
- 1
- 2
См. также в других словарях:
Feller's coin-tossing constants — are a set of numerical constants which describe asymptotic probabilities that in n independent tosses of a fair coin, no run of k consecutive heads (or, equally, tails) appears. William Feller showed [Feller, W. (1968) An Introduction to… … Wikipedia
Coin flipping — or coin tossing or heads or tails is the practice of throwing a coin in the air to choose between two alternatives, sometimes to resolve a dispute between two parties. It is a form of sortition which inherently has only two possible and equally… … Wikipedia
tossing — tÉ‘s /tÉ’s n. throw, pitch; flipping of a coin to decide a matter v. throw, fling, pitch; roll, rock … English contemporary dictionary
Fair coin — In probability theory and statistics, a sequence of independent Bernoulli trials with probability 1/2 of success on each trial is metaphorically called a fair coin. One for which the probability is not 1/2 is called a biased or unfair coin. Fair… … Wikipedia
Checking whether a coin is fair — In statistics, the question of checking whether a coin is fair is one whose importance lies, firstly, in providing a simple problem on which to illustrate basic ideas of statistical inference and, secondly, in providing a simple problem that can… … Wikipedia
Checking if a coin is fair — In statistics, a fair coin is an idealized randomizing device with two states (usually named heads and tails ) which are equally likely to occur. It is based on the ubiquitous coin flip used in sports and other situations where it is necessary to … Wikipedia
probability theory — Math., Statistics. the theory of analyzing and making statements concerning the probability of the occurrence of uncertain events. Cf. probability (def. 4). [1830 40] * * * Branch of mathematics that deals with analysis of random events.… … Universalium
Chess960 starting position — Chess960 is a chess variant in which the arrangement of pieces on the first rank is randomly generated. There are 960 possible starting positions, hence the name. The starting position can be generated before the game either by a computer program … Wikipedia
Gambler's fallacy — The Gambler s fallacy, also known as the Monte Carlo fallacy (because its most famous example happened in a Monte Carlo Casino in 1913)[1], and also referred to as the fallacy of the maturity of chances, is the belief that if deviations from… … Wikipedia
Martingale (betting system) — For the generalised mathematical concept, see martingale (probability theory). Originally, martingale referred to a class of betting strategies popular in 18th century France. The simplest of these strategies was designed for a game in which the… … Wikipedia
Generalizations of Fibonacci numbers — In mathematics, the Fibonacci numbers form a sequence defined recursively by:: F (0) = 0: F (1) = 1: F ( n ) = F ( n 1) + F ( n 2), for integer n > 1.That is, after two starting values, each number is the sum of the two preceding numbers.The… … Wikipedia