Categories
I.S.I. and C.M.I. Entrance Problem Solving Marathon

Number Theory – Working backward – C.M.I UG -2019

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  

Start with hints

Source of the problem

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

Topic

General concepts + Number theory

Difficulty Level
4 out of 10

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

Carpet Strategy in Geometry | Watch and Learn

Here is a video solution for a Problem based on Carpet Strategy in Geometry. This problem is helpful for Math Olympiad, ISI & CMI Entrance, and other math contests. Watch and Learn! Here goes the question… Suppose ABCD is a square and X is a point on BC such that...

Bijection Principle Problem | ISI Entrance TOMATO Obj 22

Here is a video solution for a Problem based on Bijection Principle. This is an Objective question 22 from TOMATO for ISI Entrance. Watch and Learn! Here goes the question… Given that: x+y+z=10, where x, y and z are natural numbers. How many such solutions are...

What is the Area of Quadrilateral? | AMC 12 2018 | Problem 13

Here is a video solution for a Problem based on finding the area of a quadrilateral. This question is from American Mathematics Competition, AMC 12, 2018. Watch and Learn! Here goes the question… Connect the centroids of the four triangles in a square. Can you find...

Solving Weird Equations using Inequality | TOMATO Problem 78

Here is a video solution for ISI Entrance Number Theory Problems based on solving weird equations using Inequality. Watch and Learn! Here goes the question… Solve: 2 \cos ^{2}\left(x^{3}+x\right)=2^{x}+2^{-x} We will recommend you to try the problem yourself. Done?...

AM-GM Inequality Problem | ISI Entrance

Here is a video solution for ISI Entrance Number Theory Problems based on AM-GM Inequality Problem. Watch and Learn! Here goes the question… a, b, c, d are positive real numbers. Prove that: (1+a)(1+b)(1+c)(1+d) <= 16. We will recommend you to try the problem...

Sum of 8 fourth powers | ISI Entrance Problem

Here is a video solution for ISI Entrance Number Theory Problems based on Sum of 8 fourth powers. Watch and Learn! Can you show that the sum of 8 fourth powers of integers never adds up to 1993? How can you solve this fourth-degree diophantine equation? Let’s...

ISI Entrance 2020 Problems and Solutions – B.Stat & B.Math

Problems and Solutions of ISI BStat and BMath Entrance 2020 of Indian Statistical Institute.

Testing of Hypothesis | ISI MStat 2016 PSB Problem 9

This is a problem from the ISI MStat Entrance Examination,2016 making us realize the beautiful connection between exponential and geometric distribution and a smooth application of Central Limit Theorem.

ISI MStat PSB 2006 Problem 8 | Bernoullian Beauty

This is a very simple and regular sample problem from ISI MStat PSB 2009 Problem 8. It It is based on testing the nature of the mean of Exponential distribution. Give it a Try it !

2 replies on “Number Theory – Working backward – C.M.I UG -2019”

here it is said to find minimum ways

let 1 was typed now i press another digit key 3 now i again pressed a digit 0 then i press B

hence it proceed that 1-13-130-260 hence it is only 3 moves ………

Leave a Reply

This site uses Akismet to reduce spam. Learn how your comment data is processed.