This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
2 2 m + 9 m + 8 m + 6 m
Let 2 m = p , 3 m = q .Then the expression becomes p 2 q + q 2 + p 3 + p q = ( p 2 + q ) ( p + q ) = ( 4 m + 3 m ) ( 2 m + 3 m )
Factrorizing 1 9 9 1 = 1 1 × 1 8 1
Here 1 1 , 1 8 1 both are prime numbers so applying Euler's Theorem :
2 1 0 ≡ 1 ( m o d 1 1 ) and 3 1 0 ≡ 1 ( m o d 1 1 )
2 5 ≡ 1 0 ( m o d 1 1 ) and 3 5 ≡ 1 ( m o d 1 1 )
2 5 + 3 5 ≡ 0 ( m o d 1 1 )
Putting m = 5 in another part becomes divisible by 1 8 1 .
If m ! = 5 is not a solution then we have to take \(m=10+5\=15) and continue so on.
So, minimum value will be \(5\)