2:15 AM
D1, D2, D3, D4
D5, D6, D7, D8

2:37 AM
@Peter The first part (“the iterations can converge or not”) is surely correct. The second part (“the Newtons iterations converges quickly in general”) is an oversimplification IMO.

3 hours later…
5:36 AM

3 hours later…
8:37 AM
close: the question author has no idea what is going on and needs some time to find a good question. Please help them by closing it until such improvements are made.

8:49 AM
@JoséCarlosSantos That trash is up for garbage collection now! Thanks everyone!

9:22 AM
@user21820 It's gone!

@JoséCarlosSantos Great! Thanks!

9:57 AM
0

I don't know if the following holds, but: Is it true that if $b$ is a power of $a$ mod p for all primes($b,a$ are positive integers), that is to say that the congruence $b\equiv a^{x} \pmod p$ has a solution for all primes, then there is some integer $n$ such that $b=a^{n}$? Thanks in advance

2 hours later…
11:58 AM

12:11 PM

12:58 PM

[ SmokeDetector | MS ] Link at beginning of answer (34): What do uniformly continuous functions look like?‭ by Tripasect‭ on math.SE

1:24 PM
This is a clear duplicate math.stackexchange.com/q/4363884/42969. Alternatively one can close for other reasons since the confusion is apparently based on a simple miscalculation.

1 hour later…
3:25 PM

4:20 PM
2 messages moved to ­Trash

5 hours later…
9:41 PM
This completely useless post has been undeleted. Please help to downvote and delete, as it has crazily gotten 35 upvotes just by being old. @ArcticChar @RRL @KReiser @MartinR (I and some others cannot vote again.)

10:13 PM
D1, D2, D3.
D4, D5, D6.
D7, D8, D9.
C1, C2, C3.
C4, C5, C6.
C7, C8, C9.