Search: including content
The absolute value (modulus) of a real number \(a\) is a non-negative value \(\vert a \vert\) determined as follows \[ \vert a \vert = \left\{\eqalign{a \quad &\hbox{for} \quad a\geq 0 \cr -a \quad &\hbox{for} \quad a < 0 \cr} \right. \]
A directed angle is an ordered pair of rays starting at the same point. The first ray (looking at counter-clockwise) is called an initial side, and second one – a terminal side of the angle.
A directed angle \(\alpha\)
The cardinality of a finite set \(A\) is the number of its elements and is denoted with \(\overset{=}{A}\).
The circle with a centre at \(S\) and radius \(r\), where \(r>0\), is a set of points \(P\) in the plane, which are equidistant from a fixed point \(S\) and this distance is equal to \(r\), i.e. \[ \vert SP\vert =r, \] where \(\vert SP\vert\) means the length of the segment \(SP\).
A circle
The binomial coefficient is a number \({n \choose k}\) given by the formula \[ {n \choose k}={n!\over k!(n-k)!}, \] where \(n,k\in\mathbb{N}\) and \(k\leq n\).
A \(k\)-element combination of an \(n\)-element set (\(k\)-combination of \(n\)), where \(k\le n\), is each \(k\)-element subset of this set.
Let \(A\) be any set in the universe \(X\), i.e. \(A\subset X\). The complement of \(\class{km-czerwony}{A}\) in the space \(\class{km-niebieski}{X}\) is a set denoted as \(A'\), where \[ A' = \{x\in X:\ x\notin A\}=X\backslash A \]
The complement of \(A\) in \(X\)
A conjunction (logical product) of statements \(p\) and \(q\) is the statement \(p\:{ \wedge}\: q\), which is read: \(p\) and \(q\). The truth values of the conjunction are described in the truth table below:
\( p\) | \( q\) | \( p\;{ \wedge}\; q\) |
---|---|---|
1 | 1 | 1 |
1 | 0 | 0 |
0 | 1 | 0 |
0 | 0 | 0 |
Logical connectives (operators) are:
- not (\(\sim \))
- or (\(\vee \))
- and (\(\wedge \))
- implication (\(\Rightarrow \))
- equivalence (\(\Longleftrightarrow\)).
Cosine of \(\alpha\) is equal to the length of the adjacent side to the angle \(\alpha\) divided by the length of the hypothenuse, i.e. \[ \cos \alpha ={{\class{km-niebieski}{b}}\over {\class{km-zielony}{c}}} \]
A right triangle
Cotangent of \(\alpha\) is equal to the length of the adjacent side to the angle \(\alpha\) divided by the length of the opposite side, i.e. \[ \cot \alpha ={{\class{km-niebieski}{b}}\over {\class{km-czerwony}{a}}} \]
A right triangle
A difference of events \(A\) and \(B\) \((A\setminus B)\) is a set of all outcomes from the sample space \(\Omega\), that favor the event \(A\) and that not favor the event \(B\).
A difference of sets \(\class{km-czerwony}{A}\) and \(\class{km-zielony}{B}\) is the set \(A \backslash B\), where \[ A \backslash B= \{x:\ x\in A\ \wedge\ x\notin B\} \]
The set difference of \(A\) and \(B\), denoted \(A\backslash B\)
A difference of vectors \(\overrightarrow{u}=\left[u_1,u_2\right]\) and \(\overrightarrow{v}=\left[v_1,v_2\right]\) is the vector \(\overrightarrow{u}-\overrightarrow{v}\) given by \[ \overrightarrow{u}-\overrightarrow{v}=\overrightarrow{u}+\left(-\overrightarrow{v}\right)\]
The difference of vectors
The discriminant of the quadratic trinomial \(y=ax^2+bx+c\) is the number \(\Delta\) given by the formula \[\Delta=b^2-4ac\]
A disjunction (logical sum) of statements \(p\) and \(q\) is the statement \(p\:{ \vee}\: q\), which is read: \(p\) or \(q\). The truth values of the disjunction are described in the truth table below:
\( p\) | \( q\) | \( p\; { \vee}\: q\) |
---|---|---|
1 | 1 | 1 |
1 | 0 | 1 |
0 | 1 | 1 |
0 | 0 | 0 |
Let \(f:\ X\longrightarrow Y\) be a function. The set \(X\) is called a domain of the function \(f\) and is denoted by \(D_f\). The set \(Y\) is called a codomain of the function \(f\). The set \[ R_f=\left\{y\in Y: \ \exists_{x\in D_f}\ y=f(x)\right\} \] is called a range of the function \(f\).
The biquadratic equation is the equation in the form \[ ax^4+bx^2+c=0,\] where \(a\neq 0\).
The general equation (standard equation) of the straight line \(l\) in the plane \(\mathbb{R}^2\) is the equation \[ l:\quad {\class{km-czerwony}{A}}x+{\class{km-czerwony}{B}}y+C=0, \] where \(A^2+B^2\neq 0\). The vector \(\overrightarrow{N}=\left[{\class{km-czerwony}{A}},{\class{km-czerwony}{B}}\right]\) is called a normal vector and it is perpendicular to the line.
The normal vector of the straight line \(l\)
The intercept equation of the straight line \(l\) in the plane \(\mathbb{R}^2\) is the equation \[ l:\quad {x\over {\class{km-czerwony}{a}}}+{y\over {\class{km-czerwony}{b}}}=1, \quad \hbox{where}\quad {\class{km-czerwony}{ab}}\neq 0 \] The point \(A({\class{km-czerwony}{a}},0)\) is \(x\)-intercept of the line \(l\), and the point \(B(0,{\class{km-czerwony}{b}})\) is \(y\)-intercept.
\(x\)- and \(y\)-intercepts of the line \(l\)
The slope-intercept equation of the line \(l\) in the plane \(\mathbb{R}^2\) is the equation in the form of \[ l:\quad y=mx+k \] The number \(m\) is called the gradient of the line. Moreover, \(m=\tan {\class{km-czerwony}{\alpha}}\), where \({\class{km-czerwony}{\alpha}}\) means the slope angle formed by a given line \(l\) and the positive half of the \(x\)-axis.
The slope angle of the stright line \(l\)
an equivalence (biconditional) of statements \(p\) and \(q\) is the statement \(p\Longleftrightarrow q\), which is read: \(p\) is equivalent to \(q\). The truth values of the equivalence are described in the truth table below:
\( p\) | \( q\) | \( p\;\Longleftrightarrow\; q\) |
---|---|---|
1 | 1 | 1 |
1 | 0 | 0 |
0 | 1 | 0 |
0 | 0 | 1 |
If \(\Omega\) is a sample space, then a random event (in short: an event) is each subset of the set \(\Omega\).
Random events are denoted by capital letters of the Latin alphabet, e.g. \(A\), \(B\), \(C,\ldots\).
The empty set \(\emptyset\subset \Omega\) is considered to be an impossible event, and the sample space \(\Omega\) – a certain event.
Random events are denoted by capital letters of the Latin alphabet, e.g. \(A\), \(B\), \(C,\ldots\).
The empty set \(\emptyset\subset \Omega\) is considered to be an impossible event, and the sample space \(\Omega\) – a certain event.
A complement event of \(A\) is a set of all outcomes from the sample space \(\Omega\), that not favor the event \(A\), and denoted by \(A^\prime =\Omega \setminus A\).
The events \(A\) and \(B\) are disjoint events if \(A\cap B=\emptyset\), e.g. it is impossible for these events to happen at the same time.
If \(\omega_i\) is an outcome of the experiment, which belongs to the set \(A\), then we say that the outcome \(\omega_i\) favors the event \(A\).
The factored form of the quadratic function \(y=ax^2+bx+c\) is \[y=a(x-x_1)(x-x_2),\] where \[x_1={-b-\sqrt{\Delta}\over 2a}, \qquad x_2={-b+\sqrt{\Delta}\over 2a}\] are zeros of the function.
The factorial of a positive integer \(n\) is the number defined by the formula \[ n!=1\cdot2\cdot3\cdot\ldots\cdot n \] In addition we take \(0!=1\).
Let \(X,Y\) be non-empty sets. The function determined in the set of inputs \(X\) taking values from the set of outputs \(Y\) is a relation between every element of the set \(x\in X\) and exactly one element of the \(y\in Y\) and is denoted by \[ f\:\quad X\longrightarrow Y \] A value \(y\) of the function \(f\) at the point \(x\) is denoted by \(f(x)\).
Diagram of a function \( f:X\longrightarrow Y\)
The function \(f:\ X\longrightarrow Y\) is a bijective function if it is injective and the set \(Y\) is also its range.
The function \(f:\ D_f \longrightarrow \mathbb{R}\) is a bounded function on the set \(A\subset D_f\) if \[\exists_{m,M\in \mathbb{R}}\quad \forall_{x\in A}\quad m\leq f(x)\leq M\]
A bounded function
The function \(f:\ D_f \longrightarrow \mathbb{R}\) is a function bounded above on the set \(A\subset D_f\) if \[\exists_{M\in \mathbb{R}}\quad \forall_{x\in A}\quad f(x)\leq M\]
A function bounded above
The function \(f:\ D_f \longrightarrow \mathbb{R}\) is a function bounded below on the set \(A\subset D_f\) if \[\exists_{m\in \mathbb{R}}\quad \forall_{x\in A}\quad f(x)\geq m\]
A function bounded below
The function \(f:\ D_f \longrightarrow \mathbb{R}\) is a constant function on the set \(A\subset D_f\) if \[ \exists _{c\in \mathbb{R}}\quad\forall_{x\in A}\quad f(x)=c\]
The cosine function is a function \(\cos:\ \mathbb{R}\rightarrow \mathbb{R}\) given by \[ \cos x=\cos \alpha, \] where \(x\) is the angle measure \(\alpha\) in radians.
The graph of the function \( y=\cos x\)
The cotangent function is a function \(\cot :\: \mathbb{R}\backslash \{k\pi: \: k\in \mathbb{Z}\} \rightarrow \mathbb{R}\) given by \[ \cot x=\cot \alpha, \] where \(x\) is the angle measure \(\alpha\) in radians.
The graph of the function \( y=\cot x\)
The function \(f\) is a decreasing function on the set \(A\subset D_f\) if \[ \forall_{x_1,x_2\in A}\quad x_1<x_2\ \Longrightarrow\ f(x_1)>f(x_2)\]
A decreasing function
The function \(f:\ D_f \longrightarrow Y\) and the function \(g:\ D_g\longrightarrow Y\) are equal if \[ D_f=D_g\quad\wedge\quad\forall_{x\in D_f}\ f(x)=g(x) \]
The function \(f:\ X\longrightarrow Y\) is an even function if \[\forall_{x\in X}\quad -x\in X \quad \wedge\quad f(-x)=f(x)\]
The graph of an even function is symmetrical with resoect to the \(y\)-axis.
An even function
Let \(a\) be a real number such that \(a\in(0,1)\cup (1,\infty)\). The exponential function is a function \(f:\mathbb{R}\rightarrow \mathbb{R}_+\) given by the formula \[f(x)=a^x\]
The function \(f:\ D_f \longrightarrow \mathbb{R}\) is an increasing function on the set \(A\subset D_f\) if \[\forall_{x_1,x_2\in A}\quad x_1 <x_2\ \Longrightarrow\ f(x_1)<f(x_2)\]
An increasing function
The function \(f:\ D_f \longrightarrow \mathbb{R}\) is an injective function on the set \({A\subset D_f}\) if \[\forall_{x_1,x_2\in A}\quad x_1\not= x_2\ \Longrightarrow\ f(x_1)\not= f(x_2)\]
Let the function \(f:\ X \longrightarrow Y\) be a bijection. The inverse function of the function \(f\) is the function \(f^{-1}:\ Y\longrightarrow X\) which satisfies the following condition \[ \forall_{x\in X}\quad\forall_{y\in Y}\quad f^{-1}(y)=x\quad \Longleftrightarrow\quad y=f(x) \]
An inverse function
The linear function is a function \(f:\ \mathbb{R} \longrightarrow \mathbb{R}\) given by the formula \[f(x)=ax+b,\] where \(a,b\in \mathbb{R}\). The constant \(a\) is the gradient, and the constant \(b\) is the \(y\)-coordinate of the \(y\)-intercept of a linear function.
Let \(a\) be a real number such that \(a\in(0,1)\cup (1,\infty)\). The logarithmic function is a function \(f:\ \mathbb{R}_+\rightarrow \mathbb{R}\) given by the formula \[ f(x)=\log_a x \]
The function \(f\) is a monotonic function in the set \(A\subset D_f\) if it is either increasing, decreasing, non-increasing or non-decreasing on the set \(A\subset D_f\).
The function \(f\) is a non-decreasing function on the set \(A\subset D_f\) if \[\forall_{x_1,x_2\in A}\quad x_1<x_2\ \Longrightarrow\ f(x_1)\leq f(x_2)\]
A non-decreasing function
The function \(f\) is a non-increasing function on the set \(A\subset D_f\) if \[\forall_{x_1,x_2\in A}\quad x_1<x_2\ \Longrightarrow\ f(x_1)\geq f(x_2)\]
A non-increasing function
The function \(f:X\longrightarrow Y\) is an odd function if \[\forall_{x\in X}\quad -x\in X \quad \wedge\quad f(-x)=-f(x)\]
The graph of an odd function has rotational symmetry with respect to the origin \((0,0)\).
An odd function
The function \(f:\ X\longrightarrow Y\) is a periodic function if \[\exists_{T>0}\quad \forall_{x\in X}\quad x+T\in X \quad \wedge\quad f(x+T)=f(x)\] The number \(T\) is called the period of the function \(f\). If there exists the smallest positive constant with this property, it is called the fundamental period.
A periodic function
The power function is a function \(f\) which can be shown by the formula \[f(x)=x^\alpha,\] where \(\alpha\) is a real number.
The quadratic function (quadratic trinomial) is a function \(f:\ \mathbb{R} \longrightarrow \mathbb{R}\) given by the formula \[f(x)=ax^2+bx+c,\] where \(a,b,c\in \mathbb{R}\) and \(a\neq 0\).
The rational function is a function \(f\) in the form of \[ f(x)={P(x)\over Q(x)},\] where \(P(x)\), \(Q(x)\) are polynomials, but the polynomial \(Q(x)\) is a non-zero polynomial.
The sine function is a function \(\sin:\ \mathbb{R}\rightarrow \mathbb{R}\) given by \[ \sin x=\sin \alpha, \] where \(x\) is the angle measure \(\alpha\) in radians.
The graph of the function \(y=\sin x\)
The function \(f\) is a strictly monotone function on the set \(A\subset D_f\) if it is either increasing or decreasing on the set \(A\subset D_f\).
The tangent function is a function \({\tan:\: \mathbb{R}\backslash \{{\pi\over 2}+k\pi:\: k\in \mathbb{Z}\} \rightarrow \mathbb{R}}\) given by \[ \tan x=\tan \alpha, \] where \(x\) is the angle measure \(\alpha\) in radians.
The graph of the function \( y=\tan x\)
The graph of the function \(f:\ X\longrightarrow Y\) is the set \[\left\{(x,y)\in \mathbb{R}^2:\ x\in X \ \wedge\ y=f(x)\right\}\]
An implication of statements \(p\) and \(q\) is the statement \(p\Rightarrow q\), which is read: \(p\) implies \(q\) or if \(p\) than \(q\). Statement \(p\) is the predecessor (hypothesis) of the implication and \(q\) is the successor (conclusion) of the implication. The truth values of the implication are described in the truth table below:
\( p\) | \( q\) | \( p\;\Rightarrow\; q\) |
---|---|---|
1 | 1 | 1 |
1 | 0 | 0 |
0 | 1 | 1 |
0 | 0 | 1 |
An intersection of events \(A\) and \(B\) \((A\cap B)\) is a set of all outcomes from the sample space \(\Omega\), that favor events \(A\) and \(B\), at the same time.
An intersection of sets \(\class{km-czerwony}{A}\) and \(\class{km- zielony}{B}\) is a set denoted by the symbol \(A\cap B\), where \[ A\cap B= \{x:\ x\in A\ \wedge\ x\in B\} \]
The intersection \(A\cap B\)
Let \(a\) be a real number such that \(a\in (0,1)\cup (1,\infty)\). A logarithm of a positive real number \(x\) to the base \(a\) is a number \(y\) such that \(a^y=x\), and is denoted as \(\log_ax\).This definition can be written symbolically \[\forall_{a\in \mathbb{R}_+\backslash\{1\}}\quad \log_ax=y\quad \Longleftrightarrow\quad a^y=x\] The logarithm \(\log_{10}x\) is called common logarithm and denoted as \(\log x\).
A magnitude of the vector \(\overrightarrow{u}=\left[u_1,u_2\right]\) \(\overrightarrow{u}=\left[u_1,u_2\right]\) equals \[ \vert \overrightarrow{u} \vert=\sqrt{\left(u_1\right)^2+\left(u_2\right)^2} \]
A negation of the statement \(p\) is the statement \(\sim p\), which is read: it is false that \(p\). The truth values of the negation are described in the truth table below:
\( p\) | \( \sim p\) |
---|---|
1 | 0 |
0 | 1 |
A permutation (permutation without repetition) of an \(n\)-element set is every \(n\)-term sequence created from all elements of this set.
A \(k\)-permutation with repetitions of an \(n\)-element set (\(k\)-tuple of \(n\) or \(k\)-element variation with repetitions of \(n\)) is every \(k\)-term sequence created from not necessarily different elements of this set.
A \(k\)-permutation of \(n\) (\(k\)-element variation without repetitions of an \(n\)-element set) for \(k\le n\) is every \(k\)-term sequence created from different elements of an \(n\)-element set.
The plane \(\mathbb{R}^2\) is a set of points \[ \mathbb{R}^2=\{(x,y):x,y\in \mathbb{R}\} \]
A real polynomial of degree \(n\) \((n\in \mathbb{N})\) is a function \(P:\ \mathbb{R}\longrightarrow \mathbb{R}\) written in the form \[P(x)=a_n x^n + a_{n-1} x^{n-1} + \ldots + a_1 x + a_0,\] where \(a_k \in \mathbb{R}\) for \(0\leq k \leq n\) and \(a_n\not=0\). Numbers \(a_k\) are called coefficients of the polynomial \(P(x)\), wherein \(a_0\) is also called a constant term of the polynomial.
Let \(\Omega\) be a finite and nonempty space in which all outcomes are equally likely. Then the probability of any event \(A\) in this sample space is called a number \[P\left(A\right)=\frac{\stackrel {=}{A}}{\stackrel {=}{\Omega}}\]
The Cartesian product of sets \(\class{km-czerwony}{A}\) and \(\class{km-zielony}{B}\) is a set \(A\times B\), where \[ A\times B =\{(a,b):\ a\in A\ \wedge\ b\in B\} \]
If \(A=B\), then instead \(A\times A\) we write \(A^2\).
The Cartesian product \(A\times B\)
Let \(\overrightarrow{u}\), \(\overrightarrow{v}\) be any vectors in \(\mathbb{R}^2\). The scalar product (dot product) of the vectors \(\overrightarrow{u}\) and \(\overrightarrow{v}\) is a real number defined by \[\overrightarrow{u}\bullet\overrightarrow{v}=\vert\overrightarrow{u}\vert\cdot\vert\overrightarrow{v}\vert\cdot\cos\varphi,\] where \(\varphi\) is the angle between the vectors \(\overrightarrow{u}\) and \(\overrightarrow{v}\).
The rational function in the form of \[ f(x)={a\over x}, \] where \(a\neq 0\), is called an inverse proportion.
The set of all possible outcomes of an experiment is called a sample space and is denoted by the Greek letter \(\Omega\).
The total number of elements of the sample space (cardinality of the set \(\Omega\)) is denoted by \(\stackrel{=}{\Omega}\).
The total number of elements of the sample space (cardinality of the set \(\Omega\)) is denoted by \(\stackrel{=}{\Omega}\).
The expression ”exists \(x\) such that” is called a existential quantifier and is denoted with the symbol \[\exists_{x}\quad \hbox{or} \quad \bigvee_{x}\]
The expression ”for all \(x\)” is called a general (universal) quantifier and is denoted with the symbol \[\forall_{x}\quad\hbox{or}\quad\bigwedge_{x}\]
The polynomial \(Q(x)\) is the quotient, and the polynomial \(R(x)\) is the reminder of the division of the polynomial \(N(x)\) by the polynomial \(D(x)\) if for every \(x\in \mathbb{R}\) is satisfied by the condition \[ N(x) = D(x) \cdot Q(x) + R(x) \] and the degree of the remainder \(R(x)\) is smaller than the degree of the divisor \(D(x)\). If \(R(x)\equiv 0,\)then it is said that the polynomial \(N(x)\) is divided by the polynomial \(D(x)\). The above condition on the assumption that \(D(x)\neq 0\) can be written in the form \[ {N(x) \over D(x)} = Q(x) + {R(x) \over D(x)} \]
Let \(\alpha\) be a central angle with the radius \(r\). The radian of a subtended angle \(\alpha\) is the ratio of the arc length \(l\) to the radius of the circle, i.e. \[{\class{km-niebieski}{\alpha}} = {{\class{km-zielony}{l}}\over {\class{km-czerwony}{r}}}\]
The unit of angle \(1\) is called a radian.
A central angle
The number \(x_0\in \mathbb{R}\) is called a root of the polynomial \(P(x)\) if \[ P(x_0)=0 \]
Let \(k\) be a positive integer. The number \(x_0\) is a root of multiplicity \(k\) of the polynomial \(P(x)\) if the polynomial \(P(x)\) is divided by the polynomial \((x-x_0)^k\), and is not divided by the polynomial \((x-x_0)^{k+1}\).
The scalar multiplication is the operation of multyplying a vector (\overrightarrow{u}=\left[u_1,u_2\right]\) by the scalar \(\alpha\in\mathbb{R}\) which gives us the vector \[ \alpha\overrightarrow{u}=\left[\alpha u_1,\alpha u_2\right] \]
An arithmetic sequence is the sequence \(\left(a_n\right)\) if \[ \exists_{d\in \mathbb{R}}\quad \forall_{n\in \mathbb{N_+}}\quad a_{n+1}=a_n+d \] The number \(d\) is a common difference of an arithmetic sequence.
A bounded above sequence is the sequence \(\left(a_n\right)\) if \[\exists_{M\in \mathbb{R}}\quad \forall_{n\in \mathbb{N}_+}\quad a_n\leq M\]
A sequence bounded above
A bounded below sequence is the sequence \(\left(a_n\right)\) if \[\exists_{m\in \mathbb{R}}\quad \forall_{n\in \mathbb{N}_+}\quad a_n\geq m\]
A sequence bounded below
A bounded sequence is the sequence \(\left(a_n\right)\) if \[\exists_{m,M\in \mathbb{R}}\quad \forall_{n\in \mathbb{N}_+}\quad m\leq a_n\leq M\]
A bounded sequence
A constant sequence is the sequence \(\left(a_n\right)\)if \[\forall_{n\in \mathbb{N}_+}\quad a_n=a_{n+1} \] It means that any term of this sequence is the same number.
A decreasing sequence is the sequence \(\left(a_n\right)\) if \[\forall_{n\in \mathbb{N}_+}\quad a_n> a_{n+1}\] This condition occurs when every consecutive term is less than the preceding one.
A decreasing sequence
A geometric sequence is the sequence \(\left(a_n\right)\) if \[ \exists_{q\in \mathbb{R}} \quad\forall_{n\in \mathbb{N}}\quad a_{n+1}=a_n\cdot q \] The number \(q\) is a common ratio of a geometric sequence.
An increasing sequence is the sequence \(\left(a_n\right)\) if \[\forall_{n\in \mathbb{N}_+}\quad a_n< a_{n+1}\] This condition occurs when every consecutive term is greater than the preceding one.
An increasing sequence
An indefinite sequence (or: sequence) is the function \[ f:\quad\mathbb{N}_+\longrightarrow \mathbb{R}\] The value of this function for any counting number \(n\) is an \(n\)th term of the sequence and is denoted by \(a_n\), i.e. \(f(n)=a_n\). The sequence is denoted by \(\left(a_n\right)\).
The graph of the sequence \(\left(a_n\right)\)
A non-decreasing sequence is the sequence \(\left(a_n\right)\) if \[\forall_{n\in \mathbb{N}_+}\quad a_n \leq a_{n+1}\] This condition occurs is not less than theeceding one.s="km-rysunek">
A non-decreasing sequence
A non-increasing sequence is the sequence \(\left(a_n\right)\) if \[\forall_{n\in \mathbb{N}_+}\quad a_n \geq a_{n+1}\] This condition occurs when every consecutive term is not greater than the preceding one.
A non-increasing sequence
A set \(A\) is included in a set \(B\), which is written as \[ A\subset B, \] if all the elements of a set \(A\) are also elements of a set \(B\). If \(A\subset B\), then the set \(A\) is called a subset of the set \(B\).
The sets \(A\) and \(B\) are disjoint sets if \[A\cap B=\emptyset\]
The sets \(A\) and \(B\) are equal sets if \(A\subset B\) and \(B\subset A\) simultaneously.Zbiory \(A\) i \(B) nazywamy zbiorami równymi i piszemy \[ A=B, \] gdy \(A\subset B\) i \(B\subset A\).
Sine of \(\alpha\) is equal to the length of the opposite side to the angle \(\alpha\) divided by the length of the hypotenuse, i.e. \[ \sin \alpha ={{\class{km-czerwony}{a}}\over {\class{km-zielony}{c}}} \]
A right triangle
A statement in logic (proposition) is said to be a coherent and declarative sentence i.e. one which, within given science, can be assigned an assessment of truth or falsity and only one of these two assessments. The assessment of truth is denoted by \(1\), the assessment of falsity by \(0\). Simple statements are denoted by lowercase letters, e.g. \(p\), \(q\), \(r\).
The letter which can mean any statement (within a given science), is said to be a statemaent symbol (propositional symbol).
A sum of the vectors \(\overrightarrow{u}=\left[u_1,u_2\right]\) and \(\overrightarrow{v}=\left[v_1,v_2\right]\) is the vector \[\overrightarrow{u}+\overrightarrow{v}=\left[u_1+v_1,u_2+v_2\right]\]
The sum of vectors
The coordinate system in the plane \(\mathbb{R}^2\) is a system which contains two perpendicular fixed lines \(x\), \(y\) intersected at the point called an origin \(O\). Such a coordinate system is designated by \(Oxy\). The lines \(x\) and \(y\) are called the axis.
A system of linear equations involving two unknowns is the system in the form \[ \left\{\eqalign{a_1 x + b_1y&=c_1\cr a_2 x + b_2 y&=c_2\cr}\right., \quad \hbox{where} \quad a_1,a_2,b_1,b_2,c_1,c_2\in\mathbb{R}\] Numbers \(a_1,a_2,b_1,b_2\) are called the coefficients of the system, and numbers \(c_1,c_2\) are the constant terms.
A pair of numbers \(\left( d_1,d_2\right)\) is the solution of the system of linear equations if the following equalities are satisfied \[ \left\{\eqalign{a_1 d_1 + b_1d_2&=c_1\cr a_2 d_1 + b_2 d_2&=c_2\cr}\right. \] The system of equations which has a single unique solution is called a definite system.
The system of equations which has infinitely many solutions is called an indefinite system.
The system of equations which has no solutions is called an inconsistent system.
The system of equations which has infinitely many solutions is called an indefinite system.
The system of equations which has no solutions is called an inconsistent system.
Tangent of \(\alpha\) is equal to the length of the opposite side to the angle \(\alpha\) divided by the length of the adjacent side, i.e. \[\tan \alpha ={{\class{km-czerwony}{a}}\over {\class{km-niebieski}{b}}} \]
A right triangle
A union of events \(A\) and \(B\) \((A\cup B)\) is a set of all outcomes from the sample space \(\Omega\), that favor the event \(A\) or \(B\).
A union of sets \(\class{km-czerwony}{A}\) and \(\class{km-zielony}{B}\) is a set denoted as \(A\cup B\), where \[ A\cup B= \{x:\ x\in A\ \vee\ x\in B\} \]
The union \(A\cup B\)
Let \(\overrightarrow{u}=\left[u_1,u_2\right]\) and \(\overrightarrow{v}=\left[v_1,v_2\right]\) be any vectors in \(\mathbb{R}^2\). It is said that the vectors \(\overrightarrow{u}\) and \(\overrightarrow{v}\) are equal vectors if \[ u_1=v_1 \quad \wedge \quad u_2=v_2, \] what can be written \(\overrightarrow{u}=\overrightarrow{v}\) in mathematical notation.
The vertex form of the quadratic function \(y=ax^2+bx+c\) is \[ y=a(x-p)^2+q, \] where \(p=-{b\over 2a}\) and \(q=-{\Delta\over 4a}\).
The zero of the function \(f\) is every argument \(x_0\in D_f\), for which \(f(x_0)=0\).
Geometrically, the zero of the function \(f\) is an \(x\)-coordinate of the \(x\)-intercept.
Zeros of the function \(f\)