Solving Integer Cubes & Squares: 7k & 3k?

  • Thread starter Thread starter MAGICMATHS
  • Start date Start date
  • Tags Tags
    Integer Squares
MAGICMATHS
Messages
7
Reaction score
0
I am trying to solve how an integer is simultaneously that is simultaneously a square and a cube number must be either of the form 7k or 7k+1 and I am failing when i work (7k+2)^2, even (7k+3)^2....Can i interpret 7k+1 as 7k+(-1), i think i can't but then i fail in many steps! Also i know that any square number can be expressed as 3k or 3k+1...IS THERE SOMETHING SIMILAR FOR THE CUBIC PLEASE?
 
Physics news on Phys.org
MAGICMATHS said:
I am trying to solve how an integer is simultaneously that is simultaneously a square and a cube number must be either of the form 7k or 7k+1 and I am failing when i work (7k+2)^2, even (7k+3)^2....Can i interpret 7k+1 as 7k+(-1), i think i can't but then i fail in many steps! Also i know that any square number can be expressed as 3k or 3k+1...IS THERE SOMETHING SIMILAR FOR THE CUBIC PLEASE?

The easiest way is using Fermat's Little Theorem.

Let a be any integer. If a is both a square and a cube, it is a sixth power.

By Fermat's Little Theorem,

a^7 \equiv a \pmod 7

Two cases:

Case 1: 7 \nmid a

Hence, a^6 \equiv 1 \pmod 7 \Rightarrow a^6 = 7k + 1, k \in \mathbb{Z}.

Case 2: 7 | a

Hence, a^6 \equiv 0 \pmod 7 \Rightarrow a^6 = 7k, k \in \mathbb{Z}.

So a^6 is either of the form 7k or 7k + 1 (QED).

You can construct something exactly like this for the squares modulo 3, and indeed generalise it for any (p-1)th power modulo a prime p.

Do you think the analogous statement for cubes would be true, given that 4 is composite?
 
Last edited:
I don't know Fermat`s little Theory, i just started number theory to be honest ..is there a possibility using div alg pls?
 
MAGICMATHS said:
I don't know Fermat`s little Theory, i just started number theory to be honest ..is there a possibility using div alg pls?

Well, you could use the longer method presented here: http://www.mathyards.com/vb/showthread.php?691-Division-Algorithm-help !
 
Last edited by a moderator:
MagicMaths, if this is homework or coursework, could you please post it in the appropriate homework forum (precalculus mathematics) in future, please?
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top