Determine whether the integer ## 1010908899 ## is divisible by....

  • Thread starter Thread starter Math100
  • Start date Start date
  • Tags Tags
    Integer
AI Thread Summary
The integer 1010908899 is confirmed to be divisible by 7, 11, and 13, as demonstrated through modular arithmetic with respect to 1001. The calculations show that 1010908899 is congruent to 0 modulo 1001, supporting its divisibility. Additional insights suggest that while the modular approach is valid, traditional divisibility rules could also be applied. Suggestions for clarity include formatting the number for easier readability. Overall, the verification of the solution is affirmed, and the method used is appreciated for its elegance.
Math100
Messages
813
Reaction score
229
Homework Statement
Without performing the divisions, determine whether the integer ## 1010908899 ## is divisible by ## 7, 11 ##, and ## 13 ##.
Relevant Equations
None.
Consider the integer ## 1010908899 ##.
Observe that ## 7\cdot 11\cdot 13=1001 ##.
Then ## 10^{3}\equiv -1\pmod {1001} ##.
Thus
\begin{align*}
&1010908899\equiv (1\cdot 10^{9}+10\cdot 10^{6}+908\cdot 10^{3}+899)\pmod {1001}\\
&\equiv (-1+10-908+899)\pmod {1001}\\
&\equiv 0\pmod {1001}.\\
\end{align*}
Therefore, the integer ## 1010908899 ## is divisible by ## 7, 11 ##, and ## 13 ##.
 
Physics news on Phys.org
Do you have a question somewhere? What do you need help with?
 
malawi_glenn said:
Do you have a question somewhere? What do you need help with?
The question is written in the homework statement. I just wanted someone to verify/confirm that my work is correct/accurate.
 
Math100 said:
The question is written in the homework statement.
Yeah I could see that, but what is your question to us?
Math100 said:
I just wanted someone to verify/confirm that my work is correct/accurate.
Ok.

Looks good to me.
You can include:
##10^9 \equiv_{1001} (10^3)^3 \equiv_{1001}(-1)^3 \equiv_{1001} -1##
##10^6 \equiv_{1001} (10^3)^2 \equiv_{1001}(-1)^2 \equiv_{1001} 1##
for the sake of completness.
 
Math100 said:
Homework Statement:: Without performing the divisions, determine whether the integer ## 1010908899 ## is divisible by ## 7, 11 ##, and ## 13 ##.
Relevant Equations:: None.

Consider the integer ## 1010908899 ##.
Observe that ## 7\cdot 11\cdot 13=1001 ##.
Then ## 10^{3}\equiv -1\pmod {1001} ##.
Thus
\begin{align*}
&1010908899\equiv (1\cdot 10^{9}+10\cdot 10^{6}+908\cdot 10^{3}+899)\pmod {1001}\\
&\equiv (-1+10-908+899)\pmod {1001}\\
&\equiv 0\pmod {1001}.\\
\end{align*}
Therefore, the integer ## 1010908899 ## is divisible by ## 7, 11 ##, and ## 13 ##.
This is correct, although I'm not sure whether you are supposed to solve it like that or apply the rules for divisibility by ##7,11,13.## IIRC then there are rules. But your solution is nicer.
 
  • Like
Likes Math100
Maybe if you add ##1,001## to your original, it may become more clear
## 1,010, 908,899 +1,001=1,010,909,900-1,001,000,000=9,909,900##
 
  • Like
Likes malawi_glenn
I was thinking about adding spacing ##1\,010\,908\,899## for "ocular ease" :)
 
Back
Top