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.)
Some Thoughts A complex proposal | Comment 4 of 5 |
Following up on K.S.' extension to negative integers and F.K.'s generalization of primes, I suggest to further expand the scope of this puzzle to the complex case to make it more interesting:

- A complex integer shall be any number a+bi with integers a and b.
- We define [x+yi]:=[x]+[y]i.
- A complex integer is a prime if any of its factorizations into two integers contains -1, 1, i or -i as a factor.

Anyone able to crack this one?

  Posted by JLo on 2006-12-10 07:23:38
Please log in:
Remember me:
Sign up! | Forgot password

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

Copyright © 2002 - 2018 by Animus Pactum Consulting. All rights reserved. Privacy Information