in Quantitative Aptitude edited by
1,853 views
1 vote
1 vote

Given a positive integer $m$, we define $f(m)$ as the highest power of $2$ that divides $m$. If $n$ is a prime number greater than $3$, then

  1. $f(n^3-1) = f(n-1)$
  2. $f(n^3-1) = f(n-1) +1$
  3. $f(n^3-1) = 2f(n-1)$
  4. None of the above is necessarily true
in Quantitative Aptitude edited by
1.9k views

1 comment

Plz enlarge the size.not readable
0
0

3 Answers

4 votes
4 votes
Best answer
We can write $(n^3 - 1) = n^3 - 1^3$

Now, applying the formula $$a^3 - b^3 = (a – b)(a^2 + ab + b^2)$$

$$\implies n^3 - 1 = (n - 1)(n^2 + n + 1)$$

We observe that $(n^3 - 1)$ is divisible by $(n - 1)$.

Since $(n^3 - 1)$ is divisible by $(n - 1)$, so, if some $2^k$ divides $(n - 1)$, then that same $2^k$ will divide $(n^3 - 1)$ as $(n - 1)$ is a factor of $(n^3 - 1)$. We don't take into account $(n^2 + n + 1)$ as it is always odd, i.e., for both even and odd $n$. So, $(n^2 + n + 1)$ is not divisible by $2$.

Therefore, $f(n^3 - 1) = f(n - 1)$.

This is true for all $n > 2$.

For $n = 2$, $$(n^3 - 1) = (2^3 - 1) = 8 - 1 = 7$$ which is the only prime number of the form $(n^3 - 1)$. Since in question, they have clearly written that $n > 3$, the answer is $$f(n^3 - 1) = f(n - 1)$$

i.e., Option $(A)$.
edited by

3 Comments

what about $n^2+n+1$ . It might also be even. Your argument establishes the fact that  $f(n^3-1)\geq f(n-1)$ . Not equality.
0
0
If $n$ is even, $n^2 + n + 1$ will be an odd number. And if $n$ is odd, then too $n^2 + n + 1$ will be odd. :)
1
1
$n^2 + n + 1$ will not be even.
0
0
0 votes
0 votes
$n^3 -1=(n-1)(n^2+n+1)$
$n>3$ is a prime number
$\implies n^3, n^2, n $ are odd numbers

$\implies n^3-1, n-1$ are even numbers, and $n^2+n+1$ is odd number because sum of three odd numbers is odd.

That means $n^2+n+1$ has no hidden powers of 2 and $\implies n^3-1, n-1$ have equal number of factors of 2.
$\implies f(n-1)= f(n^3 -1)$ where $f$ is a function which outputs the highest power of $2$ (given in question).

So $A$ is correct.
0 votes
0 votes
n^3 – 1 = (n – 1)(n^2 + n + 1)

also, n^2 + n + 1 = odd, as n^2 is odd, n is odd ad 1 is odd.

Hence, if f(n – 1) = x, then f(n^3 – 1) is also x, as only (n – 1) part contains 2 as factor and the other part is odd.

So, f(n – 1) = f(n^3 – 1)
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true