Competition problem — Number theory

Library / /283 of 520

Number theory Difficulty 6.1 National olympiad Prove it

28. Prove: There exist infinitely many $n$ such that $n \mid 2^{n}+1$ .

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

Solution

28. Prove by induction that $3^{k} \mid 2^{3^{k}}+1, k=1,2, \cdots$ .

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.