Maths Olympiad Prep

Library / /339 of 520

Number theory Difficulty 6.3 National olympiad Find the answer

Example 1: Take n=7,h=2n=7, h=2. It is easy to see that 23=81(mod7)2^{3}=8 \equiv 1(\bmod 7), and for 1<k<21 < k < 2, we have 2k≢1(mod7)2^{k} \not\equiv 1(\bmod 7), so the order of 2 modulo 7 is 3. For h=2h=-2, it is easy to calculate that (2)6=641(mod7)(-2)^{6}=64 \equiv 1(\bmod 7), and for 1<k<51 < k < 5, we have (2)k≢1(mod7)(-2)^{k} \not\equiv 1(\bmod 7), so the order of -2 modulo 7 is 6.

A number or a short expression. Spacing and $ signs are ignored.

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.