A × B B B B A B A
What is the value of the 2-digit integer, B A ?
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.
I do not understand. With x ( y − 1 ) = ≡ 0 ( m o d 1 0 ) , we could have y = 1 , x = 3 . Neither of these are equal to 5. Even if one of them must be 5, we could have y − 1 = 5 right?
What do you mean by "consecutively coprime"? I've not heard that term before.
Log in to reply
Sorry Sir it was typo . I was trying to write consecutive integers . I have changed my solution . Apart from that I try to extended my solution as follows which is Incomplete solution
Incomplete solution 1 0 b 2 + ( a − 1 0 ) b − 9 1 a = 0 Since the equation we have is quadratic in b and solving b we get b = 2 0 − ( a − 1 0 ) ± ( a − 1 0 ) 2 + 4 ⋅ 1 0 ⋅ ( 9 1 a ) = 2 0 − ( a − 1 0 ) + ( a − 1 0 ) 2 + 4 ⋅ 1 0 ⋅ ( 9 1 a ) Since b ∈ Z + < 1 0 implying that right hand side must be < 2 0 0 also discriminant Δ should be perfect square .
Let Δ = p 2 = ( a − 1 0 ) 2 + 3 6 4 0 a = a 2 − 2 0 a + 3 6 4 0 a + 1 0 0 ( p − 1 0 ) ( p + 1 0 ) = a ( a + 2 . 1 8 1 0 )
How do I solve further can you help me ? :) :). I tried however, dealing with two unknowns variables is a bit tough job and feeling lazy .
Log in to reply
Your current solution works, but the last line could be explained better. There are a few steps skipped there.
Note that the "using divisibility rule" and subsequent comments are redundant / wrong. (For example, the second time that you use "mod 11", what you actually mean is "divide by 11" as opposed to "take the remainder after dividing by 11".) What you really want is just to divide everything by 11.
using M a t h e m a t i c a
Select[Range[11,99],#*FromDigits[{s=IntegerDigits[#][[1]],s}]==FromDigits[{t=IntegerDigits[#][[2]],s,s,t}]&]
returns 7 5
Problem Loading...
Note Loading...
Set Loading...
Note down the given cryptogram as ( 1 0 b + a ) ( 1 1 b ) = 1 0 3 a + 1 0 2 b + 1 0 b + a We notice that left hand side is the multiple of 1 1 then right hand side must be the multiple of 1 1 too. Therefore using divisibility rule of 1 1 we get
a − b + b − a ≡ 0 m o d ( 1 1 ) 1 0 0 1 a + 1 1 0 b ≡ 0 m o d ( 1 1 ) = 9 1 a + 1 0 b 9 1 a + 1 0 b = ( 1 0 b + a ) b ⟹ b 9 1 a = 1 0 b + a − 1 0 b a = 1 3 ⋅ 7 1 0 b + a − 1 0 = 7 1 ( 1 3 1 0 b + a − 1 0 ) Here a and b are < 1 0 then b = 1 3 . So b = 7 and a = 5 _ Therefore , two digit number b a = 7 5