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

  • Thread starter Math100
  • Start date
  • Tags
    Integer
In summary, the integer ## 1010908899 ## is divisible by ## 7, 11 ##, and ## 13 ## because it is congruent to ## 0 ## modulo ## 1001 ##. This can be shown by observing that ## 7\cdot 11\cdot 13=1001 ##, and using the fact that ## 10^{3}\equiv -1\pmod {1001} ##. Therefore, the integer is divisible by 7, 11, and 13.
  • #1
Math100
791
220
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
  • #2
Do you have a question somewhere? What do you need help with?
 
  • #3
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.
 
  • #4
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.
 
  • #5
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
  • #6
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
  • #7
I was thinking about adding spacing ##1\,010\,908\,899## for "ocular ease" :)
 

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

What is the integer being tested?

The integer being tested is 1010908899.

What is divisibility?

Divisibility is the property of being able to divide one number by another without leaving a remainder.

How do you determine if an integer is divisible by another number?

To determine if an integer is divisible by another number, you can use the division algorithm. Divide the integer by the number you want to test for divisibility. If the remainder is 0, then the integer is divisible by that number.

Is 1010908899 divisible by 2?

No, 1010908899 is not divisible by 2. When divided by 2, the remainder is 1.

Is 1010908899 divisible by 7?

Yes, 1010908899 is divisible by 7. When divided by 7, the remainder is 0.

Back
Top