Prove that ## 7, 11 ##, and ## 13 ## all divide ## N ##

  • Thread starter Math100
  • Start date
In summary, "dividing" numbers refers to the act of evenly dividing one number into another without any remainder. To prove that a number divides another, we must show that the second number is a multiple of the first number. In this problem, the significance of the prime numbers 7, 11, and 13 is that if a number is divisible by all three, it must also be divisible by their product, 1001. A "divisible number" is one that can be divided evenly without any remainder. Using this information, we can prove that 7, 11, and 13 all divide N by showing that N is a multiple of 1001.
  • #1
Math100
802
221
Homework Statement
Let ## N=a_{m}10^{m}+\dotsb +a_{2}10^{2}+a_{1}10+a_{0} ##, where ## 0\leq a_{k}\leq 9 ##, be the decimal expansion of a positive integer ## N ##.
Prove that ## 7, 11 ##, and ## 13 ## all divide ## N ## if and only if ## 7, 11 ##, and ## 13 ## divide the integer ## M=(100a_{2}+10a_{1}+a_{0})-(100a_{5}+10a_{4}+a_{3})+(100a_{8}+10a_{7}+a_{6})-\dotsb ##.
[Hint: If ## n ## is even, then ## 10^{3n}\equiv 1, 10^{3n+1}\equiv 10, 10^{3n+2}\equiv 100\pmod {1001} ##; if ## n ## is odd, then ## 10^{3n}\equiv -1, 10^{3n+1}\equiv -10, 10^{3n+2}\equiv -100\pmod {1001} ##.]
Relevant Equations
None.
Proof:

Assume that ## 7, 11 ##, and ## 13 ## all divide ## N ##.
Let ## N=a_{m}10^{m}+\dotsb +a_{2}10^{2}+a_{1}10+a_{0} ##, where ## 0\leq a_{k}\leq 9 ##,
be the decimal expansion of a positive integer ## N ##.
Observe that ## 7\cdot 11\cdot 13=1001 ##.
Now we consider two cases.
Case #1: Suppose ## n ## is even.
Then ## 10^{3n}\equiv 1\implies 10^{3n+1}\equiv 10 ##.
Thus ## 10^{3n+2}\equiv 100\pmod {1001} ##.
Case #2: Suppose ## n ## is odd.
Then ## 10^{3n}\equiv -1\implies 10^{3n+1}\equiv -10 ##.
Thus ## 10^{3n+2}\equiv -100\pmod {1001} ##.
Since ## N=a_{m}10^{m}+\dotsb +a_{2}10^{2}+a_{1}10+a_{0}\equiv [(100a_{2}+10a_{1}+a_{0})-(100a_{5}+10a_{4}+a_{3})+(100a_{8}+10a_{7}+a_{6})-\dotsb]\pmod {1001} ##, it follows that ## N\equiv 0\pmod {1001} ##.
Thus ## 7, 11 ##, and ## 13 ## divide the integer ## M=(100a_{2}+10a_{1}+a_{0})-(100a_{5}+10a_{4}+a_{3})+(100a_{8}+10a_{7}+a_{6})-\dotsb ##.
Conversely, suppose ## 7, 11 ##, and ## 13 ## divide the integer ## M=(100a_{2}+10a_{1}+a_{0})-(100a_{5}+10a_{4}+a_{3})+(100a_{8}+10a_{7}+a_{6})-\dotsb ##.
Note that ## 7\cdot 11\cdot 13=1001 ##.
Then ## (100a_{2}+10a_{1}+a_{0})-(100a_{5}+10a_{4}+a_{3})+(100a_{8}+10a_{7}+a_{6})-\dotsb\equiv 0\pmod {1001} ##.
This means ## a_{m}10^{m}+\dotsb +a_{2}10^{2}+a_{1}10+a_{0}\equiv 0\pmod {1001}\implies N\equiv 0\pmod {1001} ##.
Thus ## 7, 11 ##, and ## 13 ## all divide ## N ##.
Therefore, ## 7, 11 ##, and ## 13 ## all divide ## N ## if and only if ## 7, 11 ##, and ## 13 ## divide the integer ## M=(100a_{2}+10a_{1}+a_{0})-(100a_{5}+10a_{4}+a_{3})+(100a_{8}+10a_{7}+a_{6})-\dotsb ##.
 
Physics news on Phys.org
  • #2
What happens at the end of the line? Your proof works well if ##6\,|\,m## so you can group the numbers in packages of three even ##n## and three odd ##n##, but what happens in the five other cases?
 
  • #3
fresh_42 said:
What happens at the end of the line? Your proof works well if ##6\,|\,m## so you can group the numbers in packages of three even ##n## and three odd ##n##, but what happens in the five other cases?
I don't understand. If ## 6\mid m ##, then how can I group them in packages of three even...? How can this be applied?
 
  • #4
## (100a_{2}+10a_{1}+a_{0})-(100a_{5}+10a_{4}+a_{3})+(100a_{8}+10a_{7}+a_{6})-\dotsb\pmod {6} ##
 
  • #5
Math100 said:
I don't understand. If ## 6\mid m ##, then how can I group them in packages of three even...? How can this be applied?
You start with
\begin{align*}
1001\,|\,N&=(100a_{2}+10a_{1}+a_{0})\cdot 10^0+(100a_{5}+10a_{4}+a_{3})\cdot 10^3+(100a_{8}+10a_{7}+a_{6})\cdot 10^6\mp \dotsb\\
&\equiv (100a_{2}+10a_{1}+a_{0})-(100a_{5}+10a_{4}+a_{3})+(100a_{8}+10a_{7}+a_{6})\mp \dotsb =M \pmod {1001}
\end{align*}

Oh, now I see that ##1001\,|\,M.##

The other direction is the same, only that we start with ##1001\,|\,M=\ldots \equiv N\pmod {1001} ##

I mistakenly first thought that you would group the polynomial as packages of three with alternating signs:
$$
N=\underbrace{(100a_{2}+10a_{1}+a_{0})\cdot 10^0}_{n=0}+\underbrace{(100a_{5}+10a_{4}+a_{3})\cdot 10^3}_{n=1}+\underbrace{(100a_{8}+10a_{7}+a_{6})\cdot 10^6}_{n=2}\mp \dotsb
$$
and wondered if we can do this if ##6\nmid m.##
 
  • Like
Likes Math100
  • #6
fresh_42 said:
You start with
\begin{align*}
1001\,|\,N&=(100a_{2}+10a_{1}+a_{0})\cdot 10^0+(100a_{5}+10a_{4}+a_{3})\cdot 10^3+(100a_{8}+10a_{7}+a_{6})\cdot 10^6\mp \dotsb\\
&\equiv (100a_{2}+10a_{1}+a_{0})-(100a_{5}+10a_{4}+a_{3})+(100a_{8}+10a_{7}+a_{6})\mp \dotsb =M \pmod {1001}
\end{align*}

Oh, now I see that ##1001\,|\,M.##

The other direction is the same, only that we start with ##1001\,|\,M=\ldots \equiv N\pmod {1001} ##

I mistakenly first thought that you would group the polynomial as packages of three with alternating signs:
$$
N=\underbrace{(100a_{2}+10a_{1}+a_{0})\cdot 10^0}_{n=0}+\underbrace{(100a_{5}+10a_{4}+a_{3})\cdot 10^3}_{n=1}+\underbrace{(100a_{8}+10a_{7}+a_{6})\cdot 10^6}_{n=2}\mp \dotsb
$$
and wondered if we can do this if ##6\nmid m.##
What does ## \mp ## symbolize?
 
  • #7
Math100 said:
What does ## \mp ## symbolize?
That the signs alternate between ##+## and ##-##. If the next one is a minus sign, then it is ##\mp## and if it is a plus sign, then it is ##\pm##.
 
  • Like
Likes Math100

FAQ: Prove that ## 7, 11 ##, and ## 13 ## all divide ## N ##

How do you prove that 7, 11, and 13 all divide N?

To prove that 7, 11, and 13 all divide N, we need to show that N is divisible by each of these numbers without leaving a remainder. This can be done by finding the factors of N and showing that each of these numbers is a factor.

What is the significance of 7, 11, and 13 being prime numbers in this proof?

The fact that 7, 11, and 13 are all prime numbers is significant because it means they have no other factors besides 1 and themselves. This makes it easier to prove that they are factors of N, as there are fewer possibilities to check.

Can you provide an example of a number N that is divisible by 7, 11, and 13?

Yes, an example of a number N that is divisible by 7, 11, and 13 is 3003. The factors of 3003 are 3, 7, 11, and 13, which shows that it is divisible by all three numbers.

Is there a specific method or formula for proving that 7, 11, and 13 all divide N?

There is no specific formula or method for proving that 7, 11, and 13 all divide N. However, one approach could be to use the prime factorization of N and show that 7, 11, and 13 are all factors.

Why is it important to prove that 7, 11, and 13 all divide N?

Proving that 7, 11, and 13 all divide N can be important in various mathematical and scientific applications. For example, it can be used in number theory to find solutions to certain equations or in cryptography to ensure the security of codes. It can also help in simplifying and solving complex mathematical problems.

Similar threads

Replies
3
Views
2K
Replies
2
Views
1K
Replies
7
Views
2K
Replies
6
Views
2K
Replies
5
Views
1K
Replies
1
Views
1K
Replies
1
Views
893
Back
Top