Say if there is an element in $Bbb Z_{900}$ with 30 as additive and multiplicative order The...

Is it possible to search for a directory/file combination?

Is there a way to save my career from absolute disaster?

Has this building technique been used in an official set?

How to invert MapIndexed on a ragged structure? How to construct a tree from rules?

Limits on contract work without pre-agreed price/contract (UK)

What is the result of assigning to std::vector<T>::begin()?

How do I avoid eval and parse?

What flight has the highest ratio of time difference to flight time?

Indicator light circuit

Why do professional authors make "consistency" mistakes? And how to avoid them?

Are there any limitations on attacking while grappling?

Should I tutor a student who I know has cheated on their homework?

Would a completely good Muggle be able to use a wand?

What does convergence in distribution "in the Gromov–Hausdorff" sense mean?

Inappropriate reference requests from Journal reviewers

What can we do to stop prior company from asking us questions?

Help understanding this unsettling image of Titan, Epimetheus, and Saturn's rings?

Does it take more energy to get to Venus or to Mars?

What was the first Unix version to run on a microcomputer?

Preparing Indesign booklet with .psd graphics for print

Can we say or write : "No, it'sn't"?

What connection does MS Office have to Netscape Navigator?

How do scammers retract money, while you can’t?

Is there an analogue of projective spaces for proper schemes?



Say if there is an element in $Bbb Z_{900}$ with 30 as additive and multiplicative order



The Next CEO of Stack OverflowProve that there are $736$ $2 times 2$ matrices ($A$) where $A=A^{-1}$Proof that $mathbb Z[sqrt{3}]$ is a Euclidean DomainIf there is an $ainmathbb{Z}$ with $a^{n-1}equiv 1mod n$ but $a^{frac{n-1}p}notequiv 1$ for all primes $pmid n-1$, then $n$ is a primeSuppose that $R$ is a commutative ring with no zero divisors. Show that all non zero elements of $R$ have the same additive order.Does a system om congruence equations have solutions?Proof solutions linear congruenceSolving a linear system in $mathbb{Z}_{12}$?It is possible to show/prove that the cancellation property is necessary to prove $0x=0$ for $xnotin mathbb{Z}^+ cup {0}$?Assume $p$ is prime, $axequiv 0 (mod p)$ and $pnmid a$, then the additive order of $a$ is $p$ $(mod p$.Solve a system of congruences using the Chinese Remainder Theorem












1












$begingroup$


I have a ring $Bbb Z_{900}$ and I need to check if there is an element which has multiplicative and additive order 30.
I think that is sufficient to check if the following system has at least one solution:



$$begin{cases}
begin{aligned}
30x&equiv0 (text{mod} 900) \
x^{30}&equiv1 (text{mod} 900)
end{aligned}
end{cases}$$



If my attempt is correct, how can I solve the system? The first congruence is easy to solve. How can I solve the second? Is there a method to reduce the power?










share|cite|improve this question











$endgroup$












  • $begingroup$
    Hi Jack. What numbers can satisfy the first equation in your system? --- Consider that first, then see if there is any way any of them can satisfy the second. It might be useful to use that 900=30*30
    $endgroup$
    – kholli
    Mar 16 at 18:12












  • $begingroup$
    the first equation is true for $x=900t, t in Z$
    $endgroup$
    – Jack
    Mar 16 at 18:15










  • $begingroup$
    Is it true for 30? Is $30 = 900t$ for some $tin mathbb{Z}$? You might want to put some more thought into the numbers that satisfy equation 1.
    $endgroup$
    – kholli
    Mar 16 at 18:16












  • $begingroup$
    could you be more detailed? I don't think I understand what you mean.
    $endgroup$
    – Jack
    Mar 16 at 18:20






  • 1




    $begingroup$
    Any element satisfying the second equality will be invertible. But then it will have order what additively?
    $endgroup$
    – Tobias Kildetoft
    Mar 16 at 18:24
















1












$begingroup$


I have a ring $Bbb Z_{900}$ and I need to check if there is an element which has multiplicative and additive order 30.
I think that is sufficient to check if the following system has at least one solution:



$$begin{cases}
begin{aligned}
30x&equiv0 (text{mod} 900) \
x^{30}&equiv1 (text{mod} 900)
end{aligned}
end{cases}$$



If my attempt is correct, how can I solve the system? The first congruence is easy to solve. How can I solve the second? Is there a method to reduce the power?










share|cite|improve this question











$endgroup$












  • $begingroup$
    Hi Jack. What numbers can satisfy the first equation in your system? --- Consider that first, then see if there is any way any of them can satisfy the second. It might be useful to use that 900=30*30
    $endgroup$
    – kholli
    Mar 16 at 18:12












  • $begingroup$
    the first equation is true for $x=900t, t in Z$
    $endgroup$
    – Jack
    Mar 16 at 18:15










  • $begingroup$
    Is it true for 30? Is $30 = 900t$ for some $tin mathbb{Z}$? You might want to put some more thought into the numbers that satisfy equation 1.
    $endgroup$
    – kholli
    Mar 16 at 18:16












  • $begingroup$
    could you be more detailed? I don't think I understand what you mean.
    $endgroup$
    – Jack
    Mar 16 at 18:20






  • 1




    $begingroup$
    Any element satisfying the second equality will be invertible. But then it will have order what additively?
    $endgroup$
    – Tobias Kildetoft
    Mar 16 at 18:24














1












1








1





$begingroup$


I have a ring $Bbb Z_{900}$ and I need to check if there is an element which has multiplicative and additive order 30.
I think that is sufficient to check if the following system has at least one solution:



$$begin{cases}
begin{aligned}
30x&equiv0 (text{mod} 900) \
x^{30}&equiv1 (text{mod} 900)
end{aligned}
end{cases}$$



If my attempt is correct, how can I solve the system? The first congruence is easy to solve. How can I solve the second? Is there a method to reduce the power?










share|cite|improve this question











$endgroup$




I have a ring $Bbb Z_{900}$ and I need to check if there is an element which has multiplicative and additive order 30.
I think that is sufficient to check if the following system has at least one solution:



$$begin{cases}
begin{aligned}
30x&equiv0 (text{mod} 900) \
x^{30}&equiv1 (text{mod} 900)
end{aligned}
end{cases}$$



If my attempt is correct, how can I solve the system? The first congruence is easy to solve. How can I solve the second? Is there a method to reduce the power?







abstract-algebra discrete-mathematics ring-theory






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Mar 16 at 18:18









MarianD

1,7791617




1,7791617










asked Mar 16 at 18:06









JackJack

877




877












  • $begingroup$
    Hi Jack. What numbers can satisfy the first equation in your system? --- Consider that first, then see if there is any way any of them can satisfy the second. It might be useful to use that 900=30*30
    $endgroup$
    – kholli
    Mar 16 at 18:12












  • $begingroup$
    the first equation is true for $x=900t, t in Z$
    $endgroup$
    – Jack
    Mar 16 at 18:15










  • $begingroup$
    Is it true for 30? Is $30 = 900t$ for some $tin mathbb{Z}$? You might want to put some more thought into the numbers that satisfy equation 1.
    $endgroup$
    – kholli
    Mar 16 at 18:16












  • $begingroup$
    could you be more detailed? I don't think I understand what you mean.
    $endgroup$
    – Jack
    Mar 16 at 18:20






  • 1




    $begingroup$
    Any element satisfying the second equality will be invertible. But then it will have order what additively?
    $endgroup$
    – Tobias Kildetoft
    Mar 16 at 18:24


















  • $begingroup$
    Hi Jack. What numbers can satisfy the first equation in your system? --- Consider that first, then see if there is any way any of them can satisfy the second. It might be useful to use that 900=30*30
    $endgroup$
    – kholli
    Mar 16 at 18:12












  • $begingroup$
    the first equation is true for $x=900t, t in Z$
    $endgroup$
    – Jack
    Mar 16 at 18:15










  • $begingroup$
    Is it true for 30? Is $30 = 900t$ for some $tin mathbb{Z}$? You might want to put some more thought into the numbers that satisfy equation 1.
    $endgroup$
    – kholli
    Mar 16 at 18:16












  • $begingroup$
    could you be more detailed? I don't think I understand what you mean.
    $endgroup$
    – Jack
    Mar 16 at 18:20






  • 1




    $begingroup$
    Any element satisfying the second equality will be invertible. But then it will have order what additively?
    $endgroup$
    – Tobias Kildetoft
    Mar 16 at 18:24
















$begingroup$
Hi Jack. What numbers can satisfy the first equation in your system? --- Consider that first, then see if there is any way any of them can satisfy the second. It might be useful to use that 900=30*30
$endgroup$
– kholli
Mar 16 at 18:12






$begingroup$
Hi Jack. What numbers can satisfy the first equation in your system? --- Consider that first, then see if there is any way any of them can satisfy the second. It might be useful to use that 900=30*30
$endgroup$
– kholli
Mar 16 at 18:12














$begingroup$
the first equation is true for $x=900t, t in Z$
$endgroup$
– Jack
Mar 16 at 18:15




$begingroup$
the first equation is true for $x=900t, t in Z$
$endgroup$
– Jack
Mar 16 at 18:15












$begingroup$
Is it true for 30? Is $30 = 900t$ for some $tin mathbb{Z}$? You might want to put some more thought into the numbers that satisfy equation 1.
$endgroup$
– kholli
Mar 16 at 18:16






$begingroup$
Is it true for 30? Is $30 = 900t$ for some $tin mathbb{Z}$? You might want to put some more thought into the numbers that satisfy equation 1.
$endgroup$
– kholli
Mar 16 at 18:16














$begingroup$
could you be more detailed? I don't think I understand what you mean.
$endgroup$
– Jack
Mar 16 at 18:20




$begingroup$
could you be more detailed? I don't think I understand what you mean.
$endgroup$
– Jack
Mar 16 at 18:20




1




1




$begingroup$
Any element satisfying the second equality will be invertible. But then it will have order what additively?
$endgroup$
– Tobias Kildetoft
Mar 16 at 18:24




$begingroup$
Any element satisfying the second equality will be invertible. But then it will have order what additively?
$endgroup$
– Tobias Kildetoft
Mar 16 at 18:24










1 Answer
1






active

oldest

votes


















2












$begingroup$

$30x equiv 0 , , (text{mod } 900) Rightarrow 30x = 900z ni z in mathbb{N} Rightarrow x = 30z$. Now then $(30z)^3 = 30^3z^3 = 0 , , (text{mod } 900)$. So there isn't any solution to that system.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    Thank you for your answer, could you please be more detailed in the steps? For example, how do I get this step $30x equiv 0 , , (text{mod } 900) Rightarrow 30x = 900z ni z in mathbb{N}$?
    $endgroup$
    – Jack
    Mar 17 at 9:27










  • $begingroup$
    $900/30x$ for $30x = 0$ mod 900. $z in mathbb{Z}$ but since we are talking about elements in $Z_{900}$, we can only consider positive integers and including 0.
    $endgroup$
    – Nawaj
    Mar 17 at 20:22










  • $begingroup$
    Forgive me, but I still don't understand.I don't understand how you can write $30𝑥=900𝑧$ without first "removing" 30... I've never seen this way of resolving a linear congruence
    $endgroup$
    – Jack
    Mar 19 at 16:10












Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3150638%2fsay-if-there-is-an-element-in-bbb-z-900-with-30-as-additive-and-multiplicat%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









2












$begingroup$

$30x equiv 0 , , (text{mod } 900) Rightarrow 30x = 900z ni z in mathbb{N} Rightarrow x = 30z$. Now then $(30z)^3 = 30^3z^3 = 0 , , (text{mod } 900)$. So there isn't any solution to that system.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    Thank you for your answer, could you please be more detailed in the steps? For example, how do I get this step $30x equiv 0 , , (text{mod } 900) Rightarrow 30x = 900z ni z in mathbb{N}$?
    $endgroup$
    – Jack
    Mar 17 at 9:27










  • $begingroup$
    $900/30x$ for $30x = 0$ mod 900. $z in mathbb{Z}$ but since we are talking about elements in $Z_{900}$, we can only consider positive integers and including 0.
    $endgroup$
    – Nawaj
    Mar 17 at 20:22










  • $begingroup$
    Forgive me, but I still don't understand.I don't understand how you can write $30𝑥=900𝑧$ without first "removing" 30... I've never seen this way of resolving a linear congruence
    $endgroup$
    – Jack
    Mar 19 at 16:10
















2












$begingroup$

$30x equiv 0 , , (text{mod } 900) Rightarrow 30x = 900z ni z in mathbb{N} Rightarrow x = 30z$. Now then $(30z)^3 = 30^3z^3 = 0 , , (text{mod } 900)$. So there isn't any solution to that system.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    Thank you for your answer, could you please be more detailed in the steps? For example, how do I get this step $30x equiv 0 , , (text{mod } 900) Rightarrow 30x = 900z ni z in mathbb{N}$?
    $endgroup$
    – Jack
    Mar 17 at 9:27










  • $begingroup$
    $900/30x$ for $30x = 0$ mod 900. $z in mathbb{Z}$ but since we are talking about elements in $Z_{900}$, we can only consider positive integers and including 0.
    $endgroup$
    – Nawaj
    Mar 17 at 20:22










  • $begingroup$
    Forgive me, but I still don't understand.I don't understand how you can write $30𝑥=900𝑧$ without first "removing" 30... I've never seen this way of resolving a linear congruence
    $endgroup$
    – Jack
    Mar 19 at 16:10














2












2








2





$begingroup$

$30x equiv 0 , , (text{mod } 900) Rightarrow 30x = 900z ni z in mathbb{N} Rightarrow x = 30z$. Now then $(30z)^3 = 30^3z^3 = 0 , , (text{mod } 900)$. So there isn't any solution to that system.






share|cite|improve this answer









$endgroup$



$30x equiv 0 , , (text{mod } 900) Rightarrow 30x = 900z ni z in mathbb{N} Rightarrow x = 30z$. Now then $(30z)^3 = 30^3z^3 = 0 , , (text{mod } 900)$. So there isn't any solution to that system.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Mar 16 at 20:12









NawajNawaj

534




534












  • $begingroup$
    Thank you for your answer, could you please be more detailed in the steps? For example, how do I get this step $30x equiv 0 , , (text{mod } 900) Rightarrow 30x = 900z ni z in mathbb{N}$?
    $endgroup$
    – Jack
    Mar 17 at 9:27










  • $begingroup$
    $900/30x$ for $30x = 0$ mod 900. $z in mathbb{Z}$ but since we are talking about elements in $Z_{900}$, we can only consider positive integers and including 0.
    $endgroup$
    – Nawaj
    Mar 17 at 20:22










  • $begingroup$
    Forgive me, but I still don't understand.I don't understand how you can write $30𝑥=900𝑧$ without first "removing" 30... I've never seen this way of resolving a linear congruence
    $endgroup$
    – Jack
    Mar 19 at 16:10


















  • $begingroup$
    Thank you for your answer, could you please be more detailed in the steps? For example, how do I get this step $30x equiv 0 , , (text{mod } 900) Rightarrow 30x = 900z ni z in mathbb{N}$?
    $endgroup$
    – Jack
    Mar 17 at 9:27










  • $begingroup$
    $900/30x$ for $30x = 0$ mod 900. $z in mathbb{Z}$ but since we are talking about elements in $Z_{900}$, we can only consider positive integers and including 0.
    $endgroup$
    – Nawaj
    Mar 17 at 20:22










  • $begingroup$
    Forgive me, but I still don't understand.I don't understand how you can write $30𝑥=900𝑧$ without first "removing" 30... I've never seen this way of resolving a linear congruence
    $endgroup$
    – Jack
    Mar 19 at 16:10
















$begingroup$
Thank you for your answer, could you please be more detailed in the steps? For example, how do I get this step $30x equiv 0 , , (text{mod } 900) Rightarrow 30x = 900z ni z in mathbb{N}$?
$endgroup$
– Jack
Mar 17 at 9:27




$begingroup$
Thank you for your answer, could you please be more detailed in the steps? For example, how do I get this step $30x equiv 0 , , (text{mod } 900) Rightarrow 30x = 900z ni z in mathbb{N}$?
$endgroup$
– Jack
Mar 17 at 9:27












$begingroup$
$900/30x$ for $30x = 0$ mod 900. $z in mathbb{Z}$ but since we are talking about elements in $Z_{900}$, we can only consider positive integers and including 0.
$endgroup$
– Nawaj
Mar 17 at 20:22




$begingroup$
$900/30x$ for $30x = 0$ mod 900. $z in mathbb{Z}$ but since we are talking about elements in $Z_{900}$, we can only consider positive integers and including 0.
$endgroup$
– Nawaj
Mar 17 at 20:22












$begingroup$
Forgive me, but I still don't understand.I don't understand how you can write $30𝑥=900𝑧$ without first "removing" 30... I've never seen this way of resolving a linear congruence
$endgroup$
– Jack
Mar 19 at 16:10




$begingroup$
Forgive me, but I still don't understand.I don't understand how you can write $30𝑥=900𝑧$ without first "removing" 30... I've never seen this way of resolving a linear congruence
$endgroup$
– Jack
Mar 19 at 16:10


















draft saved

draft discarded




















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3150638%2fsay-if-there-is-an-element-in-bbb-z-900-with-30-as-additive-and-multiplicat%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Nidaros erkebispedøme

Birsay

Was Woodrow Wilson really a Liberal?Was World War I a war of liberals against authoritarians?Founding Fathers...