How Does the Variable x Relate to n in This Divisibility Problem?

  • Thread starter Thread starter sparsh12
  • Start date Start date
sparsh12
Messages
12
Reaction score
0
if,

10x+1 divides n-x

and 10x +1 divides 10n +1 , where x is a variable and positive integer while n is a constant and positive integer.

then, is there a way to find, of what form x must be, in terms of 'n' ?
 
Physics news on Phys.org
sparsh12 said:
if,

10x+1 divides n-x

and 10x +1 divides 10n +1 , where x is a variable and positive integer while n is a constant and positive integer.

then, is there a way to find, of what form x must be, in terms of 'n' ?

Hey sparsh12 and welcome to the forums.

Have you dealt with linear systems of congruence equations? Do you know how to solve linear congruence equations? Have you heard of the chinese remainder theorem?
 
--> Yeah i have heard of Chinese remainder theorem but i have never dealt with linear systems of congruence equations.

--> And i observed that both congruences are actually equivalent, so i feel the problem doesnot remain a system of congruence equation, as i infer from it's name.

--> But the problem remains unsolved for me.

--> Apart from all that i have a book of elementary number theory by David Burton.i would try to go through it.
 
Thread 'Determine whether ##125## is a unit in ##\mathbb{Z_471}##'
This is the question, I understand the concept, in ##\mathbb{Z_n}## an element is a is a unit if and only if gcd( a,n) =1. My understanding of backwards substitution, ... i have using Euclidean algorithm, ##471 = 3⋅121 + 108## ##121 = 1⋅108 + 13## ##108 =8⋅13+4## ##13=3⋅4+1## ##4=4⋅1+0## using back-substitution, ##1=13-3⋅4## ##=(121-1⋅108)-3(108-8⋅13)## ... ##= 121-(471-3⋅121)-3⋅471+9⋅121+24⋅121-24(471-3⋅121## ##=121-471+3⋅121-3⋅471+9⋅121+24⋅121-24⋅471+72⋅121##...
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
Back
Top