Comprehensive Guide to Natural Numbers and Fundamental Arithmetic

Overview of Number Systems and Fundamental Arithmetic


Curricular table of contents for arithmetic and number systems

The study of foundational mathematics begins with understanding how numerical values are structured, represented, and manipulated. Numerical systems provide the formal language required to quantify sets, measure magnitudes, and execute computational procedures. Arithmetic operations, exponentiation, and root extraction form the structural basis of mathematical analysis and problem-solving.

Sistemas de Numeración: Romano y Decimal

A numeral system is a writing system for expressing numbers using a consistent set of symbols. Human civilization developed multiple paradigms for number representation, primarily categorized into additive systems and positional systems.

The Roman numeral system is an additive and partially subtractive numeral system based on seven primary capital Latin letters. Each symbol represents a fixed numerical constant:

I=1\text{I} = 1

V=5\text{V} = 5

X=10\text{X} = 10

L=50\text{L} = 50

C=100\text{C} = 100

D=500\text{D} = 500

M=1000\text{M} = 1000

Roman numerals are formed by combining these symbols subject to strict structural rules. Under the additive rule, placing a symbol of equal or lesser value to the right of another symbol adds its value, such as VI=5+1=6\text{VI} = 5 + 1 = 6 or CL=100+50=150\text{CL} = 100 + 50 = 150. Under the repetition rule, the primary symbols I\text{I}, X\text{X}, C\text{C}, and M\text{M} can be written consecutively up to three times to represent sum totals, such as III=3\text{III} = 3 or CCC=300\text{CCC} = 300. The auxiliary symbols V\text{V}, L\text{L}, and D\text{D} can never be repeated consecutively.

Under the subtractive rule, placing a smaller unit symbol directly to the left of a larger symbol indicates subtraction. Subtractive pairings are strictly limited to specific combinations: I\text{I} can only precede V\text{V} or X\text{X} (yielding IV=4\text{IV} = 4 and IX=9\text{IX} = 9); X\text{X} can only precede L\text{L} or C\text{C} (yielding XL=40\text{XL} = 40 and XC=90\text{XC} = 90); and C\text{C} can only precede D\text{D} or M\text{M} (yielding CD=400\text{CD} = 400 and CM=900\text{CM} = 900). To denote values equal to or exceeding 40004000, a horizontal bar called a vinculum is placed over a numeral, multiplying its value by 10001000, such as V‾=5000\overline{\text{V}} = 5000 or X‾=10000\overline{\text{X}} = 10000.

The decimal numeral system, also known as the Hindu-Arabic positional base-10 system, relies on ten distinct digits:

{0,1,2,3,4,5,6,7,8,9}\{0, 1, 2, 3, 4, 5, 6, 7, 8, 9\}

Unlike additive systems, the decimal system is strictly positional, meaning that the absolute value contributed by any digit depends entirely on its position relative to the units place. Each position represents an integer power of base 1010. Moving from right to left across a whole number, the place values correspond to units (100=110^0 = 1), tens (101=1010^1 = 10), hundreds (102=10010^2 = 100), thousands (103=100010^3 = 1000), ten thousands (104=1000010^4 = 10000), hundred thousands (105=10000010^5 = 100000), and millions (106=100000010^6 = 1000000).

Every natural number in the decimal system can be expressed uniquely through polynomial expansion. A natural number NN composed of digits dkdk−1…d1d0d_k d_{k-1} \dots d_1 d_0 is defined mathematically as:

N=∑i=0kdi×10i=dk×10k+dk−1×10k−1+⋯+d1×101+d0×100N = \sum_{i=0}^{k} d_i \times 10^i = d_k \times 10^k + d_{k-1} \times 10^{k-1} + \dots + d_1 \times 10^1 + d_0 \times 10^0

For example, the number 48374837 decomposes into 4×103+8×102+3×101+7×1004 \times 10^3 + 8 \times 10^2 + 3 \times 10^1 + 7 \times 10^0, which equals 4000+800+30+74000 + 800 + 30 + 7. The inclusion of the placeholder zero (00) is necessary in positional systems to represent an empty order of magnitude without altering the relative positions of neighboring digits.

El Número Natural

The set of natural numbers, denoted by the symbol N\mathbb{N}, comprises the fundamental discrete counting numbers:

N={0,1,2,3,4,5,… }\mathbb{N} = \{0, 1, 2, 3, 4, 5, \dots\}

Natural numbers serve two distinct mathematical functions: cardinal numbers, which quantify the absolute size or cardinality of a discrete set of elements, and ordinal numbers, which describe the relative rank, arrangement, or position of an element within a well-ordered sequence.

The natural numbers are formally constructed via the Peano axioms. These axioms state that 00 is a natural number, every natural number nn possesses a unique successor denoted S(n)=n+1S(n) = n + 1, there is no natural number whose successor is 00, distinct natural numbers have distinct successors, and any property possessed by 00 that is also inherited by the successor of every number possessing it must hold for all natural numbers (the principle of mathematical induction).

The set N\mathbb{N} possesses an intrinsic linear order. For any two natural numbers aa and bb, exactly one of three mutually exclusive conditions must hold according to the law of trichotomy:

a<ba < b

a=ba = b

a>ba > b

Geometrically, natural numbers are represented along a horizontal ray known as the number line. The ray originates at an origin point corresponding to 00 and extends infinitely to the right. Successive natural numbers are marked at uniform unit intervals, establishing an order where any number positioned to the right is strictly greater than any number positioned to its left.

Operaciones con Números Naturales

The primary arithmetic operations defined on natural numbers are addition, subtraction, multiplication, and division. Each operation exhibits specific structural properties that dictate valid computational transformations.

Addition (a+b=ca + b = c) combines two addends aa and bb into a single sum cc. Addition is closed in N\mathbb{N}, meaning the sum of two natural numbers is always a natural number. It satisfies the commutative property (a+b=b+aa + b = b + a), the associative property ((a+b)+c=a+(b+c)(a + b) + c = a + (b + c)), and contains an identity element 00 (a+0=aa + 0 = a).

Subtraction (a−b=ca - b = c) is the inverse operation of addition, where aa is the minuend, bb is the subtrahend, and cc is the difference. Subtraction is not closed in N\mathbb{N}, as the operation is strictly defined within natural numbers only when the condition a≥ba \ge b is satisfied. Subtraction is neither commutative (a−b≠b−aa - b \ne b - a when a≠ba \ne b) nor associative ((a−b)−c≠a−(b−c)(a - b) - c \ne a - (b - c)). The fundamental relationship connecting addition and subtraction states:

a−b=c  ⟺  a=b+ca - b = c \iff a = b + c

Multiplication (a×b=pa \times b = p or a⋅b=pa \cdot b = p) represents repeated addition of a factor aa across bb iterations. Multiplication is closed in N\mathbb{N} and obeys the commutative property (a×b=b×aa \times b = b \times a), the associative property ((a×b)×c=a×(b×c)(a \times b) \times c = a \times (b \times c)), the identity property with respect to 11 (a×1=aa \times 1 = a), and the zero-product property (a×0=0a \times 0 = 0). Furthermore, multiplication distributes over addition and subtraction:

a×(b+c)=(a×b)+(a×c)a \times (b + c) = (a \times b) + (a \times c)

a×(b−c)=(a×b)−(a×c)a \times (b - c) = (a \times b) - (a \times c)

Division is the inverse operation of multiplication. In the natural numbers, division is formalized by the Euclidean division algorithm. Given a dividend DD and a non-zero divisor dd (d>0d > 0), there exist unique natural numbers qq (quotient) and rr (remainder) satisfying:

D=d×q+rD = d \times q + r

0≤r<d0 \le r < d

When the remainder equals zero (r=0r = 0), the division is termed exact (divisioˊn exacta\text{división exacta}), meaning that DD is an exact multiple of dd, written as D=d×qD = d \times q. When r>0r > 0, the division is termed integer division with remainder (divisioˊn entera\text{división entera}). Division by zero (d=0d = 0) is undefined within all number systems.

Combined arithmetic expressions require strict adherence to the universal order of operations to avoid ambiguity. Calculations must proceed according to the following hierarchy:

  1. Evaluation of inner expressions enclosed in grouping symbols: parentheses ()(), brackets [][], and braces {}\{\}, working from the innermost layer outward.

  2. Evaluation of all powers (exponentiation) and roots.

  3. Evaluation of multiplications and divisions, computed sequentially from left to right as they appear.

  4. Evaluation of additions and subtractions, computed sequentially from left to right as they appear.

Potencias

Exponentiation is an algebraic operation involving two parameters: a base aa and an exponent nn. For any natural base aa and positive integer exponent n∈N+n \in \mathbb{N}^+, the power ana^n denotes the product of multiplying the base by itself nn times:

an=a×a×a×⋯×a⏟n factorsa^n = \underbrace{a \times a \times a \times \dots \times a}_{n \text{ factors}}

In this formulation, aa denotes the repeated numerical factor and nn denotes the frequency of multiplication. By algebraic convention and definition, any non-zero natural number raised to the power of zero equals one:

a0=1(a≠0)a^0 = 1 \quad (a \ne 0)

Any natural number raised to the first power equals itself:

a1=aa^1 = a

The algebraic rules governing powers with identical bases or identical exponents streamline numerical computations:

Product of powers with identical base: When multiplying powers sharing the same base, the base remains constant and the exponents are added:

am×an=am+na^m \times a^n = a^{m+n}

Quotient of powers with identical base: When dividing powers sharing the same base with m≥nm \ge n and a≠0a \ne 0, the base remains constant and the exponent of the denominator is subtracted from that of the numerator:

aman=am−n\frac{a^m}{a^n} = a^{m-n}

Power of a power: Raising an exponential expression to a secondary exponent requires multiplying the exponents:

(am)n=am×n(a^m)^n = a^{m \times n}

Power of a product: The power of a product is identical to the product of each individual factor raised to the specified exponent:

(a×b)n=an×bn(a \times b)^n = a^n \times b^n

Power of a quotient: The power of an exact quotient corresponds to the quotient of the numerator and denominator raised independently to that exponent (b≠0b \ne 0):

(ab)n=anbn\left(\frac{a}{b}\right)^n = \frac{a^n}{b^n}

Cuadrados Perfectos y Raíz Cuadrada

A perfect square (cuadrado perfecto\text{cuadrado perfecto}) is any natural number that can be expressed as the second power of another natural number. Formally, a natural number AA is a perfect square if there exists an integer n∈Nn \in \mathbb{N} such that:

A=n2A = n^2

Geometrically, a perfect square represents the total discrete area or number of unit elements arranged in a symmetric two-dimensional square grid of side length nn. The sequence of the initial natural perfect squares begins:

02=00^2 = 0

12=11^2 = 1

22=42^2 = 4

32=93^2 = 9

42=164^2 = 16

52=255^2 = 25

62=366^2 = 36

72=497^2 = 49

82=648^2 = 64

92=819^2 = 81

102=10010^2 = 100

112=12111^2 = 121

122=14412^2 = 144

The square root (raıˊz cuadrada\text{raíz cuadrada}) is the radical operation inverse to squaring. The exact square root of a natural number AA is a natural number bb such that when bb is multiplied by itself, it reproduces the radicand AA precisely:

A=b  ⟺  b2=A\sqrt{A} = b \iff b^2 = A

Because the vast majority of natural numbers are not perfect squares, the square root operation within the domain of N\mathbb{N} often produces a non-integer value. For non-square radicands, the integer square root (raıˊz cuadrada entera\text{raíz cuadrada entera}) is defined as the largest natural number bb whose square does not exceed AA:

b2≤A<(b+1)2b^2 \le A < (b + 1)^2

The difference between the radicand and the squared integer root represents the remainder (resto\text{resto}), denoted by rr:

r=A−b2r = A - b^2

A=b2+rA = b^2 + r

The remainder of an integer square root is bounded; it cannot exceed twice the calculated integer root:

r≤2br \le 2b

Evaluating the manual square root algorithm for large multi-digit numbers proceeds systematically: digits are separated into two-digit pairs starting from the units place moving leftward; the largest integer whose square is less than or equal to the leftmost group is extracted as the first root digit; this square is subtracted from the leftmost group; the next two-digit group is brought down beside the running remainder; the partial root is doubled to create a trial divisor; the next digit is estimated, verified, and appended to the root; and the iterative procedure continues until all periods are processed.

Estimación

Estimation is the mathematical practice of approximating numerical values to facilitate mental calculation, evaluate practical quantities, and assess the feasibility of complex computational outputs without requiring full digit-level precision.

Approximation is primarily achieved through two distinct techniques: truncation and rounding.

Truncation (truncamiento\text{truncamiento}) involves discarding all numerical digits positioned beyond a specified order of magnitude, replacing them with zeros without modifying the retained digits. For example, truncating the value 47824782 to the nearest hundred yields 47004700, while truncating to the nearest ten yields 47804780.

Rounding (redondeo\text{redondeo}) adjusts the target digit based on the magnitude of the immediate subsequent digit to minimize the absolute approximation error. The formal rounding protocol mandates:

  1. Identify the specific target place value (units, tens, hundreds, thousands, etc.).

  2. Inspect the digit immediately to the right of the target position.

  3. If that subsequent digit is strictly less than 55 (0,1,2,3, or 40, 1, 2, 3, \text{ or } 4), the target digit remains unaltered (rounding down), and all following positions are replaced with zeros.

  4. If that subsequent digit is greater than or equal to 55 (5,6,7,8, or 95, 6, 7, 8, \text{ or } 9), the target digit is incremented by 11 (rounding up), and all subsequent positions become zeros.

For example, rounding 648648 to the nearest hundred yields 600600 (because the subsequent tens digit 4<54 < 5), whereas rounding 652652 to the nearest hundred yields 700700 (because the subsequent tens digit 5≥55 \ge 5).

Estimation of arithmetic operations involves replacing complex operands with their rounded approximations prior to executing calculations. In estimation of sums and differences, each term is rounded to a shared order of magnitude before combining. In estimation of products and quotients, rounding factors to their leading non-zero digit allows rapid computation using mental arithmetic, providing immediate bounds to detect gross computational errors.

Ejercicios Finales

Final review exercises synthesize numerical theory, hierarchical calculation, exponential properties, and estimation algorithms into applied problems.

Consider an evaluation combining power laws and operator hierarchy:

Simplify: 3×23+64÷4−(5−2)2\text{Simplify: } 3 \times 2^3 + \sqrt{64} \div 4 - (5 - 2)^2

Step 1: Evaluate inner grouping terms:

(5−2)2=32(5 - 2)^2 = 3^2

Step 2: Evaluate all powers and roots:

23=82^3 = 8

64=8\sqrt{64} = 8

32=93^2 = 9

The expression simplifies to:

3×8+8÷4−93 \times 8 + 8 \div 4 - 9

Step 3: Evaluate multiplications and divisions from left to right:

3×8=243 \times 8 = 24

8÷4=28 \div 4 = 2

The expression becomes:

24+2−924 + 2 - 9

Step 4: Execute additions and subtractions from left to right:

24+2=2624 + 2 = 26

26−9=1726 - 9 = 17

Consider calculating the integer square root and remainder of A=135A = 135:

Determine the bounding consecutive perfect squares:

112=12111^2 = 121

122=14412^2 = 144

Because 121≤135<144121 \le 135 < 144, the integer root is b=11b = 11. The remainder is calculated as:

r=135−112=135−121=14r = 135 - 11^2 = 135 - 121 = 14

Verifying the maximum allowable remainder condition:

r≤2b  ⟹  14≤2(11)=22r \le 2b \implies 14 \le 2(11) = 22

The condition holds, confirming that 135=11\sqrt{135} = 11 with a remainder of r=14r = 14, expressed formally as 135=112+14135 = 11^2 + 14.

¡Claro que sí! Aquí tienes la explicación de los cuatro temas clave para 1.º de la ESO explicados de forma muy clara, acompañados de ejercicios para practicar:

1. Potencias

Una potencia es una forma corta de escribir una multiplicación repetida: ana^n significa multiplicar la base aa por sí misma tantas veces como indique el exponente nn.

  • Reglas básicas: Cualquier número elevado a 00 es igual a 11 (a0=1a^0 = 1), y elevado a 11 se queda igual (a1=aa^1 = a).

  • Propiedades:

    • Producto con la misma base: se suman los exponentes (am×an=am+na^m \times a^n = a^{m+n}

    • Cociente con la misma base: se restan los exponentes (aman=am−n\frac{a^m}{a^n} = a^{m-n}

    • Potencia de una potencia: se multiplican los exponentes ((am)n=am×n(a^m)^n = a^{m \times n}

    • Potencia de un producto o cociente: el exponente afecta a cada término ((a×b)n=an×bn(a \times b)^n = a^n \times b^n

2. Cuadrados perfectos y raíz cuadrada
  • Un cuadrado perfecto es el resultado de elevar un número al cuadrado, por ejemplo: 02=00^2 = 0, 12=11^2 = 1, 22=42^2 = 4, 32=93^2 = 9, 42=164^2 = 16, 52=255^2 = 25, etc.

  • La raíz cuadrada exacta es la operación contraria: buscar el número que multiplicado por sí mismo da el radicando (49=7\sqrt{49} = 7 porque 72=497^2 = 49

  • La raíz cuadrada entera se usa cuando el número no es un cuadrado perfecto. Se busca el mayor cuadrado que no se pase. Lo que sobra es el resto (rr):
    A=b2+rA = b^2 + r
    El resto nunca puede superar el doble de la raíz: r≤2br \le 2b

3. Estimación: Truncamiento y Redondeo
  • Truncamiento: Cortar el número a partir del orden pedido y cambiar las cifras siguientes por ceros. Por ejemplo, truncar 58325832 a las centenas da 58005800.

  • Redondeo: Mirar la cifra inmediatamente a la derecha de la que queremos redondear:

    • Si es menor que 55 (0,1,2,3,40, 1, 2, 3, 4
      , la cifra elegida no cambia.

    • Si es 55 o mayor (5,6,7,8,95, 6, 7, 8, 9
      , se le suma 11 a la cifra elegida.

    • El resto de cifras a la derecha se convierten en ceros.

4. Jerarquía de operaciones

Para resolver operaciones combinadas, siempre se sigue este orden:

  1. Paréntesis y corchetes.

  2. Potencias y raíces cuadradas.

  3. Multiplicaciones y divisiones (de izquierda a derecha).

  4. Sumas y restas (de izquierda a derecha).


Ejercicios de práctica

Ejercicio 1: Potencias
Expresa como una única potencia o calcula su valor:
a) 32×353^2 \times 3^5
b) 7672\frac{7^6}{7^2}
c) (23)4(2^3)^4
d) 90+419^0 + 4^1

Ejercicio 2: Raíz cuadrada entera y resto
Calcula la raíz cuadrada entera y el resto de 5454. Comprueba que el resto sea válido (r≤2br \le 2b
.

Ejercicio 3: Aproximación
Toma el número 47634763:
a) Trunca a las centenas.
b) Redondea a las decenas.
c) Redondea a las centenas.

Ejercicio 4: Operaciones combinadas
Calcula el resultado paso a paso respetando la jerarquía:
5×23+36÷2−(7−4)25 \times 2^3 + \sqrt{36} \div 2 - (7 - 4)^2


Soluciones para comprobar tu trabajo
  • Ejercicio 1: a) 373^7; b) 747^4; c) 2122^{12}; d) 1+4=51 + 4 = 5.

  • Ejercicio 2: Como 72=497^2 = 49 y 82=648^2 = 64, la raíz entera es b=7b = 7. El resto es r=54−49=5r = 54 - 49 = 5. Se comprueba que 5≤2×7=145 \le 2 \times 7 = 14.

  • Ejercicio 3: a) 47004700; b) 47604760 (la cifra siguiente es 33); c) 48004800 (la cifra siguiente es 66).

  • Ejercicio 4:

    1. Paréntesis: (7−4)2=32(7 - 4)^2 = 3^2.

    2. Potencias y raíces: 23=82^3 = 8, 36=6\sqrt{36} = 6, 32=93^2 = 9. La expresión queda: 5×8+6÷2−95 \times 8 + 6 \div 2 - 9.

    3. Multiplicaciones y divisiones: 5×8=405 \times 8 = 40, 6÷2=36 \div 2 = 3. Queda: 40+3−940 + 3 - 9.

    4. Sumas y restas: 40+3=4340 + 3 = 43, 43−9=3443 - 9 = 34.