Consider all functions g from the positive integers to the positive integers such that:(adsbygoogle = window.adsbygoogle || []).push({});

(a) For each positive integer p there exists an unique positive integer q such that g(q) = p;

(b) For each positive integer q, we have g(q+1) as either 4g(q) -1; or;

g(q) -1.

Determine the set of positive integers s such that:

g(1999) = s; for some function g possessing both the properties (a) and (b).

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# An Integer Function Puzzle

Loading...

Similar Threads for Integer Function Puzzle | Date |
---|---|

I Linear mapping of a binary vector based on its decimal value | Mar 23, 2018 |

Finding if an integer is odd through Riemann or some function? | Sep 17, 2012 |

Numbers which are not ultimately functions of integers | Mar 14, 2012 |

Integer-valued function | May 4, 2009 |

Recursive formula for zeta function of positive even integers | Oct 21, 2005 |

**Physics Forums - The Fusion of Science and Community**