Copa Newton
Copa Newton was a football friendly competition contested between Argentina and Uruguay. The trophy, donated by Nicanor Newton, was contested 27 times between 1906 and 1976.
 The trophy given to champions | |
| Organising body |   |
|---|---|
| Founded | 1906 |
| Abolished | 1976 |
| Region | Argentina, Uruguay |
| Number of teams | 2 |
| Most successful team(s) | (17 titles) |
History
Copa Newton was first held in 1906, one year after the first edition of Copa Lipton, and was continued on an annual basis until 1930, with the exception of 1910, 1914, 1921, 1923 and 1925-1926. It has only been played sporadically since, with just 8 editions played over four decades between 1937 and 1976.[1]
The cup has been contested 27 times in total, with Argentina the winners on 17 occasions and Uruguay on 10.
List of champions
Finals
The following list includes all the editions of the Copa Newton:[1] [2]
1912 final at Racing Club
| Year | Champion | Runner-up | Score | City |
|---|---|---|---|---|
| 1906 | | | 2-1 | Buenos Aires |
| 1907 | | | 2-1 | Montevideo |
| 1908 | | | 2-1 | Buenos Aires |
| 1909 | | | 2-2 [3] | Montevideo |
| 1911 | | | 3-2 | Montevideo |
| 1912 | | | 3-3 [4] | Avellaneda |
| 1913 | | | 1-0 | Montevideo |
| 1915 | | | 2-0 | Montevideo |
| 1916 | | | 3-1 | Avellaneda |
| 1917 | | | 1-0 | Montevideo |
| 1918 | | | 2-0 | Buenos Aires |
| 1919 | | | 2-1 | Montevideo |
| 1920 | | | 3-1 | Buenos Aires |
| 1922 | | | 2-2 [4] | Buenos Aires |
| 1924 | | | 4-0 | Buenos Aires |
| 1927 | | | 1-0 | Montevideo |
| 1928 | | | 1-0 | Avellaneda |
| 1929 | | | 2-1 | Montevideo |
| 1930 | | | 1-1 [4] | Buenos Aires |
| 1937 | | | 3-0 | Montevideo |
| 1942 | | | 4-1 | Buenos Aires |
| 1945 | | | 6-2 | Avellaneda |
| 1957 | | | 0-0 [3] | Montevideo |
| 1968 | | | 2-1 | Montevideo |
| 1973 | | | 1-1 [3] | Montevideo |
| 1975 | | | 3-2 | Montevideo |
| 1976 | | | 3-0 | Montevideo |
All-time scorers
Most finals by player
- 8:
- 6:
- 5:
- 4:
- 3:
gollark: Writing a bare metal microkernel in Haskell is not very practical.
gollark: > I never tried it. It's nice that it has these safety features but I prefer C++ still. > If I want to be sure that my program is free of bugs, I can write a formal specification and do a > correctness proof with the hoare calculus in some theorem proofer (People did that for the seL4 microkernel, which is free from bugs under some assumptions and used in satellites, nuclear power plants and such)Didn't doing that for seL4 require several hundred thousand lines of proof code?
gollark: Most countries have insanely convoluted tax law so I assume it's possible.
gollark: Hmm, so you need to obtain a hypercomputer of some sort to write your tax forms such that they cannot plausibly be checked?
gollark: What if it's somehow really easy to find *a* solution to something, but not specific ones, and hard to check the validity of a specific maybe-solution? Is that possible?
References
- Copa Newton by José Luis Pierrend at RSSSF
- Results at Informe Argentina Archived 2009-02-08 at the Wayback Machine
- As visiting team, Argentina won the trophy
- As visiting team, Uruguay won the trophy
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.