Search results
Create the page "Chinese MO" on this wiki! See also the search results found.
Page title matches
- [[Chinese Mathematical Olympiad]] problems and solutions.951 bytes (88 words) - 11:05, 20 March 2025
Page text matches
- ...zonaws.com/aops-cdn.artofproblemsolving.com/resources/articles/crt.pdf The Chinese Remainder Theorem] by Evan Chen * [{{SERVER}}/community/c5h474960 Prep for USA(J)MO]14 KB (1,913 words) - 23:52, 6 March 2025
- ...uch that <math>b_i = ka_i</math> for <math>i = 1,2,3</math>. (2010 Chinese MO, Problem 6) ...>viewtopic.php?search_id=804457492&t=327474 Discussion</url> (2010 Chinese MO, 6)19 KB (3,412 words) - 14:57, 21 September 2022
- ...as from Russia and Singapore. The event plays a key role in selecting the Chinese team for the [[International Mathematical Olympiad]]. {{Contest Info|name=Chinese Mathematical Olympiad|region=China|type=Proof|difficulty=5.5 - 10|breakdown918 bytes (131 words) - 17:51, 20 March 2025
- ...or a number relatively prime to 20 that is not a multiple of 17. By the [[Chinese Remainder Theorem]], that means we can find a value <math>k</math> for all {{Indonesia MO box|year=2017|num-b=5|num-a=7}}2 KB (286 words) - 01:33, 13 August 2018
- #REDIRECT [[Chinese MO Problems and Solutions]]69 bytes (9 words) - 21:45, 19 March 2025
- [[2005 Indonesia MO Problems/Problem 8]] Solution 2 [[2018 AMC 8 Problems/Problem 21]] Solution 3 - Chinese Remainder Theorem10 KB (1,116 words) - 12:37, 11 June 2024