U21 Global Ingenuity Challenge
The U21 Global Ingenuity Challenge is an online competition that challenges teams of undergraduate students to come up with solutions to a real life problem, the results of which are judged against teams from across the network to result in one overall winner.
Teams are made up of up to five students, from a variety of disciplines. Students are given a challenge and two weeks in which to complete it. They use The University of Nottingham’s online creative problem solving tool, Ingenuity Online, to break down the problem and develop innovative and scalable solutions.
Each team prepares and submits a three minute video presentation or pitch, which is entered into a network-wide competition. A panel of judges chooses a winning team based on what they deem to be the best and most ingenious solution to the challenge.
To apply, please fill out the Student Application Form (that includes uploading your UConn transcript and writing an essay) and ask a faculty member to fill out the Faculty Reference Form.
|2017 Challenge: Promoting Cultural Inclusiveness in Society
Start Date: March 6, 2017
End Date: March 31, 2017
Location: UConn Storrs/Online
Application: An application link will be made available to students who receive a nomination from a UConn faculty member.
Click here for more information about the 2017 Global Ingenuity Challenge.
2016 Challenge: The Challenge of Sustainable Housing
Left to right: Norman Garrick (Associate Professor, Civil and Environmental Engineering), Emily Bousaada (Civil Engineering ’16), Hayden Clarkin (Civil Engineering and German Studies, ’17), Brooke Siegel (Environmental Studies ‘18), Joan Bosma (Environmental Science ‘18), Carol Atkinson-Palombo (Associate Professor, Geography), Dan Weiner (Vice President for Global Affairs). The fifth member of the team, Ornella Tempo (Chemical Engineering ’16) is not shown.
| 2015 Challenge: Moving People Around in Cities
Winner: UNSW Australia
Proposal Title: ‘Project Step City’
Full Press Release / Link to Winning Video: Click here