I studied some number theory basic topics and after that I found some topics in some Youtube playlists such as:
- Euler totient
- Möbius inversion
- Chinese remainder theorem
- Diophantine equation
- Linear/segmented sieve
- Miller Rabin primality testing
- etc.
Are these topics really important and frequent in problems with rates $$$ \lt 1800$$$ and worth time or it's just a waste of time to learn them now?
I don't know any of them
Chinese remainder theorem was useful
I think that if solution of problem uses CTO(chinese remainder theorem), its have another solution. But i think only CTO and Diophantine equation are useful(especcialy for < 2000)
In a Div2 C, solution was based on CRT.
Exactly. 1770C KoxiaAndNumTheory Problem could be solved without CRT. The intuition is to check if there're duplicate elements or same remainder upon division by a prime. But CRT provides a rigorous proof to this intuition. (Check editorial)
So I would suggest from these topics Linear/segmented sieve, CRT and Diophantine equations
This easy but Diophantine equations read to have a deeper understanding of your solution is something good so still maybe Diophantine equations useful
You'll not see most of them in problems with <2500, maybe.
You should learn the fifth one. The other one? Nah they hurt my brain, there're no chance they will occur in $$$ \lt 1800 $$$ problems, or even $$$ \lt 2100$$$ problems.
You can learn Euler totient, Linear Sieve and Chinese remainder theorem. these will be helpful..
I dont know any of them
Euler Totient is sometimes useful.
I don't know what that is.
Really annoying thing to implement that never appears below d1C/d2E. Only useful if the author is unable to write a problem that's actually good.
:weary:
I've been doing CP for 7 years, and i've never needed more than the standard sieve
Somewhat useful to know if it appears in onsite competitions, otherwise you should just know from where to copy it.
Problems on codeforces don't really have any advanced topics below 2500-2600 rating (or maybe even higher but I can't solve those).