Solution for Arithmetics in Z: m2+1\equiv0[5]

  • Context: Graduate 
  • Thread starter Thread starter naoufelabs
  • Start date Start date
Click For Summary

Discussion Overview

The discussion revolves around finding a set of natural numbers that satisfy the equation m² + 1 ≡ 0 [5]. Participants explore various approaches to describe the solutions mathematically, including congruences and modular arithmetic.

Discussion Character

  • Mathematical reasoning
  • Technical explanation
  • Exploratory

Main Points Raised

  • One participant proposes that the solutions can be expressed as m = {2, 3, 7, 8} + k*10, where k is a natural number.
  • Another participant clarifies that this can be simplified to m being congruent to either 2 or 3 modulo 5, noting the equivalence of other values under modulo 5.
  • A suggestion is made to refer to sequence A047221 in OEIS, which relates to numbers congruent to {2, 3} mod 5.
  • A later reply confirms the equivalence of m² ≡ -1 [5] leading to m being congruent to ±2 [5], and thus m can be expressed as {2 + 5n; 3 + 5n} for any integer n ≥ 0.

Areas of Agreement / Disagreement

Participants present multiple approaches and interpretations of the problem, with no consensus reached on a single definitive solution. Different representations of the solutions are discussed, indicating ongoing exploration rather than agreement.

Contextual Notes

The discussion includes various assumptions about modular arithmetic and congruences, which may depend on the definitions used by participants. The mathematical steps leading to the conclusions are not fully resolved.

naoufelabs
Messages
17
Reaction score
0
Hello all,

I have a problem to define a set of natural numbers that meet the following equation:

m2+1[itex]\equiv[/itex]0[5]

I have found that a set of this equation is : {2,3,7,8}+k*10, k[itex]\in[/itex]N
i.e: k= {0,1,2,3,...,n}
example: (2+(0*10)2)+1=5
(3+(1*10)2)+1=132+1=170

Result: m=[2+k*10; 3+k*10; 7+k*10; 8+k*10]

How can I describe this result logically in mathematics ?

Thanks.
 
Physics news on Phys.org
Hello,
I think you more or less did: m is congruent to either 2, 3, 7 or 8 modulo 10.

Notice that this is equivalent to saying that m is congruent to either 2 or 3 modulo 5, since [itex]2 \equiv 7 \pmod 5[/itex] and [itex]3 \equiv 8 \pmod 5[/itex].

You wanted a solution of the equation [itex]m^2 \equiv -1 \equiv 4 \pmod 5[/itex]; you only need to square each of 0,1,2,3,4 modulo 5, and see which are congruent to 4.

Hope this helps!
 
Look at sequence A047221 in OEIS ('Numbers that are congruent to {2, 3} mod 5')
 
Hello,
thank you for your reply.
I have found a solution :
m2+1 [itex]\equiv[/itex] 0[5]
m2 [itex]\equiv[/itex] -1[5]
m2 [itex]\equiv[/itex] 4[5]
m [itex]\equiv[/itex] [itex]\pm[/itex]2[5]
m [itex]\equiv[/itex] 2,3[5]

therefore : m= {2+5n ; 3+5n} for any integer n[itex]\geq[/itex]0
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 15 ·
Replies
15
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K