Understand the problem

Let \(a,b,c \in \mathbb{N}\) be such that
\(a^2+b^2=c^2\) and \(c-b=1\).
Prove that
(i) \(a\) is odd,
(ii) \(b\) is divisible by 4,
(iii) \(a^b+b^a\) is divisible by \(c\).

 

Source of the problem

I.S.I. (Indian Statistical Institute) B.Stat/B.Math Entrance Examination 2018. Subjective Problem no. 7.

Topic

Number Theory

Difficulty Level

8 out of 10

Suggested Book

‘Elementary Number Theory’ by David M. Burton
‘Challenge and Thrill of Pre-College Mathematics’ by V,Krishnamurthy, C.R.Pranesachar, ect.

Start with hints

Do you really need a hint? Try it first!

\(a^2+b^2=c^2=(b+1)^2=b^2+2b+1\)

\(\Rightarrow a^2=2b+1\) Which implies \(a^2\) is odd integer.

\(\Rightarrow a\) is also an odd integer =\(2k+1\) (say).

\((2k+1)^2+b^2=c^2\)

\(\Rightarrow 4k^2+4k+1+b^2=b^2+2b+1\)

\(\Rightarrow b=2k(k+1)\).

Now \(k(k+1) \) is always even =\(2l\) (say).

Therefore, \(b=4l\), i.e. \(b\) is divisible by 4.

 

\(a^b+b^a=a^{4l}+b^{2k+1}=(a^2)^{2l}+(c-1)^{2k+1}\)

=\((2b+1)^{2l}+(c-1)^{2k+1}\)

=\((2c-1)^{2l}+(c-1)^{2k+1}.\)

Now \(2l\) is even , therefore , \((2c-1)^{2l} \) is of the form : \( 2cp+1\) where \(p \in \mathbb{N}\).

And \(2k+1\) is odd , therefore \((c-1)^{2k+1} \) is of the form : \(cq-1\), where \(q \in \mathbb{N}\).

Therefore \(a^b+b^a=(2cp+1)+(cq-1)=c\cdot (2p+q)\).

\(\Rightarrow c|a^b+b^a\).

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

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.

The best exponent for an inequality

Understand the problemLet be positive real numbers such that .Find with proof that is the minimal value for which the following inequality holds:Albania IMO TST 2013 Inequalities Medium Inequalities by BJ Venkatachala Start with hintsDo you really need a hint?...

A functional inequation

Understand the problemFind all functions such thatholds for all . Benelux MO 2013 Functional Equations Easy Functional Equations by BJ Venkatachala Start with hintsDo you really need a hint? Try it first!Note that the RHS does not contain $latex y$. Thus it should...

Mathematical Circles Inequality Problem

A beautiful inequality problem from Mathematical Circles Russian Experience . we provide sequential hints . key idea is to use arithmetic mean , geometric mean inequality.

RMO 2019

Regional Math Olympiad (RMO) 2019 is the second level Math Olympiad Program in India involving Number Theory, Geometry, Algebra and Combinatorics.

Application of eigenvalue in degree 3 polynomial: ISI MMA 2018 Question 14

This is a cute and interesting problem based on application of eigen values in 3 degree polynomial .Here we are finding the determinant value .

To find Trace of a given Matrix : ISI MMA 2018 Question 13

These is a cute and interesting sum where the trace of a given matrices needs to be found using a very simple but effective method

Costa Rica NMO 2010, Final Round, Problem 4 – Number Theory

The problem is a beautiful application of the techniques in Diophantine Equation from Costa Rica Math Olympiad 2010.