Browse Problems 
Our Patreons
Diamond Sponsors
Steven & Felix Halim
Reinardus Pradhitya
Gold Sponsors
--- YOUR NAME HERE ----
Silver Sponsors
--- YOUR NAME HERE ----
Bronze Sponsors
Christianto Handojo
Krzysztof Adamek
Fatima Broom
Contribute
Bitcoin:
1ojudgeapLUjJcnUm
ze67a4w3TJ6WnPxo
Browse Problems
Root :: Competitive Programming: Increasing the Lower Bound of Programming Contests (Steven & Felix Halim) :: Chapter 5. Mathematics :: Sequences and Number Systems :: Sequences
| Title | Total Submissions / Solving % | Total Users / Solving % | ||||
|
100 - The 3n + 1 problem | 944345 |
26.70%
|
145665 |
73.97%
|
|
|
|
413 - Up and Down Sequences | 4184 |
46.80%
|
2059 |
80.48%
|
|
|
|
694 - The Collatz Sequence | 41050 |
40.92%
|
13236 |
89.04%
|
|
|
|
10408 - Farey sequences | 4370 |
62.24%
|
2123 |
92.42%
|
|
|
|
10930 - A-Sequence | 8458 |
24.01%
|
1894 |
74.66%
|
|
|
|
11063 - B2-Sequence | 28991 |
23.41%
|
4494 |
84.33%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 6 of 6 | |