# Positive integer not divisible by 7

• Jan 14th 2011, 06:02 AM
Hellbent
Positive integer not divisible by 7
Hi,

Is there a simple explanation for this?

The positive integer $\displaystyle n$ is not divisible by $\displaystyle 7$. The remainder when $\displaystyle n^2$ is divided by 7 and the remainder when $\displaystyle n$ is divided by $\displaystyle 7$ are each equal to $\displaystyle k$. What is $\displaystyle k$?

A. 1
B. 2
C. 4
D. 6
E. It cannot be determined from the information given.

I just looked at the middle part and concluded the answer to be 1. The only numbers I know that are equal to their squares are 0 and 1. Zero isn't available.
• Jan 14th 2011, 06:18 AM
Unknown008
I can't see any answer besides A. ..

Note that it cannot be zero because otherwise, n would be a multiple of 7.
• Jan 14th 2011, 06:27 AM
Pranas
Quote:

Originally Posted by Hellbent
Hi,

Is there a simple explanation for this?

The positive integer $\displaystyle n$ is not divisible by $\displaystyle 7$. The remainder when $\displaystyle n^2$ is divided by 7 and the remainder when $\displaystyle n$ is divided by $\displaystyle 7$ are each equal to $\displaystyle k$. What is $\displaystyle k$?

A. 1
B. 2
C. 4
D. 6
E. It cannot be determined from the information given.

I just looked at the middle part and concluded the answer to be 1. The only numbers I know that are equal to their squares are 0 and 1. Zero isn't available.

I have to agree.
Let's say our number can be written as:
$\displaystyle $n = 7m + k$$
Therefore $\displaystyle ${n^2} = 49 \cdot {m^2} + 14 \cdot m \cdot k + {k^2} = 7 \cdot (7 \cdot {m^2} + 2 \cdot m \cdot k) + {k^2}$$

We actually have to keep in mind, that we are trying to evaluate $\displaystyle $k$$ itself and only remainder of $\displaystyle ${k^2}$$ when it's divided by 7.
However, in your case there really are no other possible scenarios other than $\displaystyle $k = {k^2} = 1$$ (you can run through $\displaystyle $k = \overline {1,6}$$ to make sure of that).
• Jan 15th 2011, 03:46 AM
Quote:

Originally Posted by Hellbent
Hi,

Is there a simple explanation for this?

The positive integer $\displaystyle n$ is not divisible by $\displaystyle 7$. The remainder when $\displaystyle n^2$ is divided by 7 and the remainder when $\displaystyle n$ is divided by $\displaystyle 7$ are each equal to $\displaystyle k$. What is $\displaystyle k$?

A. 1
B. 2
C. 4
D. 6
E. It cannot be determined from the information given.

I just looked at the middle part and concluded the answer to be 1. The only numbers I know that are equal to their squares are 0 and 1. Zero isn't available.

$\displaystyle \displaystyle\frac{n^2}{7}=m+\frac{k}{7}\Rightarro w\ n^2-7m-k=0$

$\displaystyle \displaystyle\frac{n}{7}=x+\frac{k}{7}\Rightarrow\ n-7x=k$

Substitute k

$\displaystyle n^2-7m-n+7x=0\Rightarrow\ n^2-n+7(x-m)=0$

$\displaystyle \Rightarrow\ (n+7)(n+x-m)=n^2+(-1)n+7(x-m)\Rightarrow\ x-m=-8\Rightarrow\ m-x=8$

$\displaystyle (n-8)(n+7)=0\Rightarrow\ n=8$

$\displaystyle \displaystyle\frac{n^2}{7}=\frac{64}{7}=9\frac{1}{ 7}$

$\displaystyle \displaystyle\frac{8}{7}=1\frac{1}{7}$

The remainder is 1.
• Jan 15th 2011, 04:37 AM
Pranas
Quote:

$\displaystyle \displaystyle\frac{n^2}{7}=m+\frac{k}{7}\Rightarro w\ n^2-7m-k=0$

$\displaystyle \displaystyle\frac{n}{7}=x+\frac{k}{7}\Rightarrow\ n-7x=k$

Substitute k

$\displaystyle n^2-7m-n+7x=0\Rightarrow\ n^2-n+7(x-m)=0$

$\displaystyle \Rightarrow\ (n+7)(n+x-m)=n^2+(-1)n+7(x-m)\Rightarrow\ x-m=-8\Rightarrow\ m-x=8$

$\displaystyle (n-8)(n+7)=0\Rightarrow\ n=8$

$\displaystyle \displaystyle\frac{n^2}{7}=\frac{64}{7}=9\frac{1}{ 7}$

$\displaystyle \displaystyle\frac{8}{7}=1\frac{1}{7}$

The remainder is 1.

Could you please clarify how did you come up with
$\displaystyle \displaystyle \((n+7)(n+x-m)=n^2+(-1)n+7(x-m)\Rightarrow\ x-m=-8\Rightarrow\ m-x=8$

and $\displaystyle \displaystyle ${\rm{n = 8}}$$

If you concluded, that there is only one appropriate value for $\displaystyle \displaystyle ${n}}$$ under given circumstances, that is not true.
Otherwise my apologies if I misunderstood something.
• Jan 15th 2011, 04:51 AM
$\displaystyle \displaystyle \((n+7)(n+x-m)=n^2+(-1)n+7(x-m)\Rightarrow\ x-m=-8\Rightarrow\ m-x=8$
and $\displaystyle \displaystyle ${\rm{n = 8}}$$
If you concluded, that there is only one appropriate value for $\displaystyle \displaystyle ${n}}$$ under given circumstances, that is not true.
{"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 2, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "http://mathhelpforum.com/algebra/168338-positive-integer-not-divisible-7-a-print.html", "fetch_time": 1529698658000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2018-26/segments/1529267864795.68/warc/CC-MAIN-20180622201448-20180622221448-00255.warc.gz", "warc_record_offset": 213394759, "warc_record_length": 3627, "token_count": 1433, "char_count": 4419, "score": 4.3125, "int_score": 4, "crawl": "CC-MAIN-2018-26", "snapshot_type": "latest", "language": "en", "language_score": 0.9109811186790466, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00041-of-00064.parquet"}