# Sandbox for drafts of long, complex posts

This sandbox is intended for saving drafts of long, complex posts, especially posts whose composition takes a long time. It serves to localize to one thread the front-page "bumps" caused by edits to drafts of such posts, so that they may be easily ignored. Also, it helps to guard against losing longly-composed posts due to system crashes.

When you are happy with your draft here, you may simply copy the code and paste it to the desired location.

## Proper Use of the Sandbox

1. Do not post a new answer! We wish all the answers on this page to be owned by the Community user (so that only a non-sentient bot is informed of edits to these answers). Posting a new answer will make you the owner, meaning that you will be notified whenever another user makes an edit to that answer.

The sandbox has been "wiki locked" to prevent the creation of new answers. There are more than enough existing answers for users to edit over, and this will greatly reduce the frequency at which we request that the answers be disassociated from specific users.

2. Do not delete answers! Deleting seems like a reasonable option, but there are no "hard deletions" on Stack Exchange, and users with sufficient privileges will still see your supposedly deleted postings. Deleted answers will be undeleted and cleared for the use of others.

3. Do look for an answer which indicates that it is free and then edit it to your heart's content. If none appears available, take over the one that has been left unchanged the longest (which will appear at the bottom of the page if you order answers by "activity").

4. Do not expect your draft to remain untouched for days. There are no guarantees that your draft will be the latest revision if you return days later. While users will try not to step over others' toes, it may happen that an unfinished draft is edited out. Your draft will, however, still exist as a revision of the answer it was made in. If your drafting is expected to take place over a longer period of time, either

• take note of the URL of the answer provided by clicking the share button, or
• save a copy of your draft locally (or even "in the cloud").
5. Do clear your draft when you are finished. This includes removing all $\LaTeX$ from your answers. Replacing all code with a simple statement like

This answer is free for anyone to use

is sufficient. Periodically users may go through and free up answer slots that have not been edited in, say, over one month. But you can aid in the smooth running of this sandbox by clearing away your drafts when you are finished with them.

6. Do not "claim" multiple answers concurrently. Since this post is closed, the answers are a limited resource. If you really must compose several long, complex posts at the same time, you can still use a single answer, separating the different drafts using Markup: horizontal rules (---) and/or headings (# Header 1 #) are natural choices.

7. Do not create new such sandboxes. The point of having a unique such sandbox is that it minimizes the noise on the front page when the sandbox is edited. If there were multiple sandboxes they will frequently occupy numerous front page slots, pushing other topics off the front page, and increasing noise.

• I have added a [sandbox] tag to allow people ignore it more easily (via software support of ignoring tags), and since it seems that we have two sandboxes now, a tag may seem a bit more in place here. – Asaf Karagila Jul 18 '12 at 8:35
• (+1) For thinking outside the (sand)box. – cardinal Jul 18 '12 at 19:40
• At the suggestion of the moderators, I have gone and changed the associated owners of all the answers here to the Community user. This way, the original owners will not receive excess pings for each time another user uses the draft space for their work. Enjoy! – Grace Note Oct 5 '12 at 14:45
• To prevent crashes I've found the "Bookmarks to disable/enable MathJax", provided in here, pretty useful. – leo Dec 17 '12 at 18:03
• PSA: Between the creation of this sandbox (in July 2012) and today (December 2015), technology has advanced. Something like StackEdit (or others, it's simply the only one I know) essentially solves all the limitations of this sandbox. You can have multiple concurrent drafts, you don't have to worry about polluting meta's front page, you can leave your draft untouched for days and expect it to still be there, you don't have to explicitly clear up your draft when you're done... Maybe someday we can get rid of this outdated crutch. – Najib Idrissi Dec 2 '15 at 14:07

$$\def\AA{\mathbb{A}}$$ $$\newcommand\BB{\mathbb{B}}$$

$$\AA$$ and $$\BB$$ both work.

Comment My initial thoughts go in the following direction, but by second read I see that this concerns likely only a subset of impossible solutions. But perhaps the ansatz itself helps as initial idea...

Error detected - needs update

(taken from my two earlier comments)
By subtracting $$8$$ on each side one gets $$7⋅(7^X−1)=3⋅(3^Y−1)+5⋅(5^Z−1)$$ and $$(X,Y,Z)=(x−1,y−1,z−1)$$. Then divide all by $$7⋅3⋅5$$.

For instance we get on the lhs $$(7^X−1)/15$$ and on the rhs equivalent terms.

This gives restrictions for the modular classes for the exponents, and possibly one can proceed with further modular considerations (for instance on primefactorizations in lhs and rhs).

For instance the lhs has then always $$2^5⋅5$$ as factor, the terms in the rhs always $$2^4$$ and $$2^3$$ as factor. Since the constant occurence of $$2^5$$ as minimum means a strong selection for the $$5^Z−1$$-term: only $$Z=24j$$ is possible and by this the selected have all the primefactors $$3⋅13⋅31⋅31$$. This can similarly be checked for the other terms and often it is possible to derive from this contradictions.

By the corresponding primefactors of 2 and 13 in the lhs and rhs I find that in the lhs we can only have valid solutions in steps of 12 in the exponent. The primefactor decomposition of the first two exponents give

(7^12k-1)/15:
X,    value,                primefactors
--------------------------------------------------------------
[12, 922752480,            "2^5.3.13 .5.19.43.181 "]
[24, 12772082092037760960, "2^6.3.13 .5.19.43.181  xxx.73.193.409.1201"]


This means, with all following admissible exponents we shall have the set of primefactors of the first row.

Similarly we look at the $$5^z$$ term, in already required $$24$$ steps:

(5^24j-1)/21:
Z    value                primefactors
--------------------------------------------------------------
[24, 2838316417875744,     "2^5.3.13   .31.313.601.390001"]
[48, 16917684184764290..., "2^6.3.13   .31.313.601.390001.17.11489.152587500001"]


Again, in all following admissible exponents we shall have the set of primefactors in the first row. But interesting: $$7^{12k}-1$$ as well as $$5^{24j}-1$$ have the primefactor $$3$$ - but of course this cannot happen in the third term:

(3^24i-1)/35:
Y    value                primefactors
--------------------------------------------------------------
[24, 8069415328,           "2^5  .13      .41.73.6481"]
[48, 227904123076...     , "2^6  .13      .41.73.6481   .17.97.193.577.769"]


So, if I've not made a silly mistake, this is a proof of nonexistence of solutions aside $$(X,Y,Z)=(0,0,0)$$ resp $$(x,y,z)=(1,1,1)$$. This answer space is free to use :)

This box is free for everyone to use

This space is now free for anyone to use

I have a simple inversion routine for lower triangular matrices (assumed to be invertible, no errorchecks) in Pari/GP

I get, dependent on counting, for multiplications either 1/6*x^3 + 1/2*x^2 + 1/3*x (where x means dimension $$n$$) or 1/6*x^3 - 1/3*x ; see below.

 \\ invert a lower triangular matrix; no errorchecks!
{triinv(m)=local(tmp,rs=rows(m),cs=cols(m),su_m,su_d);
tmp=matrix(rs,cs);
su_m=su_d=0; \\ inserted for documenting the multiplications & divisions
for(c=1,cs,
tmp[c,c]=1/m[c,c]; su_d++;
for(r=c+1,rs,
tmp[r,c]=-sum(k=c,r-1,m[r,k]*tmp[k,c])
/ m[r,r];
su_m+= (r-c);
su_d++;
);
);
\\ return(m);  \\ commented out, we need the counters of mult. & divs!
return([cs,su_m,su_d]);}


Document:

\\ document the multiplications, divisions in a list for m=1..20
for(m=1,20,print( triinv(PPow(1,m))));   \\ PPow gives a Pascalmatrix of size m x m


Protocol:

\\ protocol
\\ dim mu di  "mu"=multiplications "di"=divisions
\\ [1  0  1]
\\ [2  1  3]
\\ [3  4  6]
\\ [4 10 10]
\\ [5 20 15]
\\ [6 35 21]


Find formula:

\\ for multiplications we get the sequence [0,1,4,10,20,...]
\\ for divisions [1,3,6,10,...]
polinterpolate([1,4,10,20]) \\ check formula for multiplications

\\ %7 = 1/6*x^3 + 1/2*x^2 + 1/3*x   \\ result by Pari/GP

polinterpolate([0,1,4,10,20])

\\ %8 = 1/6*x^3 - 1/6*x      \\ result by Pari/GP


This space is now free for anyone to use

Question title: Can first order logic be extended to include infinite conjunctions?

Can first order logic (FOL) be extended in some way where infinite conjunctions are permissible? Specifically, can it be extended and still refute statements in a finite number of steps?

I would like this question to be answered using Tarskian semantics, where names refer to objects external to the logic.

Suppose that an infinite conjunction is legal syntax in a first order theory. In first order logic, we are free to negate any formula we can reason about, so a theory which can reason about infinite disjunctions will necessarily reason about their negation.

$$$$\tag{1} \{P_a,P_b,\dots\}$$$$

$$$$\tag{2} \lnot(P_a\lor P_b\lor\dots)$$$$

Consider a first order theory which contains the infinite set of formulae $$(1)$$ and the negation of an infinite disjunction $$(2)$$. Any interpretation which satisfies $$(2)$$ will necessarily make the set of formulae $$(1)$$ unsatisfiable. However, every finite subset of formulae will be satisfiable, which by compactness means that the whole thing is.

This is a contradiction, so it must not be the case that an infinite conjunction can be made legal syntax in a first order theory.

Question title: What did Hilary Putnam mean by this following quote of his?

In Putnam's paper "The logic of quantum mechanics", he states:

There is nothing really answering to the Copenhagen idea that two kinds of description (classical and quantum mechanical) must always be used for the description of physical reality (one kind for the ways to be used for the 'observer' and the other for the 'system'), nor to the idea that measurement changes what is measured in a indescribable way (or even brings into existence), nor to the 'quantum potential', 'pilot waves', ect. of the hidden variable theorists. These no more than Reichenbach's 'universal forces'.

Precisely what did he mean by this? In particular, what did he mean by the "idea that measurement changes what is measured in a indescribable way (or even brings into existence)"? How does one clearly define the the issue raised in the first point, and has it been resolved today?

From this you have bounds for your $$r(a_1)$$-parameter: $$r(a_1) = { E \over N+E } = 1-{ 1 \over E/N+1 } \implies$$

$$E_{min}=1-\{N \gamma_1 \} + N \gamma_1 \\ E_{max}=N$$

$$\displaystyle \lim_{N \to \infty} r(a_1)_{E_{min}} = 1-{ 1 \over (1-\{N \gamma_1 \} + N \gamma_1 )/N+1 } = 1-\frac 1{\gamma_1+1} = 1- \log_3(2) = \log_3(1.5)$$

$$\displaystyle \lim_{N \to \infty} r(a_1)_{E_{max}} = { E_{max} \over N + E_{max} } = { N \over 2N } = \frac 12$$

$${\lceil N \cdot \gamma_1 \rceil \over N+E} \le \frac E{N+E} = r(a_1) \le \frac N{N+E}$$

Let us assume the "Syracuse"-style notation of the Collatz-iteration $$a_{k+1}= {3a_k+1\over 2^{A_1}} \qquad a_k \small \text{ from the odd integers}$$ and for a $$N$$-fold iterated transformation the short, vectorial, notation: $$a_{N+1}=T(a_1;[A_1,A_2,...,A_N])$$ So let $$N$$ denote the (N)umber of steps $$3x+1$$ and $$S$$ denote the (S)um of the exponents $$A_k$$, which is also the number of $$x/2$$-steps.

Then, to convert this into the version of $$(3x+1)/2$$ and $$x/2$$ -stepping, we introduce $$E$$ the number of even steps without the $$(3x+1)/2$$ steps, so $$E=S-N$$.

With that, I understand your $$r(a_1)$$ as $$r(a_1)=E/(N+E) = (S-N)/S = 1- N/S$$.

We can observe,

• that the trival cycle $$1 = T(1;[2,2,2,...2])$$ to any length $$N$$, has the values $$S=2N$$ and $$E=N$$ and $$r(a_1)= 1-N/S = 1-N/(2N)=1/2$$
• that the first cycle in the negative numbers $$-1= T(-1;[1,1,1,1,...,1])$$ to any length $$N$$, has $$S=N$$, $$E=0$$, and $$r(a_1)= 0$$
• that the second cycle in the negative numbers $$-5=T(-5;[1,2,1,2,1,2,...,1,2])$$ to any even length $$N=2n$$, has $$S=3n$$, $$E=n$$ and $$r(a_1) = E/(N+E)= n/(3n) = 1/3$$

Now to have a cycle of any length, and other than $$T(a_1;[2,2,2,...,2])$$ we can use the well known multiplication-formula for the $$N$$ members of an expected cycle $$a_k$$ ($$k=1..N$$) $$a_2 \cdot a_3 \cdot ... \cdot a_N \cdot a_1 = \left({3a_1+1\over 2^{A_1}}\right) \left({3a_2+1\over 2^{A_2}}\right) \cdots \left({3a_N+1\over 2^{A_N}}\right)$$ This can be rearranged to $$2^S = 2^{A_1+A_2+...A_N} =\left(3+{1\over a_1}\right) \left(3+{1\over a_2}\right) \cdots \left(3+{1\over a_N}\right)$$ We see, that the rhs must be at least as large as the smallest perfect power of $$2$$ larger than $$3^N$$, but at most as $$4^N = 2^{2N}$$ so we get for the lhs (writing $$\gamma=\log_2(3)$$, and further below $$\gamma_1=\log_2(3)-1$$): $$2^{\lceil N \cdot \gamma \rceil} \le 2^S \le 2^{2N}$$ which in terms of $$S$$ means $$\lceil N \cdot \gamma \rceil \le S \le 2N \qquad \text{where } S \in \mathbb N^+$$ and in terms of $$E$$ instead $$\lceil N \cdot \gamma \rceil -N =\lceil N \cdot \gamma_1 \rceil \le E \le N$$ From this you have bounds for your $$r(a_1)$$-parameter: $$r(a_1) = { E \over N+E } \implies \\ {\lceil N \cdot \gamma_1 \rceil \over N+E} \le \frac E{N+E} = r(a_1) \le \frac N{N+E}$$ Well, this formula, in which $$E$$ must be evaluated after $$N$$ is given and might be checked for calculation of $$r(a_1)$$ between $$\lceil N \gamma_1 \rceil$$ and $$N$$, looks not very nice to me, so I'd reconsider the choice for the ratio-parameter $$r()$$.

FREE REAL ESTATE $${}{}{}{}{}$$

This space is free for anyone to use.

This space is now free for anyone to use

This box is free for everyone to use

1. To see how any formula was written in any question or answer, including this one, right-click on the expression and choose "Show Math As > TeX Commands". (When you do this, the '$' will not display. Make sure you add these. See the next point. Or click the Edit link at the bottom o a post to view the source code. 1. For inline formulas, enclose the formula in $...$. For displayed formulas, use $$...$$. These render differently. For example, type $\sum_{i=0}^n i^2 $ to show $$\sum_{i=0}^n i^2$$ (which is inline mode) or type $$\sum_{i=0}^n i^2$$ to show $$\sum_{i=0}^n i^2$$ (which is display mode). 2. There are in lower case Greek letters, $$\alpha, \beta, \ldots, \omega$$ and uppercase, $$\Gamma, \Delta, \ldots, \Omega$$. Some Greek letters have variant forms: $$\epsilon$$, $$\varepsilon$$, $$\phi$$, $$\varphi$$ and others. 3. For superscripts and subscripts, use ^ and _. For example $$x_i^2$$, $$\log_2 x$$, $$x_{i,j}$$. 4. Groups. Superscripts, subscripts, and other operations apply only to the next “group”. A “group” is either a single symbol, or any formula surrounded by curly braces {}. If you do 10^10, you will get a surprise: $$10^10$$. But 10^{10} gives what you probably wanted: $$10^{10}$$. Use curly braces to delimit a formula to which a superscript or subscript applies: x^5^6 is an error; {x^y}^z is $${x^y}^z$$, and x^{y^z} is $$x^{y^z}$$. Observe the difference between x_i^2 $$x_i^2$$ and x_{i^2} $$x_{i^2}$$. 5. Parentheses $$(2+3)[4+4]$$,$$\{a,b,c\}$$. These do not scale with the formula in between, so if you write (\frac{\sqrt x}{y^3}) the parentheses will be too small: $$(\frac{\sqrt x}{y^3})$$. Using \left(\right) will make the sizes adjust automatically to the formula they enclose: \left(\frac{\sqrt x}{y^3}\right) is $$\left(\frac{\sqrt x}{y^3}\right)$$. \left and\right apply to all the following sorts of parentheses: $$(x)$$, $$[x]$$, $$\{ x \}$$, $$|x|$$, $$\Vert x \Vert$$, $$\langle x \rangle$$, $$\lceil x \rceil$$, and $$\lfloor x \rfloor$$. 6. Sums and integrals the subscript is the lower limit and the superscript is the upper limit, $$\sum_1^n$$. Don't forget {} if the limits are more than a single symbol. For example, \sum_{i=0}^\infty i^2 is $$\sum_{i=0}^\infty i^2$$. Similarly, \prod $$\prod$$, \int $$\int$$, \bigcup $$\bigcup$$, \bigcap $$\bigcap$$, \iint $$\iint$$, \iiint $$\iiint$$, \idotsint $$\idotsint$$. 7. Fractions and binomials $$\frac 17 23 \frac{17}{23}$$,$$\frac ab$$,$$\frac{a+1}{b+1}\binom{n+1}{2k}$$ 8. Different Fonts • $$\mathbb{C}$$, $$\mathbb{R}$$, $$\mathbb{Q}$$, $$\mathbb{Z}$$, • $$\mathcal{CHNQRZ}$$ • $$\mathscr{CHNQRZ}$$ • $$\mathfrak{CHNQRZ}$$. 1. Radical signs / roots Use sqrt, which adjusts to the size of its argument: \sqrt{x^3} $$\sqrt{x^3}$$; \sqrt[3]{\frac xy} $$\sqrt[3]{\frac xy}$$. For complicated expressions, consider using {...}^{1/2} instead. 2. Some special functions such as $$\sin,\cos, \tan, \cot, \arcsin,\arccos, \arctan$$ $$\sinh,\cosh, \tanh, \coth, \arsinh,\arccos, \sec$$ $$\ln, \log,\lg,\log_2,\log_{16}$$ Use subscripts to attach a notation to \lim: \lim_{x\to 0} $$\lim_{x\to 0}$$ Nonstandard function names can be set with \operatorname{foo}(x) $$\operatorname{foo}(x)$$. 1. There are a very large number of special symbols and notations, too many to list here; see this shorter listing, or this exhaustive listing. Some of the most common include: • $$\lt$$, $$\gt$$, $$\le$$, $$\leq$$, $$\leqq$$, $$\leqslant$$, $$\ge$$, $$\geq$$, $$\geqq$$, $$\geqslant$$, $$\neq$$. You can use \not to put a slash through almost anything: \not\lt $$\not\lt$$ but it often looks bad. • $$\times$$, $$\div$$, $$\pm$$, $$\mp$$. \cdot is a centered dot: $$x\cdot y$$ • $$\cup$$, $$\cap$$, $$\setminus$$, $$\subset$$, $$\subseteq$$, $$\subsetneq$$, $$\supset$$, $$\in$$, $$\notin$$, $$\emptyset$$, $$\varnothing$$ • {n+1 \choose 2k} or \binom{n+1}{2k} $${n+1 \choose 2k}$$ • $$\to$$, $$\rightarrow$$, $$\leftarrow$$, $$\Rightarrow$$, $$\Leftarrow$$, $$\mapsto$$ • $$\land$$, $$\lor$$, $$\lnot$$, $$\forall$$, $$\exists$$, $$\top$$, $$\bot$$, $$\vdash$$, $$\vDash$$ • $$\star$$, $$\ast$$, $$\oplus$$, $$\circ$$, $$\bullet$$ • $$\approx$$, $$\sim$$, $$\simeq$$, $$\cong$$, $$\equiv$$, $$\prec$$, $$\lhd$$, $$\therefore$$ • $$\nabla$$, $$\partial$$ \Im \Re $$\Im$$, $$\Re$$ • For modular equivalence, use \pmod like this: a\equiv b\pmod n $$a\equiv b\pmod n$$. • For the binary mod operator, use \bmod like this: a\bmod 17 $$a\bmod 17$$. • Avoid using \mod, as it produces extra space: compare the above with a\mod 17 $$a\mod 17$$. • \ldots is the dots in $$a_1, a_2, \ldots ,a_n$$ \cdots is the dots in $$a_1+a_2+\cdots+a_n$$ Detexify lets you draw a symbol on a web page and then lists the $$\TeX$$ symbols that seem to resemble it. These are not guaranteed to work in MathJax but are a good place to start. To check that a command is supported, note that MathJax.org maintains a list of currently supported $$\LaTeX$$ commands, and one can also check Dr. Carol JVF Burns's page of $$\TeX$$ Commands Available in MathJax. 1. Spaces MathJax usually decides for itself how to space formulas, using a complex set of rules. Putting extra literal spaces into formulas will not change the amount of space MathJax puts in: a␣b and a␣␣␣␣b are both $$a b$$. To add more space, use \, for a thin space $$a\,b$$; \; for a wider space $$a\;b$$. \quad and \qquad are large spaces: $$a\quad b$$, $$a\qquad b$$. To set plain text, use \text{…}: $$\{x\in s\mid x\text{ is extra large}\}$$. You can nest $…$ inside of \text{…}, for example to access spaces. 1. Accents and diacritical marks Use \hat for a single symbol $$\hat x$$, \widehat for a larger formula $$\widehat{xy}$$. If you make it too wide, it will look silly. Similarly, there are \bar $$\bar x$$ and \overline $$\overline{xyz}$$, and \vec $$\vec x$$ and \overrightarrow $$\overrightarrow{xy}$$ and \overleftrightarrow $$\overleftrightarrow{xy}$$. For dots, as in $$\frac d{dx}x\dot x = \dot x^2 + x\ddot x$$, use \dot and \ddot. 2. Special characters used for MathJax interpreting can be escaped using the \ character: \\\$ $$\$$, \{ $$\{$$, \_ $$\_$$, etc. If you want \ itself, you should use \backslash (symbol) or \setminus (binary operation) for $$\backslash$$, because \\ is for a new line.

ta.stackexchange.com/a/29979/676335

This box is free for everyone to use

This box is free for everyone to use

This box is free for everyone to use

This box is free for everyone to use

Test newly available syntax using data from this question.

$$n$$ approximation solution
$$1$$ $$2.84071 +1.69496 \,i$$ $$2.84550 +1.68429 \,i$$
$$2$$ $$3.34357 +1.44741 \,i$$ $$3.35044 +1.43963 \,i$$
$$3$$ $$3.64315 +1.33808 \,i$$ $$3.65025 +1.33195 \,i$$
$$4$$ $$3.85317 +1.27397 \,i$$ $$3.86019 +1.26882 \,i$$
$$5$$ $$4.01366 +1.23065 \,i$$ $$4.02051 +1.22614 \,i$$
$$6$$ $$4.14297 +1.19882 \,i$$ $$4.14966 +1.19475 \,i$$
$$7$$ $$4.25095 +1.17409 \,i$$ $$4.25749 +1.17037 \,i$$
$$8$$ $$4.34346 +1.15414 \,i$$ $$4.34987 +1.15068 \,i$$
$$9$$ $$4.42428 +1.13756 \,i$$ $$4.43056 +1.13432 \,i$$
$$10$$ $$4.49595 +1.12348 \,i$$ $$4.50212 +1.12041 \,i$$
$$20$$ $$4.95332 +1.04533 \,i$$ $$4.95880 +1.04314 \,i$$
$$30$$ $$5.21027 +1.00868 \,i$$ $$5.21539 +1.00685 \,i$$
$$40$$ $$5.38829 +0.98573 \,i$$ $$5.39318 +0.98411 \,i$$
$$50$$ $$5.52410 +0.96940 \,i$$ $$5.52881 +0.96791 \,i$$
$$60$$ $$5.63366 +0.95690 \,i$$ $$5.63824 +0.95551 \,i$$
$$70$$ $$5.72535 +0.94687 \,i$$ $$5.72982 +0.94556 \,i$$
$$80$$ $$5.80411 +0.93855 \,i$$ $$5.80849 +0.93730 \,i$$
$$90$$ $$5.87307 +0.93147 \,i$$ $$5.87738 +0.93027 \,i$$
$$100$$ $$5.93438 +0.92534 \,i$$ $$5.93862 +0.92418 \,i$$
$$200$$ $$6.32917 +0.88910 \,i$$ $$6.33302 +0.88818 \,i$$
$$300$$ $$6.55383 +0.87067 \,i$$ $$6.55748 +0.86985 \,i$$
$$400$$ $$6.71067 +0.85862 \,i$$ $$6.71420 +0.85787 \,i$$
$$500$$ $$6.83097 +0.84980 \,i$$ $$6.83439 +0.84908 \,i$$
$$600$$ $$6.92840 +0.84289 \,i$$ $$6.93176 +0.84222 \,i$$
$$700$$ $$7.01021 +0.83726 \,i$$ $$7.01351 +0.83661 \,i$$
$$800$$ $$7.08066 +0.83252 \,i$$ $$7.08391 +0.83189 \,i$$
$$900$$ $$7.14249 +0.82845 \,i$$ $$7.14570 +0.827838 \,i$$
$$1000$$ $$7.19756 +0.82489 \,i$$ $$7.20073 +0.824289 \,i$$

This space is free for anyone to use.