# Understand the problem

If there exists a calculator with 12 buttons, 10 being the buttons for the digits and A and B being two buttons being processes where if n is displayed on the calculator if A is pressed it increases the displayed number by 1 and if B is pressed it multiplies n by 2 hence 2n. Hence find the minimum number of moves to get 260 from 1

##### Source of the problem

C.M.I (Chennai mathematical institute ) U.G- 2019 entrance

##### Topic

General concepts + Number theory

4 out of 10

##### Suggested Book

Do you really need a hint? Try it first!

DO you know how to start working backward

working backward means that when you press A is makes -1 from the result

and pressing B you can divide 2

strategies are like this , divide the no. as many step you can , when the result it not divisible by 2 just -1

$$260\rightarrow130\rightarrow65\rightarrow64\rightarrow32\rightarrow16\rightarrow8\rightarrow4\rightarrow2\rightarrow1$$

# Connected Program at Cheenta # I.S.I. & C.M.I. Entrance Program

Indian Statistical Institute and Chennai Mathematical Institute offer challenging bachelor’s program for gifted students. These courses are B.Stat and B.Math program in I.S.I., B.Sc. Math in C.M.I.

The entrances to these programs are far more challenging than usual engineering entrances. Cheenta offers an intense, problem-driven program for these two entrances.

# Similar Problem

## cos(sin(x)) function in ISI Entrance

A simple trigonometric equation from ISI Entrance. Try this problem. We also added a quiz, some related problems, and finally video.

## Geometry of AM GM Inequality

AM GM Inequality has a geometric interpretation. Watch the video discussion on it and try some hint problems to sharpen your skills.

## Counting triangles in ISI Entrance

Can you combine geometry and combinatorics? This ISI Entrance problems requires just that. We provide sequential hints, additional problems and video.

## Paper folding geometry in ISI Entrance

A problem from ISI Entrance that requires Paper folding geometry. We provide sequential hints so that you can try the problem!

## An Hour of Beautiful Proofs

Every week we dedicate an hour to Beautiful Mathematics - the Mathematics that shows us how Beautiful is our Intellect. This week, I decided to do three beautiful proofs in this one-hour session... Proof of Fermat's Little Theorem ( via Combinatorics )It uses...

## Inequality – In Equality

This article aims to give you a brief overview of Inequality, which can be served as an introduction to this beautiful sub-topic of Algebra. This article doesn't aim to give a list of formulas and methodologies stuffed in single baggage, rather it is specifically...

## AM GM inequality in ISI Entrance

Arithmetic Mean and Geometric Mean inequality form a foundational principle. This problem from I.S.I. Entrance is an application of that.

## How to solve an Olympiad Problem (Number Theory)?

Suppose you are given a Number Theory Olympiad Problem. You have no idea how to proceed. Totally stuck! What to do? This post will help you to atleast start with something. You have something to proceed. But as we share in our classes, how to proceed towards any...

## How are Bezout’s Theorem and Inverse related? – Number Theory

The inverse of a number (modulo some specific integer) is inherently related to GCD (Greatest Common Divisor). Euclidean Algorithm and Bezout’s Theorem forms the bridge between these ideas. We explore these beautiful ideas.

## How to use Invariance in Combinatorics – ISI Entrance Problem

Invariance is a fundamental phenomenon in mathematics. In this combinatorics problem from ISI Entrance, we discuss how to use invariance.