Event

Puzzle Hunt

Posted on Author Alexander Chen Comments Off on Puzzle Hunt
Hey Nullset! Below is a message from the organizers of the Princeton Puzzle Hunt: 

 

Embark on an epic puzzle-solving journey with friends to test your analytical acumen and win fabulous prizes!

Adventure through mind-blowing logic puzzles to solve a baffling mythological mystery!

If you enjoy solving puzzles (or are just curious),

Sign up HERE for the

2019 Princeton Puzzle Hunt

on

Saturday, April 13, 2019, from 11:30am-5:30pm!

Sign-up deadline: April 5, 2019, 11:59PM

Create teams of five or fewer (each participant should make an account and join teams with a generated team code). Also, please indicate if you would like a room to work in for the day (rooms are limited, so sign up early)!

Prizes (Amazon):

Winning team: $500

2nd place team: $400

3rd place team: $300

4th place team: $200

5th place team: $100

T-shirts, company swag, and lunch (🍕) will be provided

+ chances for all participants to win even more prizes!

Don’t miss it. Sign up now!!

Yours truly,

The PUZZLES Board

//email puzzles@princeton.edu with questions or for more information//

Alexander Chen

Related Articles
Colloquium Event

Undergraduate Colloquium

Posted on Author Zhaonan Qu

THE NASH PROBLEM FOR ARC SPACES Wednesday Oct 2nd Fine 214 6:00 pm Abstract: In a 1968 preprint, John Nash asked some very interesting questions about the family of all arcs on algebraic or analytic surfaces and hypersurfaces. I illustrate these questions using the examples of the surfaces (xy=z^n) and (x^2+y^3=z^4). I plan to end […]
Colloquium Event

Undergraduate Colloquium: Professor Mark Braverman

Posted on Author Zhaonan Qu

Title: Communication complexity Location: Fine 224 Time: Wednesday 20th 5:00pm (NOT 6:00 pm) Abstract: Communication complexity studies the amount of communication that needs to be exchanged by parties to solve a problem on a distributed input. In this talk I will introduce communication complexity, and discuss several basic results and applications. No prior background will […]
Event Social

Boba this Saturday (3/9) at 4pm

Posted on Author Alexander Chen

[message from social chairs] Goldbach’s boba conjecture states that if every even integer greater than 2 can be expressed as the sum of two primes, then boba is delicious.   Lesser-known forms of Goldbach’s conjecture. We invite you to verify this conjecture by coming to the Fine Hall common room on Saturday at 4pm to get FREE BOBA!   Somebody went through great lengths […]