Gordon Barry
Arthur Gordon Barry CBE DSO MC (6 September 1885 – 21 August 1942)[1] was a professional soldier and an English amateur golfer. He won the Amateur Championship in 1905.
| Gordon Barry | |
|---|---|
| Personal information | |
| Full name | Arthur Gordon Barry |
| Born | 6 September 1885 Torpoint, Cornwall, England |
| Died | 21 August 1942 (aged 56) Edinburgh, Scotland |
| Nationality |  |
| Career | |
| Status | Amateur |
| Best results in major championships (wins: 1) | |
| Masters Tournament | DNP |
| PGA Championship | DNP |
| U.S. Open | DNP |
| The Open Championship | CUT: 1905 |
| British Amateur | Won: 1905 |
Golf career
Barry was just 19 years old when he won the Amateur Championship in 1905, beating Osmund Scott, 3 and 2, in the final. At the time this made him the youngest player to win the title. He was studying at the University of St Andrews. He then studied at Cambridge University, playing against Oxford in 1906 and 1907. In 1914 he studied at Oxford and played for Oxford against Cambridge. He represented England against Scotland in the annual amateur international in 1906 and 1907. He was the army champion in 1922 and 1925.[2]
Amateur wins
- 1905 Amateur Championship
- 1922 Army Championship
- 1925 Army Championship
Major championships
Wins (1)
| Year | Championship | Winning score | Runner-up |
|---|---|---|---|
| 1905 | Amateur Championship | 3 & 2 | |
Team appearances
- England–Scotland Amateur Match (representing England): 1906, 1907
gollark: But having access to several orders of magnitude of computing power than exists on Earth, and quantum computers (which can break the hard problems involved in all widely used asymmetric stuff) would.
gollark: Like how in theory on arbitrarily big numbers the fastest way to do multiplication is with some insane thing involving lots of Fourier transforms, but on averagely sized numbers it isn't very helpful.
gollark: It's entirely possible that the P = NP thing could be entirely irrelevant to breaking encryption, actually, as it might not provide a faster/more computationally efficient algorithm for key sizes which are in use.
gollark: Well, that would be inconvenient.
gollark: Increasing the key sizes a lot isn't very helpful if it doesn't increase the difficulty of breaking it by a similarly large factor.
References
- "Find a will". probatesearch.service.gov.uk. Retrieved 7 June 2017.
- "Brigadier A. G. Barry". Glasgow Herald. 22 August 1942. p. 4.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.