2 Questionsby Matthollyw00d Tags: None 

#1
May3109, 02:57 PM

P: 92

First Question:
Let N_{n} be the integer whose decimal expansion consists of n consecutive ones. For example, N_{2}=11 and N_{7}=1,111,111. Show that N_{n}N_{m} iff nm. Second Question: If (a,c)=1, prove that (a,bc)=(a,b). On the second question I can see that it is true because a and c are relatively prime, I realize that ax_{1}+bx_{2}=1, but I'm having difficulty expressing it in a proof satisfactory way. I think I'm just over looking a fact somewhere in my text. As for the first one, I'm not very certain as to where at all to start, so any and all help here would be appreciated. Note that I'm not really wanting the full proof of either, more or less just a few helpful pointers or some key facts that are needed that I'm missing; something to get me started so I can get a better attempt at it. If anything is unclear, I'll be happy to restate it in a more satisfactory format if possible. Thanks all. Thanks all. 



#2
May3109, 03:58 PM

Sci Advisor
HW Helper
Thanks
P: 26,167

Hi Matthollyw00d!
You're making this far too complicated … For the second, write a = np, b = nq, bc = nqc … 



#3
May3109, 08:25 PM

P: 92

Would this be sufficient for the first one:
Assume N_{n}N_{m}, then (t)N_{n}=N_{m}, t≥1. For all m,n≥1, there exists q,r such that m=qn + r, 0≤r<n. Next assume m does not divide n, therefore 1≤r<n. Thus N_{m}=N_{qn+r}=10^{r}(s)N_{n}+N_{r} Then, (t)N_{n}=N_{qn+r}=10^{r}(s)N_{n}+N_{r} Thus, N_{r}=N_{n}(ts10^{r})=N_{n}(d), d≥1, which implies r≥n, which contradicts our hypothesis of r<n. Thus N_{n}N_{m} iff nm. 



#4
Jun209, 04:07 PM

P: 891

2 Questions 



#5
Jun209, 10:08 PM

P: 92

But I'm not seeing a proof that is simpler than what I did unfortunately. =/ 



#6
Jun509, 11:06 AM

P: 891

[tex]m = tn + r[/tex] [tex]N_{m} = N_{m}  (10^{(t1)*n + r})*N_{n} \mod N_n[/tex] [tex]N_{m} = N_{mn} \mod N_{n}[/tex] [tex]N_{m} = N_{mn}  (10^{t2}*n + r})*N_{n} \mod N_n[/tex] [tex]0 = N_{m2n} \mod N_{n}[/tex] ... [tex]0 = N_{m  tn} \mod N_n[/tex] [tex]0 = N_{r} \mod N_n[/tex] [tex] r = 0 [/tex] 



#7
Jun509, 03:04 PM

P: 92

That would be why I didn't see it, I've yet to learn Modular Arithmetic.




#8
Jun609, 03:45 PM

P: 891

[tex]m = tn + r[/tex] If [tex]N_{n}N_{m}[/tex] then [tex]N_{n}[/tex] also divides: [tex]N_{m}  (10^{(t1)*n + r})*N_{n} [/tex] which has the same remainder i.e., zero But that is [tex] N_{mn} [/tex] since you just removed the first n [tex]1[/tex]'s. This is simply going through the longhand division process as the divisor multiplied by [tex]10[/tex] to the appropiiate power removes the n most righthand [tex]1[/tex]'s. When doing longhand division in this manner you are not changing the ultimate remainder so we can say that the new term [tex]N_{mn} = N_{m} \mod N_n[/tex] (i.e. they have the same remainder if divided by [tex]N_n[/tex]). Likewise we continue the longhand division process by removing the next n most righthand [tex]1[/tex]'s and so on until we removed t*n [tex]1[/tex]'s. The resulting number comprises r [tex]1[/tex]'s and has the same remainder as the original number. So we say [tex]N_{m} = N_{r} \mod N_n[/tex] iff [tex]m = r \mod n[/tex]. Since nm, r = zero is the only possible r less than n. 


Register to reply 
Related Discussions  
Can u plz help me with this questions ???  General Math  2  
Questions  Advanced Physics Homework  3  
two questions...help please  Introductory Physics Homework  4  
Three questions.  General Physics  3 