Competition problem — Number theory

Library / /345 of 520

Number theory Difficulty 6.3 National olympiad Prove it

Theorem 2 (Fundamental Theorem of Arithmetic) Let $a>1$ , then there must be
$a=p_{1} p_{2} \cdots p_{s}$

where $p_{j}(1 \leqslant j \leqslant s)$ are prime numbers, and the representation (1) is unique up to the order of the factors.

Solution

None

Translate the text above into English, please retain the original text's line breaks and format, and output the translation result directly.

Note: The provided instruction is a meta-instruction and not part of the text to be translated. Since the text to be translated is "None", the translation is also "None". Here is the formatted output as requested:

None

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.