2
votes
Accepted
I only don't understand one line in this given proof regarding a sequence becoming constant modulo n
It is strong induction on $n$. The author is saying:
Assume by strong induction that
$$x_{k}\equiv x_{k+1}\ (\text{mod }m)$$
for all $k\geq m$ and all $m<n$. The author is doing induction on $n$, ...
- 11.1k
1
vote
Name for integer "quotient" rounded up (ceiling) instead of down (floor), and its negative or complementary "remainder"
This isn't intended as a complete and definitive answer, more a list of places I've seen this concept crop up and writers have seen fit to give it a name. Aside from elementary number theory, careful ...
- 1,347
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
elementary-number-theory × 35798number-theory × 7589
modular-arithmetic × 4505
prime-numbers × 3716
divisibility × 3044
diophantine-equations × 1816
solution-verification × 1352
combinatorics × 1330
contest-math × 1287
gcd-and-lcm × 1285
algebra-precalculus × 1250
discrete-mathematics × 1030
abstract-algebra × 923
sequences-and-series × 777
induction × 639
proof-writing × 638
totient-function × 622
polynomials × 615
prime-factorization × 556
quadratic-residues × 546
integers × 480
summation × 446
square-numbers × 441
inequality × 440
arithmetic × 421