mersenneforum.org Missing Digits!
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2007-07-05, 16:27 #1 mfgoode Bronze Medalist     Jan 2004 Mumbai,India 22·33·19 Posts Missing Digits! Heres one straight from the book so no Oohs! and Aahs.! But dont use the computers! Just base your answer on strict math principles! and I dont just want the answer only but also the method to eliminate guess work. Well here it is: Two digits of the 8 digit number 273*49*5 were erased. The number is divisible by 9 and 11. Find the missing digits. * stands for missing digit. Try your hand on it! Mally
 2007-07-05, 16:44 #2 alpertron     Aug 2002 Buenos Aires, Argentina 2·32·79 Posts Working mod 9: 2+7+3+a+4+9+b+5 = 0 => a+b = -30 = 6 (mod 9) Working mod 11: -2+7-3+a-4+9-b+5 = 0 => a-b = -12 = -1 (mod 11) So: a = b-1 a+a+1=6 (mod 9) -> a=7 The number must be: 27374985
 2007-07-05, 16:52 #3 S485122     "Jacob" Sep 2006 Brussels, Belgium 1,777 Posts let the first unknown diigt be a and the second b. divisibility by 9 gives us : 3+a+b=0 mod 9 divisibility by 11 gives us : 5+9+a+7=b+4+3+2 mod 11 => a+21 = b+9 mod 11 => a+1=b mod 11 => Since a and b are not negative and less than 10 => a+1=b substituting in the first equation 3+a+a+1=0 mod 9 => 2*a+4=18 (since 0 would give a negative a and 9 a fractional a) and thus a=7, b=8 the final number is 27374985 But I was to long in editing. Last fiddled with by S485122 on 2007-07-05 at 16:53 Reason: to slow...
 2007-07-05, 17:08 #4 mfgoode Bronze Medalist     Jan 2004 Mumbai,India 1000000001002 Posts Quick on the draw! :surprised You are quick on the draw Alpertron and S485122 Hats off to you! The next time I will give a harder one with you in mind Mally
2007-07-05, 17:18   #5
davieddy

"Lucan"
Dec 2006
England

647410 Posts

Quote:
 Originally Posted by mfgoode :surprised You are quick on the draw Alpertron and S485122 Hats off to you! The next time I will give a harder one with you in mind Mally
That one went over my head Mally.
Sounds like it was solved?

D.

 2007-07-05, 17:41 #6 alpertron     Aug 2002 Buenos Aires, Argentina 2·32·79 Posts This puzzle must be resolved by Mally. Please do not give any hints. The number 823***546 is multiple of the numbers 7, 11 and 13. You will need to write the missing three digits without using the computer.
2007-07-05, 22:49   #7
maxal

Feb 2005

11·23 Posts

Quote:
 Originally Posted by alpertron The number 823***546 is multiple of the numbers 7, 11 and 13. You will need to write the missing three digits without using the computer.
Let x be the unknown 3-digit number. We have:
823000546 + x*1000 = 0 (mod 1001)
implying that
x = 823000546 = 368 (mod 1001).
Therefore, x=368.

 2007-07-05, 23:08 #8 alpertron     Aug 2002 Buenos Aires, Argentina 2×32×79 Posts The puzzle is trivial, but I wanted Mally to solve it.
2007-07-06, 16:36   #9
mfgoode
Bronze Medalist

Jan 2004
Mumbai,India

22·33·19 Posts

Quote:
 Originally Posted by maxal Let x be the unknown 3-digit number. We have: 823000546 + x*1000 = 0 (mod 1001) implying that x = 823000546 = 368 (mod 1001). Therefore, x=368.
:surprised

Thank you maxal for coming to my rescue in the face of an open challenge by Alpertron directed specifically to me and no other!

Well history is replete with such rivalry so its no surprise.

Well he has meant well and Im grateful to him for posing this similar problem to mine with a twist.

To be honest, I had no clue as to how to tackle it until I saw your concise and elegant solution.

Still there is a wide gap between your two lines. I understand the first but cannot arrive at the logic how you imply 368 from the last line.

I will be grateful if you give the full working as it is one for my book. Thanks!

Regards,

Mally

2007-07-06, 16:50   #10
mfgoode
Bronze Medalist

Jan 2004
Mumbai,India

22×33×19 Posts
A Special!

Quote:
 Originally Posted by alpertron This puzzle must be resolved by Mally. Please do not give any hints. .
Thank you Alpertron for posing this problem to me.

Whereas I welcome all types of problems the ones I give are with a motive of enlightening, instructing, and for discussing and NOT for ridiculing or embarrassing anyone.

Let us therefore exchange views in the Spirit of Truth which is like the seven seas of old lying openly before us.

I know my problems have been controversial in the past but let the dead past bury the dead and move to a new order.

As Roger Penrose says "Controversy is an important part in the development of Science" [Road to Reality]

You your self put an end to the last one for which I am very grateful.

Thank you,

Mally

 2007-07-06, 16:55 #11 alpertron     Aug 2002 Buenos Aires, Argentina 101100011102 Posts I wanted you to solve it because it is very similar to the problem you presented. If a number is multiple of 7, 11 and 13, since all these numbers are relatively primes, you get that the original number must be multiple of 7*11*13 = 1001. Now, given that 1000 = -1 (mod 1001) we get: n = 823***546 = 823 * (1000^2) + x * 1000 + 546 = 823 - x + 546 = 0 (mod 1001) This means that x = 823 + 546 = 1369 = 368 (mod 1001) So the number n must be 823368546.

 Similar Threads Thread Thread Starter Forum Replies Last Post NBtarheel_33 Data 6 2016-05-31 15:27 R.D. Silverman GMP-ECM 3 2011-03-18 21:35 fivemack Factoring 4 2008-03-04 05:04 henryzz Math 10 2007-12-08 12:45 tha Data 6 2003-09-14 21:36

All times are UTC. The time now is 11:56.

Mon Jan 24 11:56:34 UTC 2022 up 185 days, 6:25, 0 users, load averages: 1.97, 1.69, 1.52

Copyright ©2000 - 2022, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔