Ask
your own question, for FREE!
Mathematics
11 Online
OpenStudy (anonymous):
Find \(x\).\[\left(2\cdot 7\right)^n+\left(3\cdot 5\right)^n-5 \equiv 0 \pmod{x},\quad n\in\mathbb{Z}\]
Join the QuestionCove community and study together with friends!
Sign Up
OpenStudy (anonymous):
@KingGeorge
OpenStudy (anonymous):
@ishaan ayye konsa grade ka problem ha?
OpenStudy (anonymous):
hmm depends. what grade are you in?
OpenStudy (anonymous):
i 'm in 12th
OpenStudy (anonymous):
but i don't have any i idea how to solve this problem....can we solve with mathmetical induction
Join the QuestionCove community and study together with friends!
Sign Up
OpenStudy (anonymous):
you can try it then.
OpenStudy (anonymous):
hmm idk, i don't know how you could possibly solve it with mathematical induction.
hartnn (hartnn):
is the power in LHS 'n' ? because then LHS modx will give u LHS for any and every value of x(and quotient=0)...as LHS does not depend on x....
OpenStudy (anonymous):
yes, the exponential power is \(n\) and \(n\in \mathbb{Z}\).
OpenStudy (experimentx):
what is x? integer or real number?
Join the QuestionCove community and study together with friends!
Sign Up
OpenStudy (anonymous):
Integer.
OpenStudy (anonymous):
i think its\[2\times7^n+3\times 5^n-5 \]
OpenStudy (anonymous):
hmm maybe. i can't be sure of the question, i got it yesterday on my test. does it solves the problem? @mukushla
OpenStudy (anonymous):
yeah it solves the problem and answer will be \(x|24\)...
OpenStudy (anonymous):
thanks. i got the same as well. i must have read the question wrong.
Join the QuestionCove community and study together with friends!
Sign Up
OpenStudy (anonymous):
very well...:)
Can't find your answer?
Make a FREE account and ask your own questions, OR help others and earn volunteer hours!
Join our real-time social learning platform and learn together with your friends!