Finding Squares Between Cubes in Elementary Number Theory

In summary, the conversation discusses how to show that between any two cubes there are at least 2 squares among the positive integers greater than or equal to 8. The method suggested is to find two squares between n^3 and (n+1)^3 where n is arbitrary and greater than 1. This can be done by showing that it is not possible to have two cubes between m^2 and (m+2)^2.
  • #1
tara123
12
0
Im really good at number theory but how to show this statement has me stumped!

"Show that among the positive integers greater than or equal to 8, between any two cubes there are at least 2 squares"
 
Physics news on Phys.org
  • #2
Can you find 2 squares between n^3 and (n+1)^3?
 
  • #3
yah if u allow for the restriction of n>=8
if u have 8^3=512 and 9^3=729
then there's 23^2=529 and 24^2=576 both of which are between the cubes..
 
  • #4
You have found two squares between the two particular cubes 8^3 and 9^3, but what about between two generic cubes n^3 and (n+1)^3, where n is arbitrary (and >1).

You can do it by showing it is not possible to have two cubes between m^2 and (m+2)^2. That is, assume m^2 < n^3 and (n+1)^3 < (m+2)^2 and deduce a contradiction.
 

Related to Finding Squares Between Cubes in Elementary Number Theory

1. What is elementary number theory?

Elementary number theory is a branch of mathematics that studies the properties of integers, including prime numbers, divisibility, and arithmetic operations.

2. What are prime numbers?

Prime numbers are positive integers that are only divisible by 1 and themselves. Some examples of prime numbers are 2, 3, 5, 7, and 11.

3. What is the Fundamental Theorem of Arithmetic?

The Fundamental Theorem of Arithmetic states that every positive integer can be represented uniquely as a product of primes. For example, 12 can be written as 2 x 2 x 3, where 2 and 3 are prime numbers.

4. What is the Sieve of Eratosthenes?

The Sieve of Eratosthenes is a method for finding all prime numbers up to a given number. It involves creating a list of numbers and crossing off all multiples of each prime number until only the prime numbers remain.

5. How is elementary number theory used in cryptography?

Elementary number theory plays a crucial role in the field of cryptography, which is the study of secure communication. Prime numbers and their properties are used to create encryption algorithms that protect sensitive data.

Similar threads

Replies
2
Views
994
Replies
3
Views
2K
  • General Math
Replies
1
Views
1K
Replies
4
Views
1K
  • Science and Math Textbooks
Replies
3
Views
1K
Replies
11
Views
1K
  • Beyond the Standard Models
Replies
6
Views
2K
  • Calculus and Beyond Homework Help
Replies
1
Views
2K
Replies
5
Views
491
  • Calculus and Beyond Homework Help
Replies
1
Views
569
Back
Top