Integer Number Theory - n = p + a^2

Click For Summary

Homework Help Overview

The discussion revolves around the assertion that for a positive integer n, it can be expressed as n = p + a^2, where p is either a prime number or 1, and a is an integer. The interpretation of prime includes negative primes, leading to a complex exploration of the conditions under which this statement holds.

Discussion Character

  • Exploratory, Assumption checking, Problem interpretation

Approaches and Questions Raised

  • Participants discuss the validity of the statement by considering counterexamples, particularly focusing on the integer 25. There is uncertainty about whether to prove or disprove the assertion, and some participants express confusion regarding the inclusion of negative primes. Others suggest examining specific cases, such as perfect squares, to limit the scope of possibilities.

Discussion Status

The discussion is active, with participants sharing insights and counterexamples. Some guidance has been offered regarding focusing on specific cases to explore the problem further, but there is no consensus on the overall validity of the statement.

Contextual Notes

Participants note the challenge of considering all negative primes and large squares, which complicates the exploration of the problem. The original poster's clarification about the inclusion of negative primes has shifted the focus of the discussion.

jj7964130
Messages
2
Reaction score
0

Homework Statement


Prove or disprove: If n is a positive integer, then [itex]n=p+a^2[/itex] where
  • [itex]a\in\mathbb{Z}[/itex]
  • [itex]p[/itex] is prime or [itex]p=1[/itex]
Note that the interpretation of "prime" used here includes negative primes. So, an exhaustive list of possibilities for p is [itex]p=1,\pm2,\pm3,\pm5,\pm7,\pm11,\cdots[/itex]

Homework Equations


Prime is defined such that if p prime and p divides the product ab, then either p divides a or p divides b. Also, primes are irreducible.

Additionally, the fundamental theorem of arithmetic that defines all integers as a unique product of positive primes may be useful.

The Attempt at a Solution


Originally, I had found 25 as a counterexample that cannot be written as the sum of a prime and a square. Then the problem was clarified to include negative primes, and I'm a bit lost as to where I should start. Namely, I'm not sure if I should be working towards proving or disproving the argument. If anyone's worked through this already and could send me some guidance in the right direction, it would be appreciated.
 
Physics news on Phys.org
##25=-11+6^2##

I see a nice counterexample with a very small n.
 
mfb said:
##25=-11+6^2##

I see a nice counterexample with a very small n.

I'm not sure if an example is necessarily the best route to take...

Regardless of small n, it's very difficult to take into account all negative primes of large magnitude and squares of equally large magnitude. Since the list of possibilities is infinite, I don't see a concrete way to say "this will never be true."
 
Hmm, I did not see "positive" in the requirements. Ok, 0 does not work.
[STRIKE]There might be (p,a) for every positive n.[/STRIKE]
 
Last edited:
jj7964130 said:
I'm not sure if an example is necessarily the best route to take...

Regardless of small n, it's very difficult to take into account all negative primes of large magnitude and squares of equally large magnitude. Since the list of possibilities is infinite, I don't see a concrete way to say "this will never be true."

You do want to concentrate on finding a counterexample. Here's a hint: look at the case where n is a perfect square. Do you see how that helps in limiting the infinity of options?
 

Similar threads

  • · Replies 13 ·
Replies
13
Views
4K
  • · Replies 9 ·
Replies
9
Views
2K
Replies
5
Views
2K
  • · Replies 16 ·
Replies
16
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 9 ·
Replies
9
Views
3K
Replies
4
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 19 ·
Replies
19
Views
5K