Tom Nicholls (rower)

Tom Nicholls (born 24 September 1983) is a West Australian former representative lightweight rower. He was an Australian national champion, an U23 world champion and won a bronze medal at the 2004 World Rowing Championships.

Tom Nicholls
Personal information
Born24 September 1983
Sport
CountryAustralia
SportRowing
ClubSwan River Rowing Club

Club and state rowing

Nicholls was raised in Perth. His senior club rowing was from the Perth's Swan River Rowing Club.

He first made state selection for Western Australia in 2002 in the men's lightweight coxless four which contested the Penrith Cup at the Interstate Regatta within the Australian Rowing Championships. That 2002 West Australian four with Nicholls in the bow seat dead-heated for first place with Tasmanian.[1] He rowed in further West Australian Penrith Cup fours in 2003[2] and 2004.[3]

International representative rowing

Nicholls made his Australian representative debut in 2002 at the World Rowing Cup II in Lucerne in a lightweight coxless pair with his West Australian team-mate Ross Brown. They rowed to sixth place. They went on to the 2002 U23 World Rowing Championships in Genoa where they won a silver medal in the coxless pair.[4].

In 2003 Nicholls and Brown teamed up with the Tasmanians Tom Gibson and Cameron Wurf in a lightweight coxless four. They finished in overall twelfth place at the World Rowing Cup III in Lucerne but then at the 2003 U23 World Rowing Championships in Belgrade they took the gold medal and claimed an U23 World Championship.[4]

In 2004 he moved fully into the Australian senior squad in the lightweight eight. That boat rowed to bronze medal at the 2004 World Rowing Championships in Banyoles, Spain.[4]

gollark: Do you plan to also make your own `type` and `==`? Because that would be neat.
gollark: Also, *how* is it based on Linux?
gollark: <@185901063755268097> Why is learning the overly specific and not very transferable commands of your specific CC "OS" more useful than learning the usual CC Ones?
gollark: Still, you can do those things, it would just be annoying and hard.
gollark: Turing-completeness requires infinite memory.

References

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