In windows, we can set the display color, brightness etc in intel hd graphics app, such that, we don’t encounter eye strain. Is there any similar app in ubuntu to do that? I am not talking about blue light filter apps like f.lux or redshift. I wish to manually change the rgb, sharpness and all […]

# Tag: such that

I’m new to Bitcoin Script, and I was wondering if it is possible to use funds from one utxo to “insure” that other utxo will not be double-spent (until the Lightning Network will save us all). Suppose I have 0.1 bitcoin in a utxo with pubkey pubKey1, and 10 bitcoins that I would send to […]

I’ve got an odd one. My spouse is beginning to take an interest in and learn about computer science subjects. I’ve helped by providing lessons on programming topics, and finding educational things on topics such as transistors, binary math, etc. She posed a theory recently that I instinctively know cannot be correct, but I can’t […]

What I want to do is quite straightforward, but I can’t figure it out. Let’s say you have this variable defined in your global scope of your script: var contentOfRow = “<tr><td>hello</td></tr>”; Then, you have a HTML table, on top of which you have a +ADD button. On this button, you specify onlick=”addRow(contentOfRow)”, such that, […]

I have the following schema: CREATE TABLE t2 ( id TEXT PRIMARY KEY, t1_id TEXT REFERENCES t1(id) ); CREATE TABLE t3 ( id TEXT PRIMARY KEY, t2_id TEXT REFERENCES t2(id) ); CREATE TABLE t4 ( t4_counter BIGINT NOT NULL, t3_id TEXT REFERENCES t3(id), // Need UNIQUE constraint on t4_counter + t2_id ); There are 3 […]

## Finding Elliptic Curve with $P=[m]R$

To avoid X-Y problem I am going to write my problem down in detail, so plz bear with me. Given a point $P=(x,y)$ and a fixed number $m>1$, I need to find the elliptic curve over $Q$ given by a Weierstrass equation – $E := y^2 +a_1 xy +a_3 y = x^3 + a_2 x^2+a_4x+ […]

I refer to the answer of Mark to this recent post of mine. Mark, by using Proth’s theorem, sketches a possible proof of the following conjecture: Given a prime $\,p\neq 3$, does there exist $\,n\,$ such that $\,q = (p-1)2^{2n} + 1$ is prime? Now, the previous result implies the truth of Landau’s conjecture. In […]

Does a formula exist, such that, when we know all the primes less than N, e.g.: 2,3,5,7,11 we can calculate the next prime, in this case, 13? Note: while I am ok with using functions such as gcd(), I am looking for 1 formula, not an algorithm.

Does a formula exist, such that, when we know all the primes less than N, e.g.: 2,3,5,7,11 we can calculate the next prime, in this case, 13? Note: while I am ok with using functions such as gcd(), I am looking for 1 formula, not an algorithm.

We have two continuous functions f and g from topological space X to topolgical space Y. Where set Y having order topology. Now, consider Product topology Y×Y. We define a subset V of Y×Y, V = { (f(x),g(x)) | f(x)>g(x) for some x belonging to X} Now, can we say set V is open in […]