Search results
Create the page "1999 JBMO Problems/Problem 5" on this wiki! See also the search results found.
- ...piad''' ('''JBMO''') is an annual contest for students under the age of 15.5 from one of the [[#Member countries|member countries]] (Balkan area). In re ...ficulty=4 - 6|breakdown=<u>Problem 1</u>: 4<br><u>Problem 2/3</u>: 5<br><u>Problem 4</u>: 6}}3 KB (472 words) - 02:28, 8 June 2024
- ...s the authors of the problems of the [[Junior Balkan Mathematical Olympiad|JBMO]]. * [[1997 JBMO]]6 KB (524 words) - 16:17, 17 August 2018
- ==Problem 1== ...umber <math>\underbrace{111\ldots 11}_{1997}\underbrace{22\ldots 22}_{1998}5</math> (which has 1997 of 1-s and 1998 of 2-s) is a perfect square.933 bytes (131 words) - 19:10, 31 October 2020
- ==Problem== ...umber <math>\underbrace{111\ldots 11}_{1997}\underbrace{22\ldots 22}_{1998}5</math> (which has 1997 of 1-s and 1998 of 2-s) is a perfect square.1 KB (134 words) - 21:37, 14 August 2018
- ==Problem 1== [[1999 JBMO Problems/Problem 1|Solution]]2 KB (271 words) - 12:13, 25 August 2018
- ==Problem== .... Find the greatest common divisor of the numbers <math>A_0,A_1,\ldots, A_{1999}</math>.2 KB (226 words) - 12:30, 25 August 2018