Percival Penman

Arthur Percival Penman, usually known by his middle name, (1885–1944) was an Australian cricketer and Australian rugby union representative.[2] A right-handed batsman and right-arm fast bowler, he played first-class cricket for New South Wales in the early 20th century.[3]

Percival Penman
Personal information
Full nameArthur Percival Penman
Born(1885-01-23)23 January 1885
Ultimo, New South Wales, Australia
Died11 September 1944(1944-09-11) (aged 59)
Wahroonga, New South Wales, Australia
BattingRight-handed
BowlingRight-arm fast
RoleBowler
Domestic team information
YearsTeam
1904–1906New South Wales
First-class debut24 December 1904 New South Wales v Queensland
Last First-class12 January 1906 New South Wales v Australian XI
Career statistics
Competition First-class
Matches 5
Runs scored 45
Batting average 15.00
100s/50s 0/0
Top score 15*
Balls bowled 819
Wickets 18
Bowling average 21.94
5 wickets in innings 1
10 wickets in match 0
Best bowling 5/48
Catches/stumpings 0/0
Source: CricketArchive, 1 January 2008
Percival Penman
Rugby union career
Position(s) fullback[1]
National team(s)
Years Team Apps (Points)
1905[1] Australia 1[1] (0[1])

Cricket career

Born in New South Wales on 23 January 1885,[3] Penman first played for the New South Wales cricket team in December 1904 in a first-class match against Queensland. He played further matches for New South Wales against Tasmania and Queensland in the same season. The following season he played his last two first-class matches against Queensland and an Australian XI. He never played a match in the Sheffield Shield.[4]

In the mid-1920s, Penman played three matches for the Federated Malay States, two against the Straits Settlements and one against Hong Kong.[5] He died in New South Wales on 11 September 1944.[3]

Rugby union career

Penman was also a rugby union international for Australia, being capped for his country as a fullback in a friendly against New Zealand, at Dunedin, on 2 September 1905.[1]

gollark: Yes, and I would prefer to use a Rust-based OS.
gollark: Please do not go around *programming* things in *C*.
gollark: Turing completeness technically requires infinite memory, which no actual implementation has, but the language *in theory* can be TC regardless of implementation.
gollark: Turing completeness means it can simulate any Turing machine, or something, and therefore any other TC thing.
gollark: That one command is just "increment the accumulator", and at the end of execution the output is then taken as a number which is converted to *binary* and interpreted however you like. So just unary encoding reworded slightly.

See also

References

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.