Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with equation-solving
Search options not deleted
user 4768
Questions on the analytic and numerical equation solving functions of Mathematica (Solve, Reduce, NSolve, FindRoot, DSolve, RSolve, etc.).
12
votes
8
answers
2k
views
Find the minimum integer r such that $(10^r - 1)/37$ is an integer
I know Element[(10^r - 1)/37, Integers] tests the condition.
So what is the command that gives me the minimum integer value r such that the condition is true?
- 307
1
vote
0
answers
82
views
Input `Reduce[Mod[a + x, l] == 0, x]' and output `x == -a + kl`?
Reduce[a + x == k l && k > 0, x]
(* k > 0 && x == -a + k l *)
I think a + x == k l and Mod[a + x, l] == 0 are equivalent, but when I replace a + x == k l by Mod, Mathematica can't produce the previo …
- 307