Confirming your payment

Skip to content

Competency-Based Questions (CBQ) · Question 23 of 80

A fair booth converts rupees into game tokens.

Question 231 markMCQMedium

A fair booth converts rupees into game tokens. A customer who hands over xx rupees receives

g(x)=2x+1g(x)=2x+1

tokens — two tokens for every rupee, plus one bonus token for using the booth. Taken as g:R→Rg:\mathbb{R}\to\mathbb{R}, this is a bijection, so it can be undone.

A customer ends the day holding 1515 tokens and wants to know how many rupees produced them. Which option gives both the correct rule g−1g^{-1} and the correct number of rupees?

Select your answer
  • (A) g−1(y)=y−12g^{-1}(y)=\dfrac{y-1}{2}, and 1515 tokens came from 77 rupees

    Correct answer
  • (B) g−1(y)=y+12g^{-1}(y)=\dfrac{y+1}{2}, and 1515 tokens came from 88 rupees

  • (C) g−1(y)=y2−1g^{-1}(y)=\dfrac{y}{2}-1, and 1515 tokens came from 6.56.5 rupees

  • (D) g−1(y)=12y+1g^{-1}(y)=\dfrac{1}{2y+1}, and 1515 tokens came from 131\dfrac{1}{31} rupees