Determine the integer(s) n for which [n²/3] is a prime.
Note: [x] is the greatest integer ≤ x (floor function).
(In reply to
A complex proposal by JLo)
Assuming you meant :
A complex integer is a prime if all of its factorizations into two integers contains exactly one of 1, 1, i or i as a factor.
I belive that the complex primes are then the union of:
{The real primes congruent to 3 mod 4}*{1,i,1,i}
{a+bi where a^2+b^2 is a prime}
Then it appears that there is no nice solution like there is for the original problem.
4 and 4 are no longer solutions (5 = (2+i)(2i))
3i and 3i are, but things get wierd when we look at number of the form n=(aia) giving [n^2/3]=i*ceiling((2/3)a^2)
There appear to be an unbounded number of such n that lead to primes, here are the ones I founf before stopping:
2i2, 4i4, 8i8, 10i10, 14i14, 28i28, 32i32
These are all of the ns that result in primes on the axes. When we just start looking at lots of complex integers that might yeild truly complex primes we find many more n that also appear to be unbounded. Here are the ones I found before stopping:
i+2, 2i+1, 2i1, i2, i2, 2i1, 2i+1, i+2, 3i+1, 3i1, 3i1, 3i+1, 2i+3, 2i3, 2i3, 2i+3, i+4
for example, (i+2)^2 = 3+4i yields 1+i which is prime (1^2+1^2=2) whereas (2i1)^2=34i yield 12i which is prime (1^2+2^2=5)
So, no pattern apparent and it looks like there are lots of answers .

Posted by Joel
on 20061211 09:00:10 