Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

[주제 제안] Erdős–Ginzburg–Ziv theorem #22

Open
cloneot opened this issue Mar 16, 2020 · 0 comments
Open

[주제 제안] Erdős–Ginzburg–Ziv theorem #22

cloneot opened this issue Mar 16, 2020 · 0 comments
Labels
주제 제안 블로그 포스팅 주제 제안

Comments

@cloneot
Copy link

cloneot commented Mar 16, 2020

주제 이름

  • Erdős–Ginzburg–Ziv theorem

주제 소개 (관련 자료 링크 포함)

0이상 N미만의 2N-1개의 수가 있을 때, N개를 골라 합이 N의 배수가 되게 할 수 있다.
https://www.encyclopediaofmath.org/index.php/Erd%C3%B6s-Ginzburg-Ziv_theorem

대략적인 난이도

  • solved 기준 다3~

관련 문제 링크

@cloneot cloneot added the 주제 제안 블로그 포스팅 주제 제안 label Mar 16, 2020
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
주제 제안 블로그 포스팅 주제 제안
Projects
None yet
Development

No branches or pull requests

1 participant