Skip to main content

All Questions

Filter by
Sorted by
Tagged with
3 votes
1 answer
329 views

Nonexistence of short integer program sequence which generates squares

Is there a way to show within an integer program with constant number of variables and constraints of length $poly(\log B)$ (say length $\leq10^{1000000}\log B$), it is not possible for a variable to ...
Turbo's user avatar
  • 13.9k
3 votes
1 answer
447 views

An interesting problem which I think only needs elementary number theory

A problem about elementary number theory While writing my paper, I came across the following problem: (all the discussion assume that $q$ is prime and $\alpha $ is a positive integer. ) We first ...
王李远's user avatar
  • 363
2 votes
1 answer
913 views

Numbers that are the sum of 2 distinct nonzero squares in exactly 1 way [closed]

I need to emulate this sequence for a program: http://oeis.org/A025302 Stuff that I've taken into account: After finding the prime divisors of a number. I take any divisor as p and apply the ...
Greggz's user avatar
  • 123