Proving Divisibility of x, y and z by 5 in Modulo 5 Problem

  • Thread starter doggie_Walkes
  • Start date
In summary, the conversation discusses how to prove that if x, y, z are integers such that 5*x^2 + y^2 = 7*z^2, then x, y, and z must all be divisible by 5. The conversation also discusses how to deduce that the equation has no solutions in integers except for x=y=z=0.
  • #1
doggie_Walkes
20
0
Well the problem is

Prove that if x, y, z are intergers such that 5*x^2 + y^2 = 7*z^2, then x, y and z are all divisble by 5.


So what I have done so far,

I have worked out 1, 2 ,3 , 4, and their squared to find that. the squared intergers of any interger will end in 0,1, 4 in modulo 5. (ps I am not sure if I am phrasing this write as well)

then the LHS would be 0, 1,4. whilst the right hand side will be 0, 2, 3.

now i don't know wher to go. can someone help me, or show me how to prove this.

would be greatly appreicated.

thanks
 
Physics news on Phys.org
  • #2
Hi doggie_Walkes! :wink:
doggie_Walkes said:
… then the LHS would be 0, 1,4. whilst the right hand side will be 0, 2, 3.

Yes! So both sides must be 0, and so … ? :smile:
 
  • #3


thanks tiny tim for replying so quickly.

well I am checked the answer then its says this,

"the only possiblity is that y=z=0(mod5)

but then 5*x^2=7*z^2 - y^2 is divisble by 25, and so x is divisble by 5."



so i get why the obly possiblity is 0mod5 but why is it divisble by 25.

regards
 
  • #4
Hi doggie_Walkes! :smile:

(try using the X2 tag just above the Reply box :wink:)

ah, because if 5|y and 5|z, then 25|y2 and 25|z2 (and so 25|5x2) :wink:
 
  • #5


Ah tiny tim, I get it! thanks that's bothering for some time, can i ask one more thing of you please. How would one go about doing this?

5x2+y2 = 7z2

Deduce that the equation has no solution in intergers except fo x=y=z= 0
 
  • #6
doggie_Walkes said:
Deduce that the equation has no solution in intergers except fo x=y=z= 0

but that follows directly from the first result …

think about it! :smile:
 
  • #7


I still don't get it :(
 
  • #8
5 divides x y and z, so put x = 5a, y = 5b, z = 5c, then 5a2 + b2 = 7c2.

Now 5 divides a b and c, so put a = 5p, b = 5q, c = 5r, and so on … :smile:
 

FAQ: Proving Divisibility of x, y and z by 5 in Modulo 5 Problem

How do you define "divisibility" in the context of modulo 5?

In the context of modulo 5, divisibility refers to the ability of a number to be evenly divided by 5 without leaving a remainder. In other words, the remainder when the number is divided by 5 should be 0.

What is the significance of proving divisibility by 5 in modulo 5?

Proving divisibility by 5 in modulo 5 is important in number theory and modular arithmetic, as it allows us to perform operations with large numbers without having to deal with their actual values. It also helps in solving more complex problems related to prime numbers and patterns in numbers.

How do you prove that a number is divisible by 5 in modulo 5?

To prove that a number is divisible by 5 in modulo 5, we need to show that the remainder when the number is divided by 5 is 0. This can be done by using the properties of modular arithmetic, such as the fact that the sum, difference, and product of two numbers in modulo 5 will also be in modulo 5.

Can you provide an example of proving divisibility by 5 in modulo 5?

Sure, for example, let's take the number 25. In modulo 5, this can be written as 25 ≡ 0 (mod 5), which means that when 25 is divided by 5, the remainder is 0. This shows that 25 is divisible by 5 in modulo 5.

What are some real-world applications of proving divisibility by 5 in modulo 5?

Proving divisibility by 5 in modulo 5 has various applications in computer science, cryptography, and coding theory. It is also used in error-correcting codes, data encryption, and data compression algorithms. Additionally, it can be used in solving problems related to prime numbers, factorization, and patterns in numbers.

Back
Top