Difference between revisions of "Lifting the Exponent"
Wescarroll (talk | contribs) m |
|||
(One intermediate revision by one other user not shown) | |||
Line 1: | Line 1: | ||
− | ( | + | (Lemma from MAA official solution, 2020 AIME I Problems/Problem 12) |
− | Let <math>p</math> be an odd prime, and let <math>a</math> and <math>b</math> be integers | + | Denote <math>v_p(n)</math> the highest power of prime <math>p</math> that divides <math>n</math>. |
+ | Let <math>p</math> be an odd prime, and let <math>a</math> and <math>b</math> be integers that are not multiples of <math>p</math> such that <math>p \mid (a-b)</math>. Let <math>n</math> be a positive integer. Then <math>v_p(a^n - b^n) = v_p(a - b) + v_p(n)</math>. | ||
+ | |||
+ | For more conclusions, see https://en.wikipedia.org/wiki/Lifting-the-exponent_lemma | ||
+ | |||
+ | edit by ~ab_godder |
Latest revision as of 20:12, 19 June 2024
(Lemma from MAA official solution, 2020 AIME I Problems/Problem 12)
Denote the highest power of prime that divides . Let be an odd prime, and let and be integers that are not multiples of such that . Let be a positive integer. Then .
For more conclusions, see https://en.wikipedia.org/wiki/Lifting-the-exponent_lemma
edit by ~ab_godder