probability | brain

Language Learning › Learn Japanese › Grammar › JLPT N4 Grammar Patterns ›

〜かもしれない — Japanese Grammar

〜かもしれない Property Value Pattern 〜かもしれない JLPT Level N4 Type probability Formality Neutral (can be made polite with です) Register Both spoken and written Meaning The pattern 〜かもしれない (kamoshirenai) expresses a subjective possibility or a guess. It translates to "might," "may," or "it is possible that." It indicates that the speaker is not certain about the outcome or situation but acknowledges it as a potential reality. Structure Formula [Verb / い-adjective]...

Practice › LeetCode › LeetCode (archived) › LeetCode 08xx ›

LeetCode 837: New 21 Game

Problem Restatement Alice starts with 0 points. While her score is less than k , she keeps drawing a random number from 1 to maxPts . Each draw is independent, and every number from 1 to maxPts has the same probability. Alice stops drawing as soon as her score is at least k . Return the probability that Alice ends with n or fewer points. Answers within 10^-5 of the...

Practice › LeetCode › LeetCode (archived) › LeetCode 06xx ›

LeetCode 688: Knight Probability in Chessboard

Problem Restatement We are given an n x n chessboard. A knight starts at cell: (row, column) The knight makes exactly k moves. On each move, it chooses one of the 8 possible knight moves uniformly at random. It may choose a move that goes off the board. If it moves off the board, it cannot return. We need to return the probability that the knight remains on the board...

Practice › LeetCode › LeetCode (archived) › LeetCode 08xx ›

LeetCode 808: Soup Servings

Problem Restatement We have two soups, A and B . Both start with n milliliters. On each turn, one of four operations is chosen with equal probability 0.25 : Operation Soup A served Soup B served 1 100 ml 0 ml 2 75 ml 25 ml 3 50 ml 50 ml 4 25 ml 75 ml If an operation asks for more soup than remains, we serve all that remains....

Maths › 00. General Mathematics ›

07.5 Probabilistic and Combinatorial Proofs

7.5 Probabilistic and Combinatorial Proofs Probabilistic and combinatorial proofs establish a result by counting, arranging, or randomly selecting objects. They are especially useful for finite structures, existence statements, and identities involving numbers of configurations. A combinatorial proof shows that two expressions are equal by showing that they count the same thing. For example, the identity $$ \binom{n}{k} = \binom{n}{n-k} $$ has a direct combinatorial explanation. Choosing $k$ elements from an...

Maths ›

62. Statistics

This volume studies statistical inference, estimation, and data analysis. It builds on probability theory to develop methods for learning from data. Part I. Foundations Chapter 1. Statistical Models 1.1 Data and randomness 1.2 Parametric models 1.3 Nonparametric models 1.4 Likelihood functions 1.5 Examples Chapter 2. Descriptive Statistics 2.1 Measures of location 2.2 Measures of spread 2.3 Data visualization 2.4 Summarization techniques 2.5 Examples Chapter 3. Sampling and Data 3.1 Sampling...

Maths ›

60. Probability Theory and Stochastic Processes

This volume develops probability theory on measure-theoretic foundations and studies stochastic processes. It emphasizes rigor, structure, and applications. Part I. Foundations of Probability Chapter 1. Probability Spaces 1.1 Sigma-algebras and events 1.2 Probability measures 1.3 Examples 1.4 Basic properties 1.5 Interpretations Chapter 2. Random Variables 2.1 Definitions 2.2 Distributions 2.3 Expectation 2.4 Variance 2.5 Examples Chapter 3. Independence 3.1 Independent events 3.2 Independent random variables 3.3 Conditional probability 3.4 Conditional...

#probability

〜かもしれない — Japanese Grammar

LeetCode 837: New 21 Game

LeetCode 688: Knight Probability in Chessboard

LeetCode 808: Soup Servings

07.5 Probabilistic and Combinatorial Proofs

62. Statistics

60. Probability Theory and Stochastic Processes