Functions struggling with the modulo

Let f f be a cubic polynomial function with integer coefficients and a b (mod 9) a \equiv b \text{ (mod 9)} , where a a and b b be natural numbers.

Then, if you divide the expression f ( a ) f ( b ) |f(a)-f(b)| by 18, what would be the nature of the decimal expansion (after radix point) of the resulting expression?

Explanation : For example, the decimal expansion after the radix point of 299.12123123412345... is 12123123412345....

Bonus : Try to find out the repeating digits in the expansion, if it is non-terminating.

Terminating Non-terminating

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

Chew-Seong Cheong
Nov 30, 2016

Let f ( x ) = α x 3 + β x 2 + γ x + δ f(x) = \alpha x^3 + \beta x^2 + \gamma x + \delta , where α \alpha , β \beta , γ \gamma and δ \delta are integers. Then, we have:

f ( a ) f ( b ) = α ( a 3 b 3 ) + β ( a 2 b 2 ) + γ ( a b ) = ( a b ) ( α ( a 2 + a b + b 2 ) + β ( a + b ) + γ ) \begin{aligned} f(a) - f(b) & = \alpha (a^3-b^3) + \beta (a^2 - b^2) + \gamma (a-b) \\ & = (a-b)(\alpha (a^2 + ab + b^2) + \beta (a + b) + \gamma) \end{aligned}

Since a b (mod 9) a \equiv b \text{ (mod 9)} , we can write a = 9 k + b a=9k+b , where k k is a natural number. Then, we have:

f ( a ) f ( b ) 18 = ( 9 k + b b ) ( α ( a 2 + a b + b 2 ) + β ( a + b ) + γ ) 18 = 9 k ( α ( a 2 + a b + b 2 ) + β ( a + b ) + γ ) 18 = k 2 ( α ( a 2 + a b + b 2 ) + β ( a + b ) + γ ) \begin{aligned} \frac {|f(a) - f(b)|}{18} & = \frac {|(9k+b-b)(\alpha (a^2 + ab + b^2) + \beta (a + b) + \gamma)|}{18} \\ & = \frac {|9k(\alpha (a^2 + ab + b^2) + \beta (a + b) + \gamma)|}{18} \\ & = \left| \frac k2 (\alpha (a^2 + ab + b^2) + \beta (a + b) + \gamma) \right| \end{aligned}

The decimal expansion of a positive integer n n divided by 2 is either 0 when n n is even or 5 when n n is odd, therefore, it is terminating \boxed{\text{terminating}} .

Nice.Actually I don't have that much time to write my own solution nor I am very good at writing in LATEX.So here is just a small suggestion for your solution.Instead of introducing variables,introduce a new concept,which is very famous,that for any polynomial function f f ,with integer coefficients,and,if a b (mod 9) a \equiv b \text{ (mod 9)} ,then f ( a ) f ( b ) (mod 9) f(a) \equiv f(b) \text{ (mod 9)} .So now the problem is almost solved.As f ( a ) f ( b ) (mod 9) f(a) \equiv f(b) \text{ (mod 9)} ,so, it is clear that f ( a ) f ( b ) f(a)-f(b) is divisible by 9.So let the integer quotient be q q .Now ,we divide q q by 2,so we divided the overall numerator by 18.Problem solved.Do you think that this will be more easy to understand by the community?

Anandmay Patel - 4 years, 6 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...