Lemmas are lame

Number Theory Level 2

Assume a , k ∈ Z + a,k \in \mathbb{Z}^+ and k > 1 k>1 , then what can you say about the statement below:

If a ∣ k a n d a ∣ ( − k ) a \ | \ k \ and \ a \ | \ (-k) then a = 1 o r k a=1 \ or \ k if k k is a prime number.

Try more of my original problems in this set .

Incomplete False True

Nihar Mahajan by Nihar Mahajan , 20, India

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Siddharth Singh
Jun 6, 2015

That's certainly true.Since k is a prime number it has only 2 factors that is k and 1 and it is given that a is a factor of k,this means that either a=1 or k.

1 Helpful 0 Interesting 0 Brilliant 0 Confused

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...