Any one of the integers ## 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 ## can occur?

  • Thread starter Thread starter Math100
  • Start date Start date
  • Tags Tags
    Integers
AI Thread Summary
Any integer can be expressed in terms of its units digit modulo 10, specifically as 0 through 9. The cubes of these integers yield specific units digits: 0, 1, 8, 7, 4, 5, 6, 3, 2, or 9. This demonstrates that any integer from 0 to 9 can indeed be the units digit of a cubed integer. The proof confirms that all integers in this range can occur as the units digit of a^3. Thus, the statement is validated.
Math100
Messages
816
Reaction score
229
Homework Statement
Prove the following statement:
Any one of the integers ## 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 ## can occur as the units digit of ## a^{3} ##.
Relevant Equations
None.
Proof:

Let ## a ## be any integer.
Then ## a\equiv 0, 1, 2, 3, 4, 5, 6, 7, 8 ##, or ## 9\pmod {10} ##.
Thus ## a^{3}\equiv 0, 1, 8, 27, 64, 125, 216, 343, 512 ##, or ## 729\pmod {10} ##.
Therefore, anyone of the integers ## 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 ## can occur as the units digit of ## a^{3} ##.
 
  • Like
Likes Delta2 and fresh_42
Physics news on Phys.org
That's true.
 
I think you should still prove the following:

Given two positive integers ##a,n.##

##A.## ##\operatorname{gcd}(a,n)=1##
##B.## There are integers ##s,t## such that ##1=s\cdot a+t\cdot n.##
##C.## There is an integer ##b\in \mathbb{Z}## such that ##a \cdot b \equiv 1 \pmod n.##

Prove that all three statements are equivalent.

Hint: It is sufficient to show ##A \Longrightarrow B \Longrightarrow C \Longrightarrow A## or ##A \Longrightarrow C \Longrightarrow B \Longrightarrow A##
 
Math100 said:
Homework Statement:: Prove the following statement:
Any one of the integers ## 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 ## can occur as the units digit of ## a^{3} ##.
Relevant Equations:: None.

Proof:

Let ## a ## be any integer.
Then ## a\equiv 0, 1, 2, 3, 4, 5, 6, 7, 8 ##, or ## 9\pmod {10} ##.
Thus ## a^{3}\equiv 0, 1, 8, 27, 64, 125, 216, 343, 512 ##, or ## 729\pmod {10} ##.
Except for 0, 1, and 8, the rest are not numbers modulo 10.

I would write the above as:
Let a be the units digit of some integer. Then a is 0, 1 2, 3, 4, 5, 6, 7, 8, or 9.
##a^3## is one of 0, 1, 8, 27, 64, 125, 216, 343, 512, or 729, respectively.
Then the units digit of ##a^3## is 0, 1, 8, 7, 4, 5, 6, 3, 2, or 9, and the statement is proven.

Math100 said:
Therefore, anyone of the integers ## 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 ## can occur as the units digit of ## a^{3} ##.
 
Since ##px^9+q## is the factor, then ##x^9=\frac{-q}{p}## will be one of the roots. Let ##f(x)=27x^{18}+bx^9+70##, then: $$27\left(\frac{-q}{p}\right)^2+b\left(\frac{-q}{p}\right)+70=0$$ $$b=27 \frac{q}{p}+70 \frac{p}{q}$$ $$b=\frac{27q^2+70p^2}{pq}$$ From this expression, it looks like there is no greatest value of ##b## because increasing the value of ##p## and ##q## will also increase the value of ##b##. How to find the greatest value of ##b##? Thanks
Back
Top