All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Numbers
Floor function and primes (Posted on 2006-12-09) Difficulty: 3 of 5
Determine the integer(s) n for which [n²/3] is a prime.
Note: [x] is the greatest integer ≤ x (floor function).

No Solution Yet Submitted by atheron    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution An old fashioned solution | Comment 3 of 5 |
With the old fashioned view that 1 is a prime, n=2 also works.

(Before the flames start, I do know that the modern view is considering 1 not to be a prime!)

  Posted by Federico Kereki on 2006-12-09 23:13:57
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (4)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information