Interview Question: Another Prime Puzzle

Sample Question #40 (mathematics – number theory)

Can you show that, for any prime number p that is at least equal to 5, the value of p2-1 is a multiple of 24 (i.e., wholly divisible by 24)?

[Taken from webpage "The Prime Puzzle"]

(Comment: I personally find questions like these appalling; unfortunately, they are extremely popular at quant interviews)

Advertisements
This entry was posted in Sample Qs. Bookmark the permalink.

2 Responses to Interview Question: Another Prime Puzzle

  1. Brett says:

    Thanks, anonymous visitor.  This is a pretty tough question, and it’s likely to be asked only of candidates who have a strong math background (e.g., math Ph.D. students or ex-math Olympiads competitors!). 

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s