The mathematical problems are expressed in the form of poetry, so that mathematical thinking and poetry can be integrated. Scholars like it, and those who want to think deeply may wish to look at the story of "Li Bai" selling wine in the Tang Dynasty in China.
The title means:
Li Bai, a great poet in the Tang Dynasty, sold wine with a hip flask. Every time he meets a shop, he doubles the wine in the pot. Every time he looks at flowers and poems, he drinks a barrel of wine. In this way, I met the shop flowers three times, and the wine in the pot was finished. How much wine is there in the great poet's pot?
One-dimensional linear equation refers to an equation with only one unknown number, the highest order of which is 1, and both sides are algebraic expressions. A linear equation with one variable has only one root. One-dimensional linear equation can solve most engineering problems, travel problems, distribution problems, profit and loss problem, integral table problems, telephone billing problems and digital problems.
General steps for solving linear equations with one variable;
1, denominator: both sides of the equation are multiplied by the least common multiple of the denominator, so don't omit the multiplication.
2. Brackets: Pay attention to the coefficients and symbols before brackets.
3. Move the term: move the term containing the unknown to the left of the equation and move the constant term to the right of the equation. Pay attention to changing symbols when moving terms.
4. Merge similar terms: transform the equation into the form of ax = b (a ≠ 0).
5, the coefficient is 1: divide both sides of the equation by the coefficient of x to get the form of x = m.
Expand knowledge:
Algorithm refers to the accurate and complete description of the solution and a series of clear instructions to solve the problem. The algorithm represents a systematic method to describe the strategy mechanism to solve the problem. That is to say, for a certain standard input, the required output can be obtained in a limited time.
If an algorithm is flawed or not suitable for a problem, executing this algorithm will not solve the problem. Different algorithms may use different time, space or efficiency to accomplish the same task. The advantages and disadvantages of an algorithm can be measured by space complexity and time complexity.
The instructions in the algorithm describe a calculation. When it is running, it can start from an initial state and an initial input (which may be empty), go through a series of limited and clearly defined states, and finally produce an output and stop at a final state. The transition from one state to another is not necessarily certain. Some algorithms, including randomization algorithms, contain some random inputs.