Pre-RMO 2014/18

Let ff be a one-to-one function from the set of natural numbers to itself such that f(mn)=f(m)f(n)f(mn) = f(m)f(n) for all natural numbers mm and nn. What is the least possible value of f(999)f(999)?


This note is part of the set Pre-RMO 2014

Note by Pranshu Gaba
5 years, 1 month ago

No vote yet
1 vote

  Easy Math Editor

This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.

When posting on Brilliant:

  • Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
  • Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
  • Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
  • Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 2×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \boxed{123}

Comments

Sort by:

Top Newest

We can write f(999)=(f(3))3f(37)f(999) = (f(3))^3 \cdot f(37)

To minimize this expression we can define the function ff as follows:

If xx is composite, it must be prime factorized, as f(999)f(999) is factorized above. Then:

f(x)={1x=137x=22x=33x=37px=p,p is a prime2,3,37f(x) = \begin{cases} 1 & x = 1 \\ 37 & x = 2 \\ 2 & x = 3 \\ 3 & x = 37 \\ p & x = p, p \text{ is a prime} \neq 2, 3, 37\end{cases}

This gives f(999)=8×3=24f(999) = 8 \times 3 = \boxed{24}.

Pranshu Gaba - 5 years ago

Log in to reply

Good. But you need to justify that this function is one-one. This is not required in the exam, but still as a matter of learning, one should leave no loop hole.

Siddhesh Naik - 5 years ago

Log in to reply

It is clearly justified, isn't it. For 1,2,3,37, it is visible that it is one -one. For all numbers other than 2, 3, 37 it is one-one because if the number is prime then it maps the prime number to itself hence one-one, and if it is composite then it can be written as a product of its primes which will yield product of one-one functions which is one-one itself.(as the function gives unique primes).

Geeta . - 1 year, 4 months ago

Log in to reply

@Geeta . thanks Geeta

Bhaskar Pandey - 1 year, 2 months ago

Log in to reply

f(x)=xnf(x) = x^{n} (n is odd number)

Least possible value of

f(999)=0,when n f(999) = 0, \text{when n }\to -\infty

Krishna Sharma - 5 years, 1 month ago

Log in to reply

I don't think f(x)=xnf(x) = x^n is a one-to-one function, as not all natural numbers are included in the range of f(x)f(x). Also, if nn is negative, f(x)f(x) will be a fraction, but we want it to be a natural number.

Pranshu Gaba - 5 years ago

Log in to reply

f(x)=xnf(x)=x^n is indeed a one-one function if nn is odd, but it is not mapped on set of Natural numbers if nn is negative, so this function does not satisfy the given conditions.

Siddhesh Naik - 5 years ago

Log in to reply

Is the answer 24?

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...