中学・高校の数学用語と機械学習

中学・高校の数学用語200語

1. 数
2. 自然数
3. 整数
4. 小数
5. 分数
6. 有理数
7. 無理数
8. 実数
9. 素数
10. 約数
11. 倍数
12. 最大公約数
13. 最小公倍数
14. 逆数
15. 絶対値
16. 四則演算
17. 括弧
18. 計算の順序
19. 文字式
20. 単項式
21. 多項式
22. 項
23. 同類項
24. 係数
25. 展開
26. 因数分解
27. 共通因数
28. 乗法公式
29. 平方完成
30. 一次方程式
31. 二次方程式
32. 解の公式
33. 判別式
34. 実数解
35. 虚数
36. 虚数単位
37. 複素数
38. 連立方程式
39. 代入法
40. 加減法
41. 一次不等式
42. 二次不等式
43. グラフ
44. 座標
45. 原点
46. 関数
47. 一次関数
48. 二次関数
49. 放物線
50. 傾き
51. 切片
52. 軸
53. 頂点
54. 最大値
55. 最小値
56. 定数
57. 変数
58. 定義域
59. 値域
60. 指数
61. 指数法則
62. 指数関数
63. 対数
64. 対数関数
65. 三角関数
66. 正弦（サイン）
67. 余弦（コサイン）
68. 正接（タンジェント）
69. 単位円
70. ラジアン
71. 三角方程式
72. 合成関数
73. 逆関数
74. 合成
75. 微分
76. 導関数
77. 接線
78. 導関数の符号
79. 増減表
80. 極値
81. 極大値
82. 極小値
83. 関数の極限
84. 変化率
85. 積分
86. 不定積分
87. 定積分
88. 原始関数
89. 面積
90. 区分求積法
91. 数列
92. 等差数列
93. 公差
94. 等比数列
95. 公比
96. 一般項
97. 初項
98. 数列の和
99. 部分和
100. Σ（シグマ記号）
101. 無限等比数列
102. 漸化式
103. 数学的帰納法
104. 整数問題
105. 余り
106. 合同式
107. 素因数分解
108. 互いに素
109. 1次不定方程式
110. 図形
111. 点
112. 線分
113. 直線
114. 平面
115. 面積
116. 周の長さ
117. 高さ
118. 対角線
119. 三角形
120. 四角形
121. 多角形
122. 平行線
123. 垂直線
124. 円
125. 扇形
126. 中心角
127. 円周角
128. 弧
129. 弦
130. 半径
131. 直径
132. 相似
133. 合同
134. 合同条件
135. 相似条件
136. 三平方の定理
137. 直角三角形
138. 斜辺
139. 正弦定理
140. 余弦定理
141. 図形の証明
142. ベクトル
143. 成分表示
144. 大きさ
145. 向き
146. 単位ベクトル
147. ベクトルの加法
148. ベクトルのスカラー倍
149. 内積
150. ベクトルの直交
151. 直線のベクトル方程式
152. 平面ベクトル
153. 空間ベクトル
154. 空間図形
155. 立体
156. 表面積
157. 体積
158. 直方体
159. 立方体
160. 円柱
161. 円錐
162. 球
163. 活性化関数
164. 順列
165. 組合せ
166. 場合の数
167. 順列公式
168. 組合せ公式
169. 円順列
170. 重複順列
171. 確率
172. 標本空間
173. 事象
174. 余事象
175. 独立事象
176. 条件付き確率
177. 加法定理
178. 乗法定理
179. 期待値
180. 分散
181. 標準偏差
182. 二項定理
183. 二項展開
184. 二項係数
185. パスカルの三角形
186. 集合
187. 要素
188. 部分集合
189. 和集合
190. 共通部分
191. 補集合
192. 空集合
193. 包含
194. 属する
195. ベン図
196. 命題
197. 真偽
198. 必要条件
199. 十分条件
200. 対偶

---

1. All input values must be valid real numbers.
2. The label IDs are encoded as natural numbers starting from 0.
3. The number of epochs must be specified as an integer.
4. Normalize the input features to a decimal range between 0 and 1.
5. The learning rate is often a small fraction like 0.001.
6. Rational numbers can be precisely represented in symbolic computation.
7. π is an example of an irrational number, not directly used in training.
8. Most machine learning models work with real number inputs.
9. We used a prime number as the seed for reproducibility.
10. The batch size should be a divisor of the dataset size.
11. Set the training steps to a multiple of the batch size.
12. Data is split in chunks based on the greatest common divisor.
13. Align the input lengths using the least common multiple.
14. Apply the reciprocal of variance during normalization.
15. The loss is calculated using the absolute value of errors.
16. Preprocessing includes basic arithmetic operations on features.
17. Use parentheses to ensure correct computation order in expressions.
18. Respect the order of operations when evaluating the expression tree.
19. Symbolic variables are used to define the model equations.
20. Each expression in the model consists of a single monomial or multiple terms.
21. The polynomial regression model includes higher-degree terms.
22. The model computes each term of the polynomial individually.
23. Combine like terms during symbolic simplification to reduce complexity.
24. The coefficient determines the influence of each feature.
25. Expand the squared term using the binomial expansion formula.
26. Factor the loss function into simpler components.
27. Remove the common factor to simplify the expression.
28. Use multiplication formulas to derive model updates.
29. Complete the square to rewrite the loss function.
30. Solve the linear equation to find the optimal weight.
31. Solve the quadratic equation using the standard formula.
32. The quadratic formula provides the exact solutions for ax² + bx + c = 0.
33. The discriminant determines the number and type of solutions.
34. A positive discriminant indicates two distinct real solutions.
35. Complex numbers are used when the equation has no real solution.
36. The imaginary unit is denoted by i and satisfies i² = -1.
37. Neural networks can handle inputs with complex numbers using special modules.
38. Solve the system of equations using matrix operations.
39. The substitution method is used to simplify the solution process.
40. The addition-subtraction method eliminates one variable to solve the system.
41. Linear inequalities define constraints in optimization problems.
42. Quadratic inequalities are used in boundary region classification.
43. Visualize the model output using a 2D graph.
44. Each data point is plotted on a coordinate plane.
45. The origin is the intersection point of the x- and y-axes.
46. A function maps inputs to outputs in a deterministic way.
47. Linear functions are often used in the first layer of a neural network.
48. A quadratic function can model curved decision boundaries.
49. The graph of a quadratic function is a parabola.
50. The slope of the line indicates the rate of change.
51. The y-intercept shows the output when the input is zero.
52. The axis of symmetry helps analyze the shape of the parabola.
53. The vertex of the parabola represents the maximum or minimum.
54. The maximum value of the loss function is used for regularization control.
55. The model finds the minimum value of the loss function.
56. Constants are used to fix certain parameters during training.
57. Variables represent the tunable parameters of the model.
58. The domain defines the range of valid input values.
59. The range defines the possible outputs of the model.
60. The exponent is used in computing power functions in deep learning.
61. Apply exponent rules to simplify the loss derivative.
62. Exponential functions are used in softmax and attention mechanisms.
63. Logarithms are used in loss functions like cross-entropy.
64. The logarithmic function is useful for compressing large input values.
65. Trigonometric functions are useful in periodic time-series analysis.
66. The sine function models smooth oscillating behavior.
67. The cosine function is used for phase-shifted periodic patterns.
68. Tangent functions appear in gradient-based optimization visualizations.
69. The unit circle is essential for defining sine and cosine values.
70. Radian measure is used in trigonometric computations.
71. Trigonometric equations are used to model periodic components in signals.
72. A composite function layers multiple transformations.
73. The inverse function can be used to revert model transformations.
74. Function composition allows chaining of transformations in neural nets.
75. The derivative helps analyze how model output changes with input.
76. The derivative of the loss function is used in backpropagation.
77. The tangent line approximates the curve at a local point.
78. The sign of the derivative determines whether the function increases or decreases.
79. A monotonicity table shows where a function is increasing or decreasing.
80. A local extremum in the loss function helps determine convergence.
81. The local maximum represents a potential overfitting state.
82. The local minimum is the optimal value in many training objectives.
83. Limits are used in defining continuity and derivatives.
84. The rate of change is the derivative of the input-output relation.
85. Integration is used to calculate the total area under a curve.
86. The indefinite integral includes a constant of integration.
87. The definite integral gives the area between the curve and axis.
88. The antiderivative reverses the process of differentiation.
89. The area under the ROC curve is used to evaluate classifier performance.
90. The Riemann sum approximates integrals numerically.
91. A sequence is a function defined on natural numbers.
92. An arithmetic sequence has a constant difference between terms.
93. The common difference defines the step in an arithmetic sequence.
94. A geometric sequence multiplies by a fixed ratio.
95. The common ratio is constant between terms in a geometric sequence.
96. The general term defines any nth term in a sequence.
97. The first term defines the starting value of a sequence.
98. The sum of a sequence is used in cumulative cost analysis.
99. A partial sum adds the first n terms of a sequence.
100. The sigma notation compactly expresses summation.
101. The infinite geometric series is used to model decaying signals.
102. A recurrence formula defines each term based on previous ones.
103. Mathematical induction proves formulas related to model structure.
104. Integer constraints are applied in certain optimization problems.
105. The modulo operation computes the remainder in hash functions.
106. Modular arithmetic is used in data shuffling and cryptography.
107. Prime factorization helps analyze computational complexity.
108. Coprime integers are useful in modular encoding schemes.
109. Linear Diophantine equations appear in constraint-based modeling.
110. Geometric features can be extracted from image data.
111. A point represents a single coordinate in space.
112. A line segment defines the shortest path between two points.
113. A straight line is often used to separate two classes.
114. A plane in 3D defines a decision boundary for classification.
115. Compute the area under the curve for performance metrics.
116. The perimeter is used in shape-based feature engineering.
117. The height of the shape is used in spatial calculations.
118. Diagonals in matrices and grids are important for indexing.
119. Triangles are used in mesh generation and surface modeling.
120. Rectangles are common in object detection bounding boxes.
121. Polygons are used in segmentation masks in computer vision.
122. Parallel lines define constant directional fields.
123. Perpendicular lines are used in orthogonal projections.
124. Circles appear in radial basis functions and filters.
125. A sector represents a portion of the input space.
126. The central angle defines angular coverage in sensors.
127. The inscribed angle helps in detecting contours.
128. Arc length features appear in handwriting recognition.
129. The chord helps define inner regions in circular features.
130. The radius is used in computing circular receptive fields.
131. The diameter is twice the radius, often used in scaling.
132. Similar figures are used in shape-based matching algorithms.
133. Congruent figures are identical in size and shape.
134. Congruence conditions define transformations preserving shape.
135. Similarity conditions help in resizing without distortion.
136. The Pythagorean theorem is used in Euclidean distance computation.
137. A right triangle helps simplify trigonometric calculations.
138. The hypotenuse is the longest side in right-angle geometry.
139. The sine rule calculates unknowns in non-right triangles.
140. The cosine rule generalizes triangle side-angle relations.
141. Proof of geometric relationships supports feature constraints.
142. Vectors are used to represent directional data in ML.
143. Component form represents vectors in matrix computations.
144. Vector magnitude is used in normalization.
145. Direction of a vector indicates flow or force 151. The vector equation of a line is used in 3D modeling and ray tracing.
146. Planar vectors help represent direction in 2D space.
147. Spatial vectors define position and direction in 3D scenes.
148. 3D geometric figures are used in volume estimation tasks.
149. A solid is a 3D object represented in mesh or voxel formats.
150. Surface area is used in feature extraction from 3D scans.
151. Volume calculations help in medical image segmentation.
152. Rectangular prisms are often used in bounding box approximations.
153. Cubes are used in grid-based spatial partitioning.
154. Cylinders appear in LiDAR modeling and object approximation.
155. Cones are used in field-of-view modeling.
156. Spheres are useful for representing isotropic influence zones.
157. Activation functions introduce non-linearity in neural networks.
158. Permutations represent the order of data sequences.
159. Combinations are used for feature subset selection.
160. Counting methods determine the total number of configurations.
161. Use permutation formulas to calculate arrangement possibilities.
162. Combination formulas are applied in sampling without replacement.
163. Circular permutations account for rotation invariance.
164. Multiset permutations allow repeated elements in sequences.
165. Probability estimates uncertainty in model predictions.
166. The sample space contains all possible outcomes.
167. An event is a subset of the sample space.
168. The complement event includes all non-occurring outcomes.
169. Independent events do not influence each other.
170. Conditional probability updates likelihood based on known data.
171. The addition rule combines probabilities of separate events.
172. The multiplication rule applies to joint probabilities.
173. Expected value gives the average predicted outcome.
174. Variance measures the spread of prediction errors.
175. Standard deviation is used for data normalization.
176. The binomial theorem expands expressions in classification models.
177. Binomial expansion appears in polynomial approximation.
178. Binomial coefficients are used in probability distributions.
179. Pascal's triangle helps compute combinatoric weights.
180. Sets are used to define input categories and outputs.
181. Elements of a set represent distinct data points.
182. A subset is used to define validation or test partitions.
183. The union of sets combines unique items.
184. The intersection defines shared features across groups.
185. The complement set identifies excluded data points.
186. The empty set contains no elements and indicates null conditions.
187. Inclusion describes containment between sets.
188. An element belongs to a set if it satisfies the condition.
189. Venn diagrams visualize relationships between multiple sets.
190. Propositions are used in logic-based rule systems.
191. Truth values determine logical consistency of outputs.
192. A necessary condition must hold for the conclusion to be true.
193. A sufficient condition guarantees the outcome.
194. The contrapositive is logically equivalent to the original implication.
     in simulation.
195. A unit vector maintains direction with magnitude 1.
196. Vector addition combines multiple feature directions.
197. Scalar multiplication scales feature vectors.
198. The dot product computes similarity or projection.
199. Orthogonal vectors represent uncorrelated features.