body1
stringlengths 20
4.1k
| body2
stringlengths 23
4.09k
|
|---|---|
In Game of Thrones, Daenerys has managed to survive fire or extreme heat in several instances: When Daenerys' dragons were born in the season 1 finale, "Fire and Blood" (Game of Thrones, S01E10) Killing the khals by locking them inside the temple of Vaes Dothrak and lighting the place on fire in "Book of the Stranger" (Game of Thrones, S06E04) - while all the men burned alive, Daenerys emerged from the hut unscratched. The steaming hot bath in "Winter is Coming" (Game of Thrones, S01E01) - Daenerys is warned by a servant that "it's too hot, my lady", but she steps in without flinching Daenerys casually picks up the dragon eggs that were roasting on hot coals, in "A Golden Crown" (Game of Thrones, S01E06) - when the Dothraki handmaiden, Irri, rushes in and knocks them off her hands, Daenery's hands are unscathed, while Irri's now have burn marks Here she didn't show immunity to heat, but made a relevant remark: Her comment, "He was no dragon. Fire cannot kill a dragon", at the time of Viserys' death in "A Golden Crown" (Game of Thrones, S01E06) George R. R. Martin, author of the novel series that the show is adapting, has stated that the Targaryens are not immune to fire (at least in the books). Were the above instances in which she is shown to be immune to fire (in the show) unique, or has she had this ability her whole life? If so, when and how did Daenerys acquire this ability?
|
In the scene in S01E06 where Khal Drogo pours molten gold over Viserys's head and he dies, Daenerys says that a real (dragon) Targaryen could never have been killed by that. While we know that dragon blooded Targaryens are immune to fire, how does that translate to being immune to a pot full of molten gold? The Molten metal might have anyways killed any person on whom it was poured over.
|
Let $X$ be a finite set. $\mathcal{P}(X)$ denotes the set of all subsets of $X$. Let $\Gamma$ be a sub-lattice of $\mathcal{P}(X)$, i.e. $\Gamma$ is a collection of subsets of $X$ closed under union and intersection. Suppose $\Gamma$ non-empty and $\Gamma$ not made only of the empty set. Set $$n:=n(\Gamma):=\min\{m\geq1\,|\, \Gamma\text{ contains at least one set of cardinality }m\}$$ and suppose $n\geq2$. I would like to find a lattice $\Gamma'$ isomorphic to $\Gamma$, but with $n(\Gamma')=1$. With this purpose I thought to define a map $\Phi\!:\Gamma\to\Phi(\Gamma)=:\Gamma'$ doing the following operations: from each set $A\in\Gamma$ with cardinality $|A|=n$, choose $n-1$ elements and delete them; (Notice that all these sets $A$'s are pairwise disjoint, by the minimality of $n$ and since $\Gamma$ is closed under intersection) call $Y$ the set of all deleted elements; from each set $B\in\Gamma$ with cardinality $|B|>n$, delete the elements of $Y$. Clearly in this way one obtains $\Gamma'\subseteq\mathcal{P}(X')$, where $X':=X\smallsetminus Y$. By construction $n(\Gamma')=1$. It is trivial that $\Phi$ is surjective. It is also easy to check that $\Phi$ is an homomorphism of lattices (i.e. $\Phi(A\cup B)=\Phi(A)\cup\Phi(B)\,$, $\,\Phi(A\cap B)=\Phi(A)\cap\Phi(B)\,$): it suffices to write $\Phi(A)=A\smallsetminus Y$ and apply elementary facts of set theory. Therefore to conclude it remains only to prove that $\Phi$ is injective. I think it is true because I don't manage to build any counter-example. Can you help me to prove it?
|
Let $X$ be a finite set. $\mathcal{P}(X)$ denotes the set of all subsets of $X$. Let $\Gamma$ be a sub-lattice of $\mathcal{P}(X)$, i.e. $\Gamma$ is a collection of subsets of $X$ closed under union and intersection. Suppose $\Gamma$ non-empty and $\Gamma$ not made only of the empty set. Set $$n:=n(\Gamma):=\min\{m\geq1\,|\, \Gamma\text{ contains at least one set of cardinality }m\}$$ and suppose $n\geq2$. I would like to find a lattice $\Gamma'$ isomorphic to $\Gamma$, but with $n(\Gamma')=1$. With this purpose I thought to define a map $\Phi\!:\Gamma\to\Phi(\Gamma)=:\Gamma'$ doing the following operations: from each set $A\in\Gamma$ with cardinality $|A|=n$, choose $n-1$ elements and delete them; (Notice that all these sets $A$'s are pairwise disjoint, by the minimality of $n$ and since $\Gamma$ is closed under intersection) call $Y$ the set of all deleted elements; from each set $B\in\Gamma$ with cardinality $|B|>n$, delete the elements of $Y$. Clearly in this way one obtains $\Gamma'\subseteq\mathcal{P}(X')$, where $X':=X\smallsetminus Y$, and $n(\Gamma')=1$. My questions are: is $\Gamma'$ a sub-lattice of $\mathcal P(X')$ ? is the map $\Phi$ an isomorphism of lattices (i.e. $\Phi$ bijection, $\Phi(A\cup B)=\Phi(A)\cup\Phi(B)\,$, $\,\Phi(A\cap B)=\Phi(A)\cap\Phi(B)\,$) ? Edit. It is trivial that $\Phi$ is surjective (by definition of $\Gamma'$). It seems also clear that $\Phi$ is an homomorphism of lattices: it suffices to write $\Phi(A)=A\smallsetminus Y$ and apply elementary facts of set theory. Therefore the only thing that remains to prove it that $\Phi$ is injective.
|
Where I've got to so far: Let $m(X)$ ε I be a non-zero polynomial of least degree. For any $a(X)$ ε $\mathbb{F}$$[X]$, $a(X)m(X)$ ε I as I is a principal ideal of $\mathbb{F}$$[X]$ thus $<m(x)>$ $⊆$ I. Let us now consider $b(X)$ ε I. By the division theorem for polynomials, $b(X) =q(x)m(x) + r(X)$ where $q(X), r(X)$ ε $\mathbb{F}$$[X]$ and $r(X) = 0$ or $deg(r(X)) < deg(m(X))$. Observe that $r(X) = b(X) - q(X)m(X)$ ε I. If $r(X) = 0$ then we are done: We have shown that $b(X) = q(X)m(X)$ which means $I ⊆ <m(X)>$ hence I $=$ $<m(X)>$. If $deg(r(X)) < deg(m(X))$ then observe that $m(X)$ was chosen to have the least degree in I thus $deg(r(X)) = 0$ which means $r(X)$ is a constant polynomial. So where I am so far is $r(X)$ = $b(X) - q(X)m(X)$ where $r(X)$ is a constant polynomial. How do deduce $b(X) = q(X)m(X)$ in this situation?
|
Let $F$ be a field and $R = F[X]$. Suppose $I$ is an ideal of $R$. Show that $I = (p(X))$ for some $p(X)$ in $F[X]$. (Hint: consider a polynomial $p(X)$ of least degree in $I$.) I'm trying to do this question but can't seem to start. if anyone could give me a hint that would be appreciated. My instinct was to take a monic polynomial (which exists since we are in a field) of degree $1$ and divide given the first two parts of the question were about polynomial division. Thanks.
|
When the centripetal force on an orbiting body disappears (e.g. if it the body is a ball and the force was exerted by a string and the string rips, or, more unrealistically, if the body is the earth and the sun suddenly disappeared), the body continues in linear motion. How is angular momentum conserved here?
|
I am not a physicist (math/comp-sci) but I understand that Angular Momentum is supposed to be conserved. I find this confusing because there seems to be many simple, common cases where a restrained, revolving body, when released seems to lose it's angular momentum. For example, let's say that a hammer thrower is revolving a 10kg hammer around herself at a 1 meter distance from their combined center of mass every second. Taking the hammer as a point-mass, then before release, the hammer and the thrower each have an angular momentum of $l\omega = (mr^2)*(2\Pi) = (10*1*1)*(2*3.14..) =~ 62.8 kg\text{-}m^2/s$ Now, after the hammer is released, the thrower still has her same angular momentum (also 62.8), but the hammer no longer seems to have any. Yes, I know that the hammer is still rotating (spinning) as it did when it was revolving around the thrower, so that angular momentum seems to be conserved, but the angular momentum from revolution (orbiting) seems to be gone. AFAIK, it's not transferred to it's spin angular momentum (observation seems to bear this out). Nor is it transferred to the thrower. Besides having no mechanism for this (she let go of it), if it did, we would have noticed hammer throwers being knocked over by having their angular momentum suddenly doubled. So where does it go? Or is it not actually conserved in this case?
|
I am trying to prove this and have looked at similar questions to gauge how to approach this. I have: Suppose that there exists a smallest rational number greater than $\sqrt{3}$. We shall call that number $n$, which, as it is rational, can be expressed as $\frac{p}{q}$ $\frac{\sqrt{3}+n}{\sqrt{3}}$ is a number greater than $\sqrt{3}$ but less than $n$, but this number would no longer be rational now, would it?
|
I am working on a proof about Dedekind cuts on the positive rational numbers. I have been stuck for a while on the following point and would appreciate any help. Given $x\in \mathbb{Q}^+$ such that $x^2<2$, how to find $y\in \mathbb{Q}^+$ such $y>x$ and $y^2<2$?
|
I am looking for advice for an iMessage program/app that can export threads with dates/times in conversation style, preferably to PDF. I have researched this quite a bit, but most results seem gimmicky and I am hesitant without some actually user feedback. Hopefully I can get some feedback here with which program is worthwhile at providing what I need.
|
I have a long (several months' worth) iMessage conversation with a contact. He lost these messages when he re-installed his OS, but I still have the archive. There is some important information there that we'd like to keep. Is there a simple way to export this conversation for archival in a human readable form, and also keep any images? I can select parts of the conversation, copy it to the clipboard and paste it into a rich text document, but this discards all images. I'm looking for a way that keeps the images. Note: I use iMessage on OS X only, not iOS. (Ideally I'd also like to export all non-image file attachments, but I'm not expecting that this will be possible.)
|
Let $\alpha$ a irrational number, and $R:S^{1}\rightarrow S^{1}$ the irrational rotation, i.e., $[x]\rightarrow[x+\alpha]$. I need to prove that, for all $[x]\in S^{1}$, the set $\{R^{n}([x])\}$ is dense in $S^{1}$. First, I can write $R$ by $$R(e^{2\pi ix})=e^{2\pi i (x+\alpha)}.$$ So, I can write $R^{n}(x)$, $n\in\mathbb{Z}$ by $$R^{n}(e^{2\pi i x})=e^{2\pi i(x+n\alpha)} $$ I need to prove that, for all $e^{2\pi i x}\in S^{1}$ and for all $[y]=e^{2\pi i y}\in S^{1}$, every neighborhood $V$ of $[y]$ contains a point $[z_{y}]=e^{2\pi i z}$ such that $[z_y]=R^{n}([x])$ for some $n\in\mathbb{Z}$. That is, $e^{2\pi i z}=e^{2\pi i (x+\alpha n)}\Rightarrow 2\pi iz=2\pi i(x+\alpha n)+2ik\pi\;\textrm{for some}\;k\in\mathbb{Z}\Rightarrow z=x+\alpha n+k.$ Is my way correct? If it does, how can I proceed now? If it doesn't, what I need to do? I don't think this question is duplicate. I'm showing my attempt to proof, that is different from other proofs.
|
This is exercise 1.9 in Lie Groups, Lie Algebras and Representations - Hall. Suppose $a$ is an irrational real number. Show that the set $E_a$ of the numbers of the form $e^{2\pi i n a}$, $n \in \mathbb{Z}$, is dense in the unit circle $S_1$. Hint: Show that if we divided $S^1$ into $N$ equally sized "bins" of length $2\pi/N$, there is at least one bin that contains infinitely many elements of $E_a$. Then use the fact that $E_a$ is a subgroup of $S^1$. My proof of this proposition is as follows. Since $a$ is irrational, you can determine that the set of rotations $E_a$ is infinite. Since $S^1$ is compact we can find two $r_1, r_2$ that are within $\epsilon$ of each other. Then $r_1^{-1}r_2$ is a small rotation of size $\epsilon$. Now, $r_1^{-1}r_2$ generates rotations that are within $\epsilon$ distance of any point of $S^1$. That said, I don't believe that the hint suggested in the problem uses that technique. My knowledge of algebra is not all that strong so I was hoping someone could shed some light on what is being suggested there.
|
I use to get information of questions, I noticed that some comments' last_activity_date is later than the question's last_activity_date, so my question is: when will the question's last_activity_date be updated? If a comment is submitted, will the question's last_activity_date be updated? If a question is solved, will the question's last_activity_date be updated with the timestamp when it is solved?
|
The two tabs have following tooltips Active : "Questions that have recent activity" Hot : Questions with recent interest and activity They seem to display different questions with some common ground. What is the exact difference between hot and active ?
|
I would like to store GeoJSON data into PostgreSQL database. WITH data AS (SELECT '{ "type": "FeatureCollection", "features": [ { "type": "Feature", "geometry": {"type": "Point", "coordinates": [102.0, 0.5]}, "properties": {"prop0": "value0"} }, { "type": "Feature", "geometry": { "type": "LineString", "coordinates": [ [102.0, 0.0], [103.0, 1.0], [104.0, 0.0], [105.0, 1.0] ] }, "properties": { "prop0": "value0", "prop1": 0.0 } }, { "type": "Feature", "geometry": { "type": "Polygon", "coordinates": [ [ [100.0, 0.0], [101.0, 0.0], [101.0, 1.0], [100.0, 1.0], [100.0, 0.0] ] ] }, "properties": { "prop0": "value0", "prop1": {"this": "that"} } } ] }'::json AS fc) SELECT row_number() OVER () AS gid, ST_AsText(ST_GeomFromGeoJSON(feat->>'geometry')) AS geom, feat->'properties' AS properties FROM ( SELECT json_array_elements(fc->'features') AS feat FROM data ) AS f; I can query but I need to save data as a table. Does anyone know how to store this kind data into a table in PostgreSQL.? Reference to This reference does only query but I need save the layer as a table.
|
I am new to GeoJSON. I have a GeoJSON features collection as shown and would like to store it in postgres table (testtable). My postgres table has a serial id and geometry column. { "type": "FeatureCollection", "features": [ { "type": "Feature", "geometry": { "type": "Point", "coordinates": [ 2565453.1826721914, -3835048.659760314 ] } }, { "type": "Feature", "geometry": { "type": "LineString", "coordinates": [ [ 2727584.7219710173, -3713449.1942418693 ], [ 2732476.691781269, -3992291.473426192 ] ] } }, { "type": "Feature", "geometry": { "type": "Polygon", "coordinates": [ [ [ 2442627.9025405287, -3705499.954308534 ], [ 2425506.008204649, -3886502.837287831 ], [ 2425506.008204649, -3886502.837287831 ], [ 2555143.2081763083, -3910962.686339088 ], [ 2442627.9025405287, -3705499.954308534 ] ] ] } } ] } I would like to insert the GeoJSON data into the table testtable. How do I go about it? I am using postgres version 9.3.5 with postgis version 2.1.3 I have been directed to previously asked questions which answer how to store a single feature eg a point or polygon. My question asks how to save multiple features in the GeoJSON file. By multiple features I mean a mixture of points, lines and polygon feature types in one file.
|
Say if I have a Dragonair, and keep on using stardust and candies to power it up to the max, would it cost exactly the same amount of stardust and candies if I evolve it to Dragonite first, and then power up?
|
When activating the evolution for a caught Pokemon, it seems to amplify the Combat Power (CP). Thus it seems most beneficial to evolve your Pokemon with the highest CP, if you have multiple of the same kind. But what I am not sure about is whether it makes an efficiency difference if you spend candies and dust to boost CP before evolving, to gain more from the amplification? Or is it more efficient to just evolve without spending, and then using the leftover candies afterwards, since they now give a bigger CP boost per candy? I only tested with a Rattata so far, which gained +8 CP per candy before evolving, and +15 CP afterwards. I collected no numbers on the amplification efficiency though, and now ran out of materials for further testing. Or maybe it is a balanced calculation and makes no difference at all? I would love to have some insight on that. Some data I collected thus far: (GPC = CP gain per candy) 79 CP Weedle (GPC 6) evolved to: 84 CP Kakuna (GPC 6), evolved at 90 CP to: 297 CP Beedrill Note: The max-CP "half circle" in the profile stayed filled roughly at the same relative position throughout the evolutions.
|
I have 2 hard drives, one with Windows and one with Ubuntu. How can I easily add Windows to the boot menu? I've installed GRUB customizer; can it be done with that program?
|
I recently got a computer from school. It came with Windows 8.1 installed. I then installed another copy of Windows 8.1 (so it would use the built-in Windows Pro license) and upgraded it to Windows 10. I then installed Ubuntu alongside both Windows 8 and 10. Note that I made a separate 255MB ext2 partition for /boot. Now, when I boot the computer, I first see a GRUB prompt (I already un-hid the grub prompt 'cuz I like it that way) with Windows 8 and Ubuntu options. However, there is no Windows 10 option. If I select Ubuntu, the computer boots into Ubuntu. However, if I select the Windows 8 option, I then get sent to the Windows bootloader, where it then gives me options to boot either Windows 8 or Windows 10. (However, by this point, the computer has already loaded the kernel and all. Apparently Microsoft misunderstood the concept of a bootloader and decided that that meant "boot practically the entire system before actually showing the bootloader". Typical Microsoft.) How can I disable the Windows bootloader and add a Windows 10 option to GRUB? EDIT: Someone has answered telling me to disable the Windows bootloader. However, I still do not know how to add Windows to the GRUB OS list. Can anyone help with this? EDIT 2: After removing Windows 10 from the Windows bootloader with EasyBCD, it seemed that, after a few reboots, it would continually unhide itself and Windows 10 would reappear. However, I then later deleted Windows 10 from the list of OSes in msconfig, and it seems to have stayed deleted. However, I STILL have not managed to get Windows 10 to appear in GRUB. It's as if GRUB simply doesn't detect it. Also, I'll put this in the question so that people see it - I have tried using boot-repair, however, it has NOT helped any.
|
I was born in China, immigrated to Canada and obtained Canadian citizenship. I did not renounce my Chinese citizenship. After obtaining my Canadian passport, I went back to China for a while. I later returned to Canada via the US. I have a 10-year US visa on my Chinese passport and I used to it to travel to the US. Then I flew to Canada using my Canadian passport. Therefore, the last record on my Chinese passport is me entering the US. While in Canada, I decided to go study in the UK, so I applied for a student visa using my Canadian passport. Currently I am in the UK as a Canadian international student and have just completed most of my studies. My dissertation is on the Chinese consumer market, so I am planning to return to China to conduct my research. However, I am very confused as to how I could return to China without the Chinese authorities finding out that I have two passports. Which passport should I use to travel?
|
I am a citizen of two different countries, and have two passports. How should I use my passports when traveling?
|
In propositional logic, the statement "If pigs can fly, then elephants can lay eggs." validates to true because the antecedent validates to false. In other words, given $a \rightarrow b$, if a is false, the entire statement is true. Why? Just because the antecendent is false doesn't mean that another fact depends on it, right?
|
I am studying entailment in classical first-order logic. The Truth Table we have been presented with for the statement $(p \Rightarrow q)\;$ (a.k.a. '$p$ implies $q$') is: $$\begin{array}{|c|c|c|} \hline p&q&p\Rightarrow q\\ \hline T&T&T\\ T&F&F\\ F&T&T\\ F&F&T\\\hline \end{array}$$ I 'get' lines 1, 2, and 3, but I do not understand line 4. Why is the statement $(p \Rightarrow q)$ True if both p and q are False? We have also been told that $(p \Rightarrow q)$ is logically equivalent to $(~p || q)$ (that is $\lnot p \lor q$). Stemming from my lack of understanding of line 4 of the Truth Table, I do not understand why this equivalence is accurate. Administrative note. You may experience being directed here even though your question was actually about line 3 of the truth table instead. In that case, see the companion question And even if your original worry was about line 4, it might be useful to skim the other question anyway; many of the answers to either question attempt to explain both lines.
|
When people say "the expansion of the Universe" they seem to mean the expansion of the space between mass-dense regions. However, my understanding is that space and time are intrinsically linked, so ① shouldn't time be "shrinking" (ticking slower) as space expands? ② Wouldn't that account for for redshift variances? If not, please explain how/why time is unaffected by expansion. Note: I have read , but it hasn't cleared up these questions for me.
|
Einstein's big revelation was that time and space are inseparable components of the same fabric. Physical observation tells us that distant galaxies are moving away from us at an accelerated rate, and because of the difficulty (impossibility?) of defining a coordinate system where things have well defined coordinates while also moving away from each other without changing the metric on the space, we interpret this to mean that space itself is expanding. Because space and time are so directly intertwined is it possible that time too is expanding? Or perhaps it could be contracting?
|
I was trying to install KDE plasma 5 in ubuntu 14.04 64 bit when i am trying to add sudo apt-add-repository ppa:neon/kf5 i am getting this error Cannot add PPA: 'ppa:neon/kf5'. Please check that the PPA name or format is correct. I was following the tutorial
|
I am attempting to install kubuntu-plasma5-desktop on Kubuntu 14.04 amd64, following sudo apt-add-repository ppa:neon/kf5 sudo apt update sudo apt install project-neon5-session project-neon5-utils project-neon5-konsole sudo apt-add-repository ppa:kubuntu-ppa/next sudo apt-add-repository ppa:ci-train-ppa-service/landing-005 sudo apt update sudo apt install kubuntu-plasma5-desktop Unable to locate package kubuntu-plasma5-desktop How can I fix this error?
|
Following is my code : I am sending the jSON object from one activity to another Activity. // In LoginActivity Intent intent = new Intent(LoginActivity.this,EmpLoginActivity.class); startActivity(intent); intent.putExtra("data",jsonObject.toString()); In EmpLoginActivty.java try { JSONObject jsonObject = new JSONObject(getIntent().getStringExtra("data")); tv1.setText(jsonObject.getString("name")); tv2.setText(jsonObject.getString("type")); tv3.setText(jsonObject.getString("hours")); } catch (JSONException e) { e.printStackTrace(); } Error : java.lang.RuntimeException: Unable to start activity ComponentInfo{com.example.krish.emp/com.example.krish.emp.EmpLoginActivity}: java.lang.NullPointerException: Attempt to invoke virtual method 'int java.lang.String.length()' on a null object reference
|
What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them? What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?
|
The sentence I'm having problems with is " Since 1896 the Olympic Games (be held) ________ every four years with some exceptions." The answer key says it is "has been held". Why should it be the singular form "has" instead of "have" as "Games" are plural,aren't they? Please explain to me why it should be "has been" instead of "have been".
|
Let's take the Golden Globes for example. Which of these is correct? The Golden Globes are getting a lot of attention. vs. The Golden Globes is getting a lot of attention. As a single event, my brain tells me it's the latter. The former sounds so much better though. Which is it?
|
Just for demo purpose, below logic only run into if clause but never run to else clause. \documentclass[tikz,border=2pt]{standalone} \usepackage{ifthen} \begin{document} \begin{tikzpicture} \pgfmathtruncatemacro{\x}{10} \foreach \i in {1,...,4} { \ifthenelse{\x = 0}{ \pgfmathtruncatemacro{\x}{1} \draw (0,0) circle (\i); }{ \pgfmathtruncatemacro{\x}{0} \draw[red,line width=2pt] (0,0) circle (\i); } } \end{tikzpicture} \end{document} Maybe the variable \x define is wrong! how can I get the varialbe \x value changed each time the if check run? Now the if clause always think \x = 0. but actually I changed it in the if clause.
|
I need to update a variable defined in a pgfmathsetmacro command inside a foreach loop. Apparently, the var is only updated when it is used after the update command. Here is a MWE: \begin{tikzpicture} \draw [help lines] (0,0) grid (3,3); \pgfmathsetmacro{\a}{1} \foreach \b in {2,3} { \node [blue] at (\a,0) {\a}; \pgfmathsetmacro{\a}{\b} \node [red] at (0,\a) {\a}; } \end{tikzpicture} The red nodes are printed at updated positions and the value printed is also updated; the blue nodes are not: they keep their initial value (1) and are located at the initial position (0,1). Why is this? Thanks José
|
I looked at the other questions already asked on SO regarding this same error message. They say to make sure my definition matches my implementation, and it does (I think). I have multiple classes, linkedListType (base template class), unorderedLinkedList (derived template class), main for testing it and a few others (can post snippets if needed). When compiling it, I get this error: Undefined symbols for architecture x86_64: "linkedListType<int>::deleteAtIndex(int&)", referenced from: deleteKthElement(unorderedLinkedList<int>&) in main.cpp.o "linkedListType<int>::getInfoAtIndex(int)", referenced from: printKthElement(unorderedLinkedList<int>&) in main.cpp.o deleteKthElement(unorderedLinkedList<int>&) in main.cpp.o "linkedListType<int>::linkedListType()", referenced from: unorderedLinkedList<int>::unorderedLinkedList() in main.cpp.o "linkedListType<int>::~linkedListType()", referenced from: unorderedLinkedList<int>::~unorderedLinkedList() in main.cpp.o "unorderedLinkedList<int>::deleteNode(int const&)", referenced from: vtable for unorderedLinkedList<int> in main.cpp.o "unorderedLinkedList<int>::insertLast(int const&)", referenced from: vtable for unorderedLinkedList<int> in main.cpp.o "unorderedLinkedList<int>::insertFirst(int const&)", referenced from: vtable for unorderedLinkedList<int> in main.cpp.o "unorderedLinkedList<int>::deleteSmallest()", referenced from: vtable for unorderedLinkedList<int> in main.cpp.o "unorderedLinkedList<int>::deleteAllOccurrences(int&)", referenced from: vtable for unorderedLinkedList<int> in main.cpp.o "unorderedLinkedList<int>::deleteFirstOccurrence(int&)", referenced from: vtable for unorderedLinkedList<int> in main.cpp.o "linkedListType<int>::printListReverse() const", referenced from: reversePrint(unorderedLinkedList<int>&) in main.cpp.o "linkedListType<int>::print() const", referenced from: print(unorderedLinkedList<int>&) in main.cpp.o "linkedListType<int>::length() const", referenced from: printKthElement(unorderedLinkedList<int>&) in main.cpp.o deleteKthElement(unorderedLinkedList<int>&) in main.cpp.o "unorderedLinkedList<int>::search(int const&) const", referenced from: vtable for unorderedLinkedList<int> in main.cpp.o Looking at the first one (deleteAtIndex): linkedListType.h: template<class Type> class linkedListType { public: ... void deleteAtIndex(int& desiredIndex); } linkedListType.cpp: template<class Type> void linkedListType<Type>::deleteAtIndex(int& desiredIndex) { nodeType<Type> *temp = getNodeAtIndex(desiredIndex); nodeType<Type> *priorNode = getNodeAtIndex(desiredIndex-1); priorNode->link = temp->link; delete temp; } main.cpp: // a convenience function in main.cpp... both 'getInfoAtIndex' and 'deleteAtIndex' only exist in the base class void deleteKthElement(unorderedLinkedList<int> &ull){ int elem; cout << "Enter an integer specifying the index to delete (0 - " << ull.length() - 1 << "): "; cin >> elem; int info = ull.getInfoAtIndex(elem); cout << "Info at index (" << elem << "): " << info << endl; ull.deleteAtIndex(elem); cout << "Node deleted." << endl; } I have no idea why these functions are giving me these errors.
|
Quote from : The only portable way of using templates at the moment is to implement them in header files by using inline functions. Why is this? (Clarification: header files are not the only portable solution. But they are the most convenient portable solution.)
|
I am looking for an image hosting solution where: I provide a user with a dedicated link That user clicks it and lands on a gallery management page where they can upload and remove images In addition, I want to show this user's gallery this way: Based on the gallery ID or something, I embed some JavaScript code on my web page (so it loads at the visitors browser's run-time rather than web crawlers that eat bandwidth) A visitor loads the page and sees the gallery. I will style it using my CSS. The above solution frees me from bandwidth usage, file uploading coding, complicated API/REST calls and much more. The image files are not going through my server. All I want is to be able to generate some unique "gallery-id", to which I will redirect one user (the "owner" of that gallery) as well as display it on a web page. Any solution for the above? NOT A DUPLICATE OF ANY OTHER QUESTION - please read the question.
|
This is a "catch-all" question designed to serve as an answer for all questions about choosing web hosting. Pro Webmasters no longer accepts new questions about how to choose hosting. All future questions pertaining to finding web hosting should be closed as a duplicate of this question. For more information about this policy please see . How to find web hosting that meets my requirements? What we're looking for in answers to this question are the basics about web hosting: What is web hosting? What is the difference between shared, VPS, and dedicated hosting? How does a content delivery network relate to web hosting? Anything else you feel is helpful in finding a web host. What we do not want is: Endorsements or recommendations for specific web hosts We do not want your experience or other subjective information (just the facts please)
|
So my problem is that, while installing Eclipse, I created some desktop files in different locations, installing them all (I was trying to solve a bug, hence the need for repeatedly installing .desktop files. Somewhere along the line I must have created one in an alternate directory). But anyways, my dilemma now is that when I search "Eclipse" from Unity Search I get two icons in the results. One is the one I wanted to use (i.e. the .desktop file with the correct settings, arguments), and the other is absolutely useless. However for the life of me, I can't figure out where the useless entry is located. I've tried just using Nautilus's search to find .desktop files, but it only gives me the correct .desktop file. I have no idea where the .desktop with the incorrect information is located; the only way I can locate it is through the search bar of Unity. I'm reasonably sure that I've created a soft link to it in my bin; not sure though. Anyways, my question here is whether there's some way to locate files from Unity search. Dragging the result into Terminal doesnt seem to work, and the search feature is supremely unhelpful concerning file paths. [Subquestion with no real answer]: I'm also looking for a better desktop environment. I really hate having to make .desktop files just to get a program into the Unity toolbar, and long for just being able to drag-and-drop a program in like Windows. Any help here? Anyways, thanks!
|
I'm trying to use the dash instead of gnome-do, but I can't find files. "Find files" only returns "Top Results". In gnome-do, I was able to set some often-used directories to index. For example, I have a folder called "ToRead" that's full of pdf files. I could search for pdf. Then I can browse the pdf files in ToRead and open files without using my mouse. Ideally, I want to replicate this functionality within the Dash/Places interface. Is this possible? If not, what's the shortest way to do it? Clarifications: "Files & Folders" does not do what I want. It only shows files I've used recently. I'd like to be able to do this without using the mouse and without having to hit Tab hundreds of times. I don't need my search to be indexed. A file system crawl (but only in the directories I set) is fine.
|
I'm rewriting some 20+ year old Unix scripts and I want the output to go to the screen and a file. I know this is possible with tee. Is there a similar command that stacks new lines on top, at the beginning of a file? I'd like the file to be output in reverse chronological order. The script output will redirect to a WWW folder. For remotely viewing the output, I want to F5 in a browser and have new lines at the top of the browser window. I'll recycle the file (cp log log_$(date '+%Y%m%d') && cp /dev/null log) everyday to keep it from growing too large. I was hoping tee had a complimentary utility like cat has with tac, but alas no luck.
|
I want to insert text at the top of an already existing file. How can I achieve this. I tried echo and tee but was not successful. I was trying to insert repo line at the top of sources.list file from terminal. Note I need an one line quick solution, because another answer's method was known to me already
|
QUESTION. If $S$ is any set, prove that it is impossible to find a mapping of $S$ onto $S^{\ast}$. ( $S^{\ast}$ is the set of all subsets of $S$). MY PROOF: I ask my proof is right or wrong..... If $S$ has $n$ element then $S^{\ast}$ has $ 2^n$ elements. it means $S^{\ast}$ have greater number of elements than $S$ so every member of $S^{\ast}$ cannot be associated with an member of $S$ , because of pigeon hole principle which says, If $n > m$ pigeons are put into $m$ pigeonholes, there's a hole with more than one pigeon. and if a member of $S$ associate more than one member of $S^{\ast}$ function not defined so for function to be defined some member of $S^{\ast}$ should not be associated with any member of $S$ so function is not onto.
|
Show that: Let A be a set and let $P(A)$ be the set of all subsets of $A$. Then there is no surjection $f: A→P(A)$. Here is what I thought: if $A=\{a,b\}$ then it has only two elements where $P(A)=\{∅,\{a\},\{b\},\{a,b\}\}$ has 4 elements. Therefore $f:A→P(A)$ cannot be surjective. But I have some problems: 1) How is it possible that any $f$ function to take $\{a\}$ from set $A$ to $\{a,b\}$? Maybe because I am thinking mainly about functions with real values like $f(x)=2x$, I find it a little bit strange that a function to take an element of a set to another set which has more elements. Is it possible? edit: Now I thought that if $f(x)$ is $\sqrt{x}$, then $f(4)=±2$ which means it took an element from a set to a set which has 2 elements. But still I find it kind of strange to denote $f(\{a\})=\{a,b,c,...\}$ 2) How can I construct a explicit proof for this question? Regards
|
So I am doing a search GUI for full pc systems. The button Get Info is the action button that retrieves the values from the MySQL database and puts them in the jTextfields, but when I press on Get Info, nothing happends, and no errors. This is the method that gets all the info, and the method is located in class DBAccess which contains all the SQL methods + the connection to database. public SQLException getpc(fullpc fp) { ResultSet rs; connect (); try { rs = stmt.executeQuery("SELECT * FROM fullsystems WHERE Name = " + fp.name); while(rs.next()) { fp.id = rs.getString("ID"); fp.name = rs.getString("Name"); fp.cpu = rs.getString("Processor"); fp.gpu = rs.getString("Graphics"); fp.ram = rs.getString("Memory"); fp.p = rs.getString("Price"); fp.quant = rs.getString("Available quantity"); } } catch (SQLException e) { return e; } return null; } And this is the class that contains all the attributes of the table: package area51project; public class fullpc { public String id; public String name; public String cpu; public String gpu; public String ram; public String mem; public String p; public String quant; } And at last, the code that is put into the Get Info button: private void jButton1ActionPerformed(java.awt.event.ActionEvent evt) { fullpc fp = new fullpc(); DBAccess db = new DBAccess(); fp.name = (String) jComboBox1.getSelectedItem(); db.getpc(fp); cpu.setText(fp.cpu); ram.setText(fp.ram); storage.setText(fp.mem); gpu.setText(fp.gpu); price.setText(fp.p); quantity.setText(fp.quant); } The jCombobox1 is just the combobox that is near the Get Info button, so I choose the name of the PC, and then pressing the button shows the info of that PC in the jTextfields. However, Price and Quantity are shown in jLabels. Help?
|
I always thought Java uses pass-by-reference. However, I've seen a couple of blog posts (for example, ) that claim that it isn't (the blog post says that Java uses pass-by-value). I don't think I understand the distinction they're making. What is the explanation?
|
I've been working on a proof of the irrationality of $e$. I was thinking that this would move in a similar routine to proving that the square root of a prime number is irrational, but I think that routine might be a little overdone. I want to try and prove it in a manner that deals with the expansion of $e = \frac{1}{0!} + \frac{1}{1!} + \frac{1}{2!} + ... = \sum_{i=0}^{\infty} \frac{1}{n!}.$ If I assume this sum is rational, will I run into some contradictory properties related to the sum of an infinite series?
|
Prove that e is an irrational number. Recall that $\,\mathrm{e}=\displaystyle\sum_{n=0}^\infty\frac{1}{n!},\,\,$ and assume $\,\mathrm{e}\,$ is rational, then $$\sum\limits_{k=0}^\infty \frac{1}{k!} = \frac{a}{b},\quad \text{for some positive integers}\,\,\, a,b.$$ so $$b\sum\limits_{k=0}^\infty \frac{1}{k!} =a$$ or $$ b\left(1+1+\frac{1}{2} + \frac{1}{6} +\cdots \right)= a. $$ Where can I go from here?
|
We all come through Google to questions like "Which is better Matlab or OpenCV?" or "What are the best resources for learning ?" These questions tend to be closed, sometimes marked for deletion, be primary opinion based, have hundreds of upvotes, and be really useful. It would be good if these were always available, perhaps though automatic migration to another StackExchange instead of deletion. While the knowledge is not in the StackOverflow form, it is knowledge none the less. Is there any consistent attempt to save this knowledge?
|
Historical locks are sometimes applied to questions. What is a historical lock? What is the purpose of a historical lock? How are questions affected by historical locking? When is it appropriate to lock a question for historical reasons? When is it not appropriate? How do I request a historical lock for a question? What should I do if I notice a serious problem with a historically-locked question or one of its answers?
|
In D&D 5e, according to , if a Medium-sized character uses a Large weapon, its damage dice are doubled, but it causes them to suffer disadvantage on their attack roll: Big monsters typically wield oversized weapons that deal extra dice of damage on a hit. Double the weapon dice if the creature is Large, triple the weapon dice if it's Huge, and quadruple the weapon dice if it's Gargantuan. For example, a Huge giant wielding an appropriately sized greataxe deals 3d12 slashing damage (plus its Strength bonus), instead of the normal 1d12. A creature has disadvantage on attack rolls with a weapon that is sized for a larger attacker. You can rule that a weapon sized for an attacker two or more sizes larger is too big for the creature to use at all. The answers to the question support this interpretation. However, my question is not asking whether wielding oversized weapons is allowed or not. Assuming that characters are allowed to wield Large-sized weapons, when (if ever) is it statistically advantageous to do so? Let's take the example of a Variant Human Barbarian with a starting Strength score of 16, and Great Weapon Master as their racial feat. Are they better off using a Medium or Large Greataxe? What about when Reckless Attack, Rage and/or Great Weapon Master enter the mix? I expect that this would probably depend on the AC of the target, but how would they compare? Does this change as the Barbarian levels up and gains additional damage from their Strength modifier or Rage bonus increasing?
|
With the new Elemental Evil Player's Companion released awhile ago, Goliaths were added to 5e. I'm unfamiliar with 3.5 and previous editions, but I know that they were included and wielding large weapons was a thing you could potentially do. Goliaths in 5e have the same trait as in 3.5e, it seems: Powerful Build. You count as one size larger when determining your carrying capacity and the weight you can push, drag, or lift. So, does this mean a Goliath can wield large-sized weapons? The pushing/dragging/lifting capacity for a strong Goliath (say 16 Str) would be nearly 1000 lbs (16 * 60) and the carrying capacity half of that. A heavy weapon weighs between 10-20 lbs, but this IS significant weight to be throwing around in battle, but I am unsure of the weight of a large weapon. My DM and I are unsure of the mechanics if a Goliath could. We talked about doing an extra die roll for damage, which is extremely strong, or treating the Goliath as if he were under the Enlarged Creature spell, which gives a +4 to damage, which seems more balanced in our opinions. Are there rules for wielding large weapons in 5e? Can a Goliath wield large weapons out of the box with no feats?
|
Let $\{\theta_t : \Omega \mapsto \Omega \ | \ t \in T \}$ be a family of measure preserving transformations on the probability space $(\Omega, \mathcal{F}, \mathbb{P}).$ A measurable random dynamical system on the measurable space $(X, \mathcal{B})$ over $(\Omega, \mathcal{F}, \mathbb{P}, \theta_T)$ is a mapping $$\phi : T \times \Omega \times X \mapsto X$$ so that the mappings $\phi(t,\omega, \cdot) : X \mapsto X$ form a cocyle over $\theta(\cdot)$. I admit it: this is over my head. I think I understand the basic idea of a random dynamical systems. We take some point $x_0$, and map it some other point. But, the maps are random so each map is different, hence the word "random" in "random dynamical system." (is this correct?) However, I am not seeing that in this definition. I was wondering if someone could explain this in somewhat less rigorous manner, even if the itty gritty details are missed. So, if someone could provide a pretty detailed explanation of this definition, with less rigor, and maybe an example, that would be great! Edit: There is a question similar to this but the answer did not help.
|
As of now, the formal definition of a random dynamical system is a bit over my head. And many of the papers and books on this subject are not exactly "introductory-friendly." I still have a lot of years to go before I fully understand this topic, or rather, fully understand the prerequisites for this topic. I was wondering if someone could provide me a definition of a random dynamical system in layman's terms. For example, how would you describe random dynamical systems to a group of high schoolers?
|
what I want to achieve is to install Firefox beta channel to update the current version so after running this command sudo apt-repository ppa:mozillateam/firefox-next I got this error sudo: apt-repository: command not found I've searched a lot to fix this, I found to fix this is to install sudo apt-get install python-software-properties which is printing the following Reading package lists... Done Building dependency tree Reading state information... Done python-software-properties is already the newest version (0.96.9debian1). 0 upgraded, 0 newly installed, 0 to remove and 1 not upgraded. and I've tried what is mentioned in this and nothing worked. I can't find any solution for this.
|
In Ubuntu one can add a repository via following command - sudo add-apt-repository ppa:yannubuntu/boot-repair As Ubuntu is based on Debian code base, I was expecting that the same would work in Debian too, but it doesn't. What is the reason for this? Is there some other shell command I can use to achieve the same? Note: I know I can edit /etc/apt/sources.list, but I want to achieve this from the shell. I also want to know why the same command won't work when the code base is the same.
|
What is the future tense of the word can? One way to express it is "will be able to", but what is actually the future tense of "can" ?
|
All normal verbs can be conjugated in the future tense. e.g. I know, I will know. I do, I will do. But I have noticed that we cannot conjugate the modal verb can in the future tense. can, I will can? Although we are able to conjugate the phrase be able (that has approximately the same meaning of can) to will be able, we cannot conjugate can. Is there a way to express can in the future tense without using the expression to be able? Additionally, need and dare are sometimes utilised as a modal verb. I need not. Need I not? I dare say. Dare he do it? Are we able to conjugate these verbs in the future tense as modal verbs? If need were used as a ‘normal’ verb, an example of it in the future tense would be I will need to do it. Can we write that sentence by making need a modal verb? Thank you.
|
I would like to remove the colour only for the Author Name in the citation created using natbib + bibliography for Springer (svjour3) journal manuscript. \documentclass[12pt,a4paper,referee]{svjour3} \smartqed \usepackage{mathptmx} \usepackage{float} \usepackage{url} \usepackage[colorlinks=true,linkcolor=blue,citecolor=blue,urlcolor=blue]{hyperref} \usepackage{etoolbox} \usepackage{cite} \usepackage{natbib} \begin{document} \citep{kannan2013} ....... \\ \citet{kannan2013} \begin{thebibliography}{300} \bibitem[Kannan and Santhi(2013)]{kannan2013} Kannan, M. R., \& Santhi, M. H. (2013). Constructability Assessment of Climbing Formwork Systems using Building Information Modeling. \textit{Procedia Engineering}, 64, 1129-1138. \end{thebibliography} \end{document}
|
I am using the natbib and hyperref packages: \usepackage{natbib} \usepackage[pagebackref=true, plainpages=false, bookmarks, bookmarksnumbered, colorlinks, linktocpage=true, linkcolor=blue, citecolor=blue, filecolor=black, urlcolor=blue]{hyperref} With my current settings (above) both the name and the year are hyperlinked. My question is, whether there is a way to hyperlink (or color) only the year-not the author(s). I have the impression reading this post that biblatex does it by default. However changing to biblatex is not an option for me at this point. Any helpful comments will be greatly appreciated.
|
I wonder what is the difference of these two queries and which one hás the best performance? SELECT employee.*, company.name FROM company, employee WHERE employee.company_id = company.id AND company.id = '365' or SELECT employee.*, company.name FROM company INNER JOIN employee ON employee.company_id = company.id WHERE company.id = '365'
|
Is there any efficiency difference in an explicit vs implicit inner join? For example: SELECT * FROM table a INNER JOIN table b ON a.id = b.id; vs. SELECT a.*, b.* FROM table a, table b WHERE a.id = b.id;
|
I know that definite article is used when a noun is already known in the context. But I'm not sure with the usage of definite article when I described something explicitly but it hasn't been mentioned before. So here's my example. 'I believe children are used to listening to the type of music that celebrities promote their life styles' In the sentence, 'the type of music' was not mentioned before, however I described what type of music it is in the sentence. Also it sounds more comfortable with the article. Is the article used right? or should it be just 'a type of music'? Thanks for reading my question.
|
I can’t for the life of me figure out where to use a and where to use the — and where there is no article at all. Is there a simple rule of thumb to memorize? The standard rule you always hear: “If a person knows which item you are talking about then use "the" . . . doesn’t clear things up for me, as I have no idea whether or not they know.
|
I'm not sure why I cannot use sizeof(array) when passing the array through my function only outputs a value of 1, instead of 1000000. Before passing the array to the function, I printed out the sizeof(array) to get 4000000 and when I try to printout the sizeof(array) in the function, I only get 4. I can iterate through the array in both the function and the main to display all values, I just cannot display sizeof within the function. Did I pass the array through incorrectly? #include <stdio.h> #include <stdlib.h> int searchMe(int numbers[], int target) { printf("%d\n", sizeof(numbers)); int position = -1; int i; int k = sizeof(numbers) / sizeof(numbers[0]); for (i = 0; i < k && position == -1; i++) { if (numbers[i] == target) { position = i; } } return position; } int main(void) { int numbers[1000000]; int i; int search; for (i = 0; i < 1000000; i++) { numbers[i] = i; } printf("Enter a number: "); scanf("%d", &search); printf("%d\n", sizeof(numbers)); int position = searchMe(numbers, search); printf("Position of %d is at %d\n", search, position); return 0; }
|
First off, here is some code: int main() { int days[] = {1,2,3,4,5}; int *ptr = days; printf("%u\n", sizeof(days)); printf("%u\n", sizeof(ptr)); return 0; } Is there a way to find out the size of the array that ptr is pointing to (instead of just giving its size, which is four bytes on a 32-bit system)?
|
I am looking for a way, to change the height of a row in a tabular environment (or evenly add space at the top and bottom) but without changing the size of an included matrix. If I use \renewcommand{arraystretch}{1.5} (which works perfectly in any other case) unfortunately also changes the size of my matrix. See MWE: \documentclass[a4paper,12pt]{report} \usepackage{amsmath} \begin{document} \begin{tabular}{|c|c|}\hline $\begin{pmatrix} 1\\2\\3 \end{pmatrix}$&2 \\ \hline \end{tabular} \renewcommand{\arraystretch}{1.5} \begin{tabular}{|c|c|}\hline $\begin{pmatrix} 1\\2\\3 \end{pmatrix}$&2 \\ \hline \end{tabular} \end{document} Which gives me the following output: and But I actually want something like this: Is there any way to do this?
|
Possible Duplicate: I am trying to insert a matrix inside a table, and I am looking for a good way to do this. Usually when I write matrices in equations, I use array environment, so I naively defined an array inside tabular, and it sort of works. The only problem is that the matrix itself seems to take up a huge amount of space inside the cell. An example is \begin{tabular}{|c|c|} \hline \textbf{EKF} & \textbf{UKF}\\ \hline $Q = \left[ \begin{array}{cc} 0.1 & 0 \\ 0 & 0.1 \end{array}\right]$ & $Q = left[ \begin{array}{cc} 0.01 & 0 \\ 0 & 0.01 \end{array}\right]$\\ \hline $R = 5 \times 10^{-3}$ & $R = 5 \times 10^{-5}$ \\ \hline \end{tabular} Is there any way to increase the spacing in the cell containing the matrix without that matrix taking up all the space?
|
I don't know [who's responsible]. I don't know [who's the best person for this job]. I don't know [what's best]. I'm assuming sentences 1–3 are grammatical. How are the parts in brackets analyzed? I know in relative clauses subject–auxiliary inversion doesn't occur, unlike here, so these aren't relative clauses, are they? Are these "fused relatives" or "content clauses" or what? What would a modern analysis be? (I'm not asking for anything detailed here, just the general structure and the relevant terminology, essentially.) Related to the above: I don't know who responsible is. I don't know who the best person for this job is. I don't know what best is. Sentence 4 sounds weird/wrong, 5 sounds okay(?), and 6 sounds okay if you're asking about the word "best", I suppose. How come it's sometimes possible to transform the original sentences like this?
|
I know that to indirectly ask: What is your name? I should say something like: I don't know what your name is. But what if the subject of question is longer than "your name"? Something like: What is the benefit of closing school when there's a flu outbreak It just doesn't sound so good to me to indirectly ask the above question when the distance between what and is gets too long: I don't know what the benefit of closing schools when there's a flu outbreak is. So, I am wondering if it is Ok to ask the indirect question like this: I don't know what is the benefit of closing schools when there's a flu outbreak.
|
This is not working as I intended it to, regardless it's running my if clause even if my email format is: something like [email protected] not sure what is wrong here. Regex RX = new Regex("^[a-zA-Z0-9]{1,20}@[a-zA-Z0-9]{1-20}.[a-zA-Z]{2,3}$"); if (!RX.IsMatch(textEmail.Text)) { MessageBox.Show("Email format is not correct"); } else { MessageBox.Show("Email format is CORRECT"); } it should really run the else clause
|
Over the years I have slowly developed a that validates MOST email addresses correctly, assuming they don't use an IP address as the server part. I use it in several PHP programs, and it works most of the time. However, from time to time I get contacted by someone that is having trouble with a site that uses it, and I end up having to make some adjustment (most recently I realized that I wasn't allowing 4-character TLDs). What is the best regular expression you have or have seen for validating emails? I've seen several solutions that use functions that use several shorter expressions, but I'd rather have one long complex expression in a simple function instead of several short expression in a more complex function.
|
Prove using mathematical induction that $n<3^n$ for all positive integers $n$ I came until here, 3^k+1< 3^(k+1) I wanna know if this is already the final answer?
|
As title says : Prove using mathematical induction that $n < 3^n$ for all positive integers $n$. I came till here $(k+1)<3^k + 1$ From here I don't have any idea how to show $(k+1)<3^{(k+1)}$ . Please help.
|
After updating to latest version 16.04, automatically all the folder and file icon sizes have increased. Even my search bar size has increased. How to resolve this ?
|
In the newest Nautilus 3.18 the smallest folder/icon size is really too big. Is there some way to hack (or something) this program and set a smaller one?
|
So I have the integral below which I am meant to evaluate using complex analysis. I was thinking to transform this integral and evaluate using the Residue theorem, but the process is incredibly messy and I am doubting if that is correct way to proceed. I know the answer should be $2\,\pi-4/3\,\sqrt {3}\pi$. $$\int_{0}^{2\,\pi}\!{\frac {\cos \left( x \right) }{2+\cos \left( x \right) }}\,{\rm d}x$$
|
Calculate the integral for $\left|a\right|<1$ $$\int_{-\pi}^{\pi} \dfrac{\cos(n\theta)}{1-2a\cos(\theta)+a^2}d\theta$$ I'm supposed to evaluate this using method of residues, but the parameter a is confusing me. I'm not even sure what contour I should use. Any help would be very appreciated.
|
Show that if $G$ is a group with $|G| = p^nq$, with $p$ and $q$ are primes and $p > q$, then $G$ contains a unique normal subgroup of index $q$.
|
I'm trying to prove if $|G|=p^nq$ with $p\gt q$, primes, then $G$ contains a unique normal subgroup of index $q$. I know by the first Sylow theorem that G has a Sylow p-subgroup $P$ with $[G:P]=q$. My problem is prove that it's unique. I need help Thanks in advance
|
I have a Schengen business visa. Can I travel as a tourist to the Schengen states or do I need to apply again for a tourist visa?
|
I am an Indian citizen living in UK on a tier 2 visa. Recently, I have received Short stay Schengen visas (multiple entry, business trips for 1 year) for travelling to France. (Applied at French embassy Edinburgh) Unfortunately, the tickets I have provided in my visa application needs to be cancelled as my business trip got cancelled. And I will be travelling for business probably after 4 months. So, for now, I am planning my first entry to France for tourism purpose. Is it okay to travel with Short stay Schengen visas (business) for tourism purpose for the very first entry to France? I am worried because my itinerary provided for visa application is changed now. And moreover it is now for a tourism purpose.
|
We have Internet facing site in SharePoint Online, we want to block some IP range and we want to provide access to certain IP range and also we want to restrict some IP range. Is it possible in SharePoint Online? or in in Windows AZURE (On-Premise)?
|
We have SharePoint 2013 Environment License E1 with P2 and need assistance of below question 1) In our application, we want to provide access to External users they don't have license, Is it possible In SharePoint Online? It would be really good if anyone provide any pointers/suggestions on this
|
Something is seriously wrong after I updated my site with new templates, moved to a new server and started writing on English rather than Norwegian. I know from Google Analytics, that most of my readers comes from Google. I do a quick test by googling (google.no) Oslo Fashion Fair 2009. This is the name of the article and is the title of my page. ( ) The page that I trying to find is this: This used to be one of the first pages in Google. Now you don't see my site until Page 4, and that is a link to something completely different. On page 4 in the google search, you see this: Designere - Norwegian Fashion Norske designere Når man tenker fashion,tenker de fleste på designere som Yves Saint ... Fashion Week Guide 16-22 august 2010 · Oslo Fashion Fair 2009 ... www.norwegianfashion.no/blog/designere There are a few problems with this: The headline says Designere - Norwegian Fashion. I no longer have a page called Designere. It's now called . The link points to www.norwegianfashion.no/blog/designere. But I've never had that a URL with that name. The page does not exist. When you click the link, a completely different page opens. I also noticed that I ahve lost Page Rank. My Page-RAnk add-on in Firefox will no longer rate my site, and Googles own Page Rank checker can't check my site for page ranking. So what kind of SEO have I done? I've put the <title> tag at the top, followed by the meta tags <description> and Keywords For new pages, I use my intro texst in the description field. I've made sure to use appropriate H1 - H3 tags I've got relative content in headline vs intro and main body text, as well as appropriate keywords. I've added my site to Google I've used Google Webmaster Tools to optimize my site I've added a sitemap.xml I don't know why I'm suddenly not being indexed by any search engines. What have I done wrong? UPDATE Using Google Webmaster tool, I can see issues Google encountered when crawling my site. Thre are a lot of 404 Page not found errors. Example of 404 errors: nyhetsarkiv is now called news I have deleted marianne ase user in Wordpress. This author do not exists any more Not sure what this is. I'v enever used this permalink structure.
|
This is a general, community wiki question and answer pair intended to address any questions concerning the reasons a site or specific site contents do not appear in search engine results. If your question was closed as a duplicate of this question and you feel that the information provided here does not provide a sufficient answer, please open a discussion on . My site (or specific pages on my site) is not appearing in search engine results. Why isn't my content indexed and what can I do about it?
|
As seen in the above image, in my Stack Overflow account, +2 reputation is not showing in "Exact Different between "Content-Provider" and "SQLite Database"" question, but there should be +2 reputation highlighted. I dont know why +2 reputation is not showing up.
|
On Stack Exchange, users may gain a certain level of reputation. What does reputation do? How can a user gain or lose reputation? See also in the Help Center - Maximum amount of votes a user can use in a day and reputation requirements to vote. - How to get an exact overview of the actions that got you your reputation. - A full list of all privileges granted at each reputation level on all sites.
|
I started making stock by boiling the turkey carcass, this was for my African pepper soup. It had been cooking for about an hour and then I was taken ill and had to turn it off so I could go to bed.It was in a pressure cooker and I sealed the lid on ,this was on Monday and it has been sitting at room temperature is it safe to carry on using it?
|
If I left food out of the refrigerator for some period of time, is it still safe? If I left it out too long, can I salvage it by cooking it more?
|
What is the different between following two methods of defining js function. I have seen this is some code some one given, but could not able to call the function inside of it. 1) function sum () { var i, sum = 0; for (i = 0; i < arguments.length; i += 1) { sum += arguments[i]; } return sum; }; 2) var sum = function () { var i, sum = 0; for (i = 0; i < arguments.length; i += 1) { sum += arguments[i]; } return sum; };
|
I've recently started maintaining someone else's JavaScript code. I'm fixing bugs, adding features and also trying to tidy up the code and make it more consistent. The previous developer used two ways of declaring functions and I can't work out if there is a reason behind it or not. The two ways are: var functionOne = function() { // Some code }; function functionTwo() { // Some code } What are the reasons for using these two different methods and what are the pros and cons of each? Is there anything that can be done with one method that can't be done with the other?
|
I have a list that will always contain an even number of elements and I want to iterate over this list to create a new list containing lists of each 2 consecutive numbers in the list. For example: first_list = [1,2,3,4,5,6,7,8] second_list = [[1,2], [3,4], [5,6], [7,8]] When I iterate over the list I cannot figure out how to select consecutive pairs. I've tried a million variations, and this is the closest that I've come. first_list = [1,2,3,4,5,6,7,8] second_list = [] pairs = 1 for item in range(len(first_list) - pairs): second_list.append([firs_list[item],first_list[item + pairs]]) print second list [[1, 5], [5, 7], [7, 6], [6, 2], [2, 3], [3, 4], [4, 8]] Is there some way that I have have the for loop iterate over every other item?
|
I have a list of arbitrary length, and I need to split it up into equal size chunks and operate on it. There are some obvious ways to do this, like keeping a counter and two lists, and when the second list fills up, add it to the first list and empty the second list for the next round of data, but this is potentially extremely expensive. I was wondering if anyone had a good solution to this for lists of any length, e.g. using generators. I was looking for something useful in itertools but I couldn't find anything obviously useful. Might've missed it, though. Related question:
|
So, today I have realized that free space on my desktop was suspiciously low (I had only about 60 GB free space). I have a 500 GB SSD and a 500 GB regular hard drive for back up. I don't have a ton of programs installed to start with. Regardless, I uninstalled some unused programs, did a disk cleanup, and cleared my downloads folder. Now, what is mind boggling is that I still have only about 100 GB empty space. If I grab everything in my C drive and check used space, it says 60 GB. I expect some discrepancy due to numerous reasons. But frankly, having 60 GB worth of files but 376 GB used space is confusing. Any help is greatly appreciated. Also this is my first time posting, so go easy on me :P Thank you.
|
How can I visualize which folders and files are taking up all of the space on my hard drive? I'm getting some conflicting reports on the size of hard drive contents. Namely what is and isn't there and what folders are actually using the space. I need to know which of the files or folders the culprits behind all this hidden bloat. Also there should be a print option to get it on paper.
|
Are booleans made pointers? I had this weird case: visited = [[False]*4]*4 visited[0][1] = True print visited >>> [[False, True, False, False], [False, True, False, False], [False, True, False, False], [False, True, False, False]] How do I avoid this? Thanks!
|
I needed to create a list of lists in Python, so I typed the following: my_list = [[1] * 4] * 3 The list looked like this: [[1, 1, 1, 1], [1, 1, 1, 1], [1, 1, 1, 1]] Then I changed one of the innermost values: my_list[0][0] = 5 Now my list looks like this: [[5, 1, 1, 1], [5, 1, 1, 1], [5, 1, 1, 1]] which is not what I wanted or expected. Can someone please explain what's going on, and how to get around it?
|
I've got a problem with my apt file sources.list. Whenever I'm trying to update or install something I keep getting this error and I don't know how to fix it. I tried using vi to remove the malformed line but it doesn't get deleted. E: Malformed entry 58 in list file /etc/apt/sources.list (Component) E: The list of sources could not be read. Thank you in advance.
|
I have unistalled and reinstalled the Ubuntu Software Center as per info I found in a similar thread and I got the same response about line 91 or something like that. I just tried to upload a screen shot but since I'm new it won't allow me to. I also can not figure out how to cut and paste anything so I have to hand type what the error screen says, both when I attempt to open the software center and nothing happens, when I try to enter commands into the terminal to uninstall, reinstall, whatever I get the same following: COULD NOT INTITIALIZE THE PACKAGE INFORMATION An unresolvable problem occured while initializing the package information Please report t:his bug against the 'update-manager' package and include the following error message: 'E: Malformed line 91 in source list/etc/apt/sources.list (dist parse) E: The list of sources could not be read., E: The package list of status file could not be parsed or opened. How do I report bugs? What can be done about this. I have searched and everything everyone says to do leads me back to the same line error message. So, I don't know how to get to line 91 in the source list; to tell you what it says. Sorry, I'm really new to this. That is what I need is to find out how to get there and fix what it says. I would really like to NOT have to re partition my hard drive and start from scratch, so I'm really looking forward to getting this problem solved. I need to be able to install new software.
|
I am trying to bake Different materials to one texture file. I tried a few tutorials on Youtube and followed a few guides here on this forum. How ever none of them are working for me. Everytime when I try to bake it is just black. If somebody could help me I would be very pleased! I am using Blenden 2.92 but I have also tried it on 2.8 and 2.79 I have include my model at my google drive.
|
Using: Blender V2.79 Cycles Render Engine After creating a complex interior scene consisting of 3 different texture types, each having 3 associated maps (Diffuse, Gloss, Normal) I noticed the texture and baking options will not successfully combine to create a texture for the exported mesh once I bring it into Unity 3D. The mesh is a single object with the different textures assigned to specified faces. I've played around with a default cube mesh for testing purposes, using the same 3 textures split among the 6 sides, but have only been able to successfully pull over the color info by baking a diffuse map to my UV and saving the image. When using the other baking options, Blender does not successfully create a map for either my Glossy textures, nor my normal map. Even using the "Combined" baking option, I am provided a flat dull diffuse image for my mesh, no gloss or normal info is saved. My Node process for textures is displayed here Here is the result of baking my textures as a Normal The result of adding other textures made from Blender's baking, results in flat gloss at best. What can I do differently in Blender, to have my assigned UV Diffuse, Normal, and Gloss maps all appear in a single object in Unity?
|
With the reference video below. How can i add shortcut key to screen & multiply. Any suggestion or help. Thanks
|
I am changing object opacity in Illustrator manually. Is there a keyboard shortcut to make an object's opacity 90%?
|
I am trying to unit test a function whose parameter is an exception. However, it seems that because the function only throws the exception and doesn't return in, I can't just feed a function and parameter that would throw an exception. How can I deal with this?
|
How can I use JUnit4 idiomatically to test that some code throws an exception? While I can certainly do something like this: @Test public void testFooThrowsIndexOutOfBoundsException() { boolean thrown = false; try { foo.doStuff(); } catch (IndexOutOfBoundsException e) { thrown = true; } assertTrue(thrown); } I recall that there is an annotation or an Assert.xyz or something that is far less kludgy and far more in-the-spirit of JUnit for these sorts of situations.
|
Let $\epsilon \in (0, 1)$, let $m$ be Lebesgue measure, and suppose $A$ is a Borel measurable subset of $\mathbb{R}$. If$$m(A \cap I) \le (1 - \epsilon)m(I)$$for every interval $I$, then does it follow that $m(A) = 0$?
|
Let $A\subset\mathbb{R}$ a measurable where $0<m(A)<\infty$. Show that exists for each $0<\alpha<1$ an interval $I$ such that $$ \frac{m(A\cap I)}{m(I)}>\alpha. $$ MY ATTEMPT: Following a hint a give that: Let $\varepsilon>0$, exists $G$, a open set such that $m(A)\leq m(G)<m(A)+\varepsilon$. As $G$ is open, we can write as the disjoint sum of open intervals $\dot{\bigcup}_n I_n = G$.So, $$ m(A)\leq m(G)=m\left(\sum \dot{\bigcup_n} I_n \right)\leq \sum m\left(I_n \right)<m(A)+\varepsilon $$ Suppose that $\varepsilon=(\alpha^{-1}-1)m(A)$: $$ m(A)+\varepsilon=m(A)+m(A)(\alpha^{-1}-1)=m(A)(1+\alpha^{-1}-1)=m(A)\alpha^{-1} $$ and $$ \alpha\sum m(I_n)<m(A)=\sum m(A\cap I_n) $$ $$ \Rightarrow \alpha<\frac{\sum m(A\cap I_n)}{\sum m(I_n)} $$ But I have a insecurity with that: (1) I can write that: $m(A)=\sum m(A\cap I_n)$? (2) How to get the result with this: $$ \alpha<\frac{\sum m(A\cap I_n)}{\sum m(I_n)} $$
|
I am having a hard time getting my delete button to remove an item dynamically. When I add a new ingredient the button appears but does not have functionality. $(document).ready(function () { getRecipe(); $(".btn-primary").on("click", addIngredient); $(".btn-default").on("click", deleteIngredient); }); var recipe = { title: "Pizza", servings: 4, ingredients: ["cheese", "sauce", "flour", "pepperoni"] }; var button = "<button type=\"button\" class=\"btn btn-default delete btn-xs\"><span class=\"glyphicon glyphicon-minus-sign\"></span></button>"; function getRecipe() { $("#title").append(recipe.title); $("#servings").append(recipe.servings); for (var i = 0; i < recipe.ingredients.length; i++) { $("#ingredients ul").append("<li>" + recipe.ingredients[i] + " " + button + "</li>"); }; }; function addIngredient() { var newIngredient = $(".form-control").val(); $(".form-control").val(newIngredient); $("#ingredients ul").append("<li>" + newIngredient + " " + button + "</li>"); }; function deleteIngredient() { $(this).closest("li").remove(); };
|
I have a bit of code where I am looping through all the select boxes on a page and binding a .hover event to them to do a bit of twiddling with their width on mouse on/off. This happens on page ready and works just fine. The problem I have is that any select boxes I add via Ajax or DOM after the initial loop won't have the event bound. I have found this plugin (), but before I add another 5k to my pages with a plugin, I want to see if anyone knows a way to do this, either with jQuery directly or by another option.
|
Let $ f : \mathbb R \to \mathbb R $ be such that $ f ( x + y ) = f ( x ) f ( y ) $ for all $ x , y \in \mathbb R $. If $ f $ is continuous at $ x = 0 $ then show that $ f $ is continuous on $ \mathbb R $. Also show that there exists a constant $ c \in \mathbb R $ such that $ f ( x ) = e ^ { c x } $ for all $ x \in \mathbb R $. Anyone please help me with the solution.
|
The asks about functions $f \colon \mathbb R \to \mathbb R$ such that $$f(x+y)=f(x)+f(y).$$ It is a very well-known functional equation, which appears in various areas of mathematics ranging from exercises in freshman classes to constructing useful counterexamples for some advanced questions. Solutions of this equation are often called . Also a few other equations related to this equation are often studied. (Equations which can be easily transformed to Cauchy functional equation or can be solved by using similar methods.) Is there some overview of basic facts about Cauchy equation and related functional equations - preferably available online?
|
In Harry Potter and the Half-Blood Prince, said prince turned out to be the inventor of the many advanced dark spells written in its margins, including Sectumsempra. How exactly did he do this? Was the process for how a spell is created for the first time (discovered?) ever elaborated on by Rowling?
|
In the Harry Potter series, are wizards capable of creating their own spells, or are they limited to the spells that they're taught/learn? I seem to remember something about Snape creating sectumsempra, but I'm not sure if that really is the case.
|
I'm not sure how to solve this one. Thank you! $2.$ For any $\alpha\in \mathbb R$ we define $$\lfloor \alpha \rfloor = \max_{n\in\mathbb Z}\{\,n\mid n\leq \alpha\,\}$$ and $$\alpha\bmod 1 = \alpha - \lfloor \alpha \rfloor$$ Let $\alpha$ be irrational. (a) Given $n\in\mathbb N$ show that $\{\,k\alpha\bmod1\mid k\in\mathbb N\,\}\cap\left[0,\frac{1}{n}\right]\neq\emptyset$ (b) Prove that $\{\,n\alpha\bmod 1\mid n\in\mathbb N\,\}$ is dense in $[0,1]$.
|
How to prove that the $\{$ fractional part of $n\alpha\mid n \in \mathbb{N}$ $\}$ is dense in $[0,1]$ for an irrational number $\alpha$. NOTICE that $n$ is in $\mathbb{N}$ Also notice that this is not a duplicate of the mentioned question as it does not carry a correct answer and the partially correct answer in the said question is given for integer multiple case, NOT for $n \in \mathbb{N}$
|
I have: $$\sum\limits_{k = 1}^{10}k\binom{10}{k}\binom{20}{10-k} = $$ and I know that it doesn't matter if $k = 0$ so it also equals: $$= \sum\limits_{k = 0}^{10}k\binom{10}{k}\binom{20}{10-k} = $$ and now it really reminds Vandermonde's identity so it's tempting to write: $$= \binom{30}{10} \cdot \sum\limits_{k = 1}^{10}k = \binom{30}{10} \cdot 10!$$ but it seems wrong because on smaller numbers the equations doesn't hold... What's the right way to continue in order to get an equivalent expression without sigma?
|
I still haven't quite realized how to solve binomial coefficient problems like this, can someone show me an elaborated way of solving this? I need to write this expression in a more simplified way: $\sum_{k=0}^{10} k \pmatrix{10 \\ k}\pmatrix{20 \\ 10-k}$ I'm aware of the binomial identity $\sum_{k=i}^{n-j}\binom{k}{i}\binom{n-k}{j}=\binom{n+1}{j+1}$ Just can't seem to see how to use it. Many thanks.
|
I cant install i-nex for the following reason: The following packages have unmet dependencies: i-nex : Depends: gambas3-runtime (>= 3.5.0) but it is not going to be installed Depends: gambas3-gb-image (>= 3.5.0) but it is not going to be installed Depends: gambas3-gb-qt4 (>= 3.5.0) but it is not going to be installed Depends: gambas3-gb-form (>= 3.5.0) but it is not going to be installed Depends: gambas3-gb-desktop (>= 3.5.0) but it is not going to be installed E: Unable to correct problems, you have held broken packages.
|
Occasionally, when I'm installing stuff, I get an error like the following: Some packages could not be installed. This may mean that you have requested an impossible situation or if you are using the unstable distribution that some required packages have not yet been created or been moved out of Incoming. The following information may help to resolve the situation: The following packages have unmet dependencies: package1 : Depends: package2 (>= 1.8) but 1.7.5-1ubuntu1 is to be installed E: Unable to correct problems, you have held broken packages. How can I resolve this?
|
So I have a Windows machine and a number of folders that I want to share my network. I've no problem mounting the folders and they have the correct permissions set in Windows. I'm mounting them using the following sudo mount.cifs '//WINDOWS_MACHINE/WINDOWS_FOLDER' /mnt/windows_folder/ -o uid-1000,gid=1000,username=$USRN,password=$PASS
|
Have reinstalled Ubuntu on my web dev server. On the old one I had an smbfs share setup to access a share over the local network to other Ubuntu boxes. It was setup using the following and worked fine - This time round I am using cifs-utils instead of smbfs, but I presume this is fine? Upon reinstalling the server I have been having issues making the files writable. Its mounted ok, and when from my local machine I ls -l it shows me write permissions (although from my local user), but when I goto create or save over a file it gives me a no permissions error Here is the line in my /etc/fstab. I had to make one change to be able to mount, and I added the ,sec=ntlmv2 option, without which I was getting mount error(13) //192.168.0.40/webserver /media/webserver cifs credentials=/root/.smbcredentials,sec=ntlmv2,iocharset=utf8,file_mode=0777,dir_mode=0777,uid=1000,gid=1000 0 0 and my credentials file (unchanged from when it was previously working) username=melon password=xxxxxxxxxxxx How can I fix it so that I have write permissions on my mount?
|
Upon entering sudo apt-get update in terminal, the following error is given: Reading package lists... Done W: The repository 'http://dl.bintray.com/aluxian/deb stable Release' does not have a Release file. N: Data from such a repository can't be authenticated and is therefore potentially dangerous to use. N: See apt-secure(8) manpage for repository creation and user configuration details. E: Failed to fetch http://dl.bintray.com/aluxian/deb/dists/stable/main/binary-amd64/Packages 404 Not Found E: Some index files failed to download. They have been ignored, or old ones used instead.
|
PPA seems to be constantly offline. Whenever I use sudo apt-get update, this error is shown: W: Failed to fetch http://ppa.launchpad.net/ 404 Not Found How do I fix these errors?
|
Nothing is showing up when I use the usual way of upgrading. Why?
|
I'm pretty new to running linux, but I know that 19.04 was released today and I wanted to upgrade from my current 18.10. However, when I follow the release notes here: I get the message "The software on this computer is up to date". I made sure that my update settings are set to "any new version" and "normal" in the /etc/update-manager/release-upgrades file. What am I doing wrong? Thanks for the help! Side note: I had to disable this PPA: because it would cause errors in apt updating. Do I need to re-add it? If so how do I do so without it giving me an error? Edit: I have followed the procedure recommended in the documentation which is identical to the suggested duplicate, but I am not given the option to upgrade. I have not yet tried the do-release-upgrade -d option as I don't want to upgrade to the developer version.
|
I don't know much about command prompt, or how it is used, but I want to get a code to access a program of mine and I wants me to open a .exe file with command prompt and input my ID so I can get the password. But whenever I input my ID, it shows the password just briefly and then the command prompt window closes instantly. Is there a way to access the .exe file and put my ID and get my password without the window closing? Thanks in advance! NOTE:I am running on a windows 10 software.
|
I know there were some tricks with older versions of windows to accomplish this, but not sure on windows 7. If I had a piece of software that executes a command with switches resulting in a cmd.exe window opening and closing quickly, how can I reconfigure the command prompt to NOT auto-close once the task is complete. The trick here is that the command being executed is indeed a batch file, includes a pause statement at the end, but the way the software is trying to execute the command is failing. Since it closes so quickly, we don't know what error is being returned since it closes so quickly.
|
My attempt: $1+\frac{1}{3}+\frac{1.3}{3.6}+\frac{1.3.5}{3.6.9}+\frac{1.3.5.7}{3.6.9.12}....$ =$1+\frac{1}{6}$.$2\choose 1$+$\frac{1}{6^2}$.$4\choose 2$+$\frac{1}{6^3}$.$8\choose 4$+.......+$\frac{1}{6^{n-1}}$.$2n-2\choose n-1$+........... But I am perplexed as to what should be my next step? Options: (A)$\sqrt{2}$ (B)$\sqrt{3}$ (C)$\sqrt{\dfrac{3}{2}}$ (D)$\sqrt{\dfrac{1}{3}}$ One edit $t_n=\dfrac{1.3.5.7.....(2n-3)}{3^{n-1}(1.2.3....(n-1))}$ $=\dfrac{(2n-2)!}{(6^{n-1}(n-1)!(n-1)!)}$ $=\dfrac{1}{6^{n-1}}$.$2n-2\choose n-1$ Is this going to help me?
|
How to find infinite sum How to find infinite sum $$1+\dfrac13+\dfrac{1\cdot3}{3\cdot6}+\dfrac{1\cdot3\cdot5}{3\cdot6\cdot9}+\dfrac{1\cdot3\cdot5\cdot7}{3\cdot6\cdot9\cdot12}+\dots? $$ I can see that 3 cancels out after 1/3, but what next? I can't go further.
|
how do I change the cursor size? I tried with dconf-tools but using dconf-tools to change the cursor-size number, it changes the cursor size in several kinds of windows, such as in firefox, gnome-terminal, pan, thunderbird. But when I use the nautilus or I look in desktop the size of the cursor is reverting back to high. I use Ubuntu 14.04 trusty. And as desktop environment I use "Gnome classic"
|
My cursor seems too small to me (due to 4k screen), i want to make it bigger, i've tried using dconf-editor(org.gnome.desktop.interface-cursor size) and unity-tweak-tool(larger option) none of them worked. By the way i know that i must restart (or log out) my computer to activate the new size. My ubuntu is 14.04, i've also tried downloading 3 custom cursor theme (krakin, pure-glass and ecliz) all of them are small and i can't make them bigger, I'm kind of new to ubuntu Any help appreciated ^^
|
I want a regex for the following string: For more: [Click here](https://www.google.ca) and [click me](https://www.google.com) For that My current regex is as follows. /\[.*\]\((((https?\:\/\/)|(www\.))(\S+))/ig Give me the regex with that I can find two different links in the same line. Right now I am finding 1 combined regex for both of them.
|
I have this gigantic ugly string: J0000000: Transaction A0001401 started on 8/22/2008 9:49:29 AM J0000010: Project name: E:\foo.pf J0000011: Job name: MBiek Direct Mail Test J0000020: Document 1 - Completed successfully I'm trying to extract pieces from it using regex. In this case, I want to grab everything after Project Name up to the part where it says J0000011: (the 11 is going to be a different number every time). Here's the regex I've been playing with: Project name:\s+(.*)\s+J[0-9]{7}: The problem is that it doesn't stop until it hits the J0000020: at the end. How do I make the regex stop at the first occurrence of J[0-9]{7}?
|
One of my e-commerce sites with daily product uploads has sitemap listed has below. Recently we notice that google index rate has slowed down. <url> <loc> http://urllink </loc> <lastmod>2016-07-22</lastmod> <changefreq>daily</changefreq> <priority>0.5</priority> </url> Could it be because our automatically generated site map structured, wherein lastmod date is being shown as the previous date every day i.e. it tells google that this product has been changed the previous day when in fact it hasn't been. Does that mean Google will expend resources, try to see what has changed and if it hasn't changed it probably will starting assigning lower priority to our site and hence we run the risk of our more recently added products not being indexed. We also have a feeling that this lastmod date error is probably eating a lot of our server resources too. Hope that was clear. Thanks
|
I've got a sitemap that is generated daily with a lot of links to product pages. These products are imported daily from another data source. Because the update consists of throwing away all current product info and replacing it with the new imported info the last modified date always jumps one day. This is also used in the sitemap. Even for products that haven't changed. All product pages pretend to have been updated. Will Google penalize the website for pretending the pages have changed from day to day while they haven't? My solution would be to only change the entry only if the new imported product data differs from the previous data. I just want to make sure this is a useful upgrade to make, while I could also spend my time on other improvements.
|
I haven't read the novel, I am just basing the question off of what I saw in the movie. Don Corleone orders Luca Brasi, one of his most trusted muscle men, to infiltrate the ranks of a rival family and gain their trust and information. The opposing family would have surely known about Luca, and his strong affiliation with the Corleone's. Any word otherwise would be laughable, given the circumstances. He is not a particularly smart man, and by no means is he well spoken. We see him preparing a very short speech, for a relatively long time, and then fumbling over his words wishing the Don and his daughter good tidings on her wedding day. I see Luca as more of a loyal meathead/hitman than a cunning spy, so I feel like this was either an exceedingly dumb move by Don C, or he wanted Luca out of the picture for reasons that are beyond me. Why did Don Corleone essentially send Luca Brasi to sleep with the fishes?
|
Can anyone tell me why Vito would send Luca to Tattaglia's night club under the ruse of being a traitor in The Godfather? The relationship between Vito and Luca must have been well known in the mob community and Vito would have known that. Are you going to tell me that Vito didn't consider the fact that Tattaglia wouldn't buy that his story of being unhappy with the family? If Vito is as sharp as they would have us believe, why then would he send his most trusted soldier to his death? I believe this is a flaw in the plot.
|
I find that these two words can be used to express to collect or gather. what is the difference between them? thank you in advance.
|
I'm having a hard time understanding the real distinction between and . accumulative adjective tending to accumulate or arising from accumulation; cumulative. tending to accumulate wealth; acquisitive. cumulative adjective increasing or growing by accumulation or successive additions: the cumulative effect of one rejection after another. formed by or resulting from accumulation or the addition of successive parts or elements. of or pertaining to interest or dividends that, if not paid when due, become a prior claim for payment in the future: cumulative preferred stocks. These definitions (and those from other dictionaries as well) say different things but I can't understand how they aren't really meaning the same thing. Yet, when thinking about it, it seems there are some cases where it is distinctly more correct to use one or the other. What's the difference, practically?
|
Normally we use definite article when we want to talk about something known or specific, but I noticed that always people used to put a definite article before superlatives even when they are talking about something generally. For example: "The best quality of gold can be found in the most of the countries". and I'm wondering what's wrong for example with: Best quality of gold can be found in most of countries ? Is it always necessary to use definite article before superlatives? No exceptions? If there are examples for not using definite articles when using superlatives I'd like to know about them. For example, can I say I am happiest. He is fastest. She is friendliest. without using definite article?
|
For example: I could not face being alone again and losing the person dearest to me. I wonder why there is no "the" in front of "dearest".
|
creating a scene in the beginning was easy because i could zoom in all i wanted in order to do model the mesh, but after i place more objects i reach a point where it is hard to move around in the model space because it would slow down to a stop, also i cant just rotate my view and zoom into an object. I was wondering if i can change this. I've seen that by pressing "." i can zoom into the mesh, yet i would like to know if theirs another way so that i wouldn't have to do this every time. I've also tried changing the navigation auto depth on and off in preferences. (currently using Blender 2.8)
|
I often find that I can zoom in to a point, but then cannot zoom any more, even when there is a lot of room to zoom to the meshes on the scene. This is particularly annoying in the following scenario: I often land up left clicking on the scene and the 3D cursor shifts there. I use Shift+C to shift the 3D cursor back to the origin. However, this also centers the view on the cursor and shifts the view to show all objects, and sometimes this zooms things way out – at this point, if I try to zoom in, I can zoom in to a point (using the pinch/zoom on trackpad), but then it stops zooming in. How do I zoom in after that? Is there anything else I am doing wrong in this case?
|
Let's say I have 4 plants and I measure something under 2 conditions. For example: The entries in the table show how many times I saw something under condition (C1 or C2) for plant (P1, P2, P3 or P4). P1, P2, P3, P4 C1 0 20 0 19 C2 100 80 180 150 Now I would like to answer the question "what is the probability that these 39 times of seeing something is unevenly distributed between these 4 plants"? I am much interested in observation like this, rather than, say: P1, P2, P3, P4 C1 25 20 15 19 C2 100 80 180 150 Is it right to use Fisher's exact test for this? I just extended the question from a 2*2 table to 2*4.
|
I am working on 4 different plants. I have the (RNA-Seq) data from sequencing. I look for two events E1 and E2, say, at certain positions in their genome. Let's say E2 is the common one and E1 is a special event. The positions I look for are identical across all 4 (in the genome). And let's say I see that the observation I have for 1 particular position is: P1 P2 P3 P4 E1 0 20 0 17 E2 100 80 100 120 Here, P1 through P4 refers to plants and E1 and E2 refers to the events. E2 is more common. So, my objective is to actually check if E1 occurs more often in one or more plants than in the others. If they occur at the same proportion in all, of course it is not interesting to me. I have 2 questions: (I have already asked before but didn't get an answer) Will a fisher test be right for this problem? I hypothesize (Null) that the proportion of E1 is not different in occurrence between the 4 plants. Now, I set out to find if the proportion I have here is by any means significantly different. I use R, fisher.test() and I get p-value=2.5e-10. So, I reject my Null hypothesis for this case because I find strong evidence against it. Sometimes, I have an observation like this, P1 P2 P3 P4 E1 0 20 0 17 E2 0 80 0 120 then fisher.test() gives me a p-value of 0.147. So, I don't reject the Null hypothesis. However, from a biological point of view, I would consider this significant. However fisher test answers the question I originally asked. I guess the proportion 0/0 for P1 and P3 are not useful (or not used). So, my question is: Is it possible to modify the test such that it is sensitive even if E1 and E2 are 0 in 1 or more plants for a particular observation? Having thought a bit to frame this post, I guess, in that case I have to ask a different question.
|
When I use this command : > chm <- grid_canopy(gro, 1, pitfree(c(0,2,5,10,15), c(0,1), subcircle = 0.2)) Processing [-------------------------------------------] 0% (1/341) eta: 8mError: filename exists; use overwrite=TRUE I have an error because the file exist. How can i add the overwrite argument to grid_canopy because when i use this command : chm <- grid_canopy(gro, 1, pitfree(c(0,2,5,10,15), c(0,1), subcircle = 0.2, overwrite = TRUE) I receive this error : Error in grid_canopy(gro, 1, pitfree(c(0, 2, 5, 10, 15), c(0, 1), subcircle = 0.2), : unused argument (overwrite = TRUE)
|
I have a small issue with configuring the lidR for parametrizing the extracted raster files with grid_metrics() function. My question is how to set in the catalog options that: be able to overwrite the results with a second run if I want to run my script several times and I do not want to name each output differently. instead of .tif I would like to get .grd files as output. My current code (which is working) is the following: normalizedctg = catalog(workingdirectory) opt_output_files(normalizedctg) <- paste(workingdirectory,"/clipped/normalized/{XLEFT}_{YBOTTOM}_height",sep="") height = grid_metrics(normalizedctg, max(Z),res = resolution) But with a second run on the same code I get the following error: Error in .getGDALtransient(x, filename = filename, options = options, : filename exists; use overwrite=TRUE
|
I wonder, is there an Exchange site that treats mobile phones and mobile phone technologies in general ? I did a quick check and found there are Exchange sites for Windows phone, Android and Apple. However, I am interested in more general questions about technology, development and industry of the phone area. Discussion and site recommendation please, thank you.
|
I know about , but from all indications it is all about computer hardware. Is there any Stack Exchange site where I can ask questions about problems on my phone?
|
I have the following code: // Creates ArrayList with integers 0-9 ArrayList<Integer> intKeys = new ArrayList<Integer>(); for (int x = 0; x < 10; x++) { intKeys.add(x); } // Creates iterator with integers 0-9 Iterator<Integer> allKeys = intKeys.iterator(); // Loops 10 times, each time obtaining a key to remove from the ArrayList for (int x = 0; x < 10; x++) { Integer key = allKeys.next(); intKeys.remove(key); } I understand that ConcurrentModificationException is thrown if an element of a collection is removed while the collection is being looped over, such as: for (String key : someCollection) { someCollection.remove(key); } but right now I'm looping over nothing - just an arbitrary number of times. Furthermore, the error line is interestingly Integer key = allKeys.next(); What could be the cause of this exception?
|
We all know you can't do the following because of ConcurrentModificationException: for (Object i : l) { if (condition(i)) { l.remove(i); } } But this apparently works sometimes, but not always. Here's some specific code: public static void main(String[] args) { Collection<Integer> l = new ArrayList<>(); for (int i = 0; i < 10; ++i) { l.add(4); l.add(5); l.add(6); } for (int i : l) { if (i == 5) { l.remove(i); } } System.out.println(l); } This, of course, results in: Exception in thread "main" java.util.ConcurrentModificationException Even though multiple threads aren't doing it. Anyway. What's the best solution to this problem? How can I remove an item from the collection in a loop without throwing this exception? I'm also using an arbitrary Collection here, not necessarily an ArrayList, so you can't rely on get.
|
Thermal energy is the energy an object due to the motion of it's molecules. This means as long as an objects molecules have kinetic energy, it will not reach absolute zero. Does that mean if there was a complete vacuum(no molecules or waves inside the vacuum at all), it would be at absolute zero inside the vacuum because there is no molecules, meaning they can't have kinetic energy, and theirs no radiation to heat the space. So I was thinking it would be absolute zero in a complete vacuum.
|
Why is absolute zero considered to be ? Wouldn't regions such as massive gaps between galaxy clusters have temperatures of absolute zero? I just do not see why our model must work the way that it does. I mean there have to be regions with no thermal energy out there, the universe is massive.
|
I'm trying to figure out all the possible right ideals of $M_{n\times n}(\mathbb{F})$. I know that the two-sided ideals are only the trivial ones, and the proof uses the fact that we can operate on the rows and line of a matrix to make $E_{ij}$ - the matrix that has one in ij and zero in the rest of it. Does anyone have any idea(l)? Thanks.
|
What are the left and right ideals of matrix ring? How about the two sided ideals?
|
For example, in a hanging massless rope, or in a massless rope hanging over a frictionless pulley, the tension must be the same at all points, because otherwise there would be a net force on at least one tiny piece, and then $F = ma$ would yield an infinite acceleration for this tiny piece. What happen if the tension is different at some point?How it yields an infinite acceleration?
|
Suppose I have an Atwood machine, that is, two different masses connected with an inextensible, massless rope over a pulley. Assuming no friction between the rope and the pulley, the heavier mass will accelerate towards the ground, the lighter mass will accelerate towards the pulley, and the rope will accelerate towards the heavier mass. These three accelerations will be equal in magnitude. But this makes no sense to me. Force causes acceleration. But there is no force acting on the rope. And even if there was, the acceleration of the rope would be infinite because its mass is 0. So why does the rope accelerate? And how can the magnitude of this acceleration be finite?
|
I am confused at a very trivial point about the BatchNorm. For illustrations it is a widely used graphics that BatchNorm corrects the distribution of incoming values. To calculate mean, does it average through a batch for each neurons separately or does it average both in 2 dimensions (batch & layer width)? For example, if I zero some of the neurons after BatchNorm, does this spoil the output distribution or doesn't it since each neuron has its own zero-centered distribution already? (Assuming trainable weight and scale parameter is not used.) In other words, are the mean and variance unique to a layer, or do we calculate mean & variance for each single neuron in a layer?
|
While implementing Batch Normalization for a particular layer 'L' with 'n' hidden neurons/units in a Neural Network, we first normalize the Activation values of that layer using their respective Mean and Standard Deviation, and then apply the Scaling and Offset factor as shown: X-norm = (X - mu)/sd X' = (Y * X-norm) + B where mu = mean of X and it is a (n,1) vector sd = standard deviation of X and it is also a (n,1) vector X = Activation values of layer 'L' with dimension (n,m) if mini-batch size = m X-norm = normalized X with dimension (n,m) Y = Gamma / Scaling factor B = Beta / Offset factor Now my question is, what are the dimensions of Gamma and Beta ? Are they (n,1) vectors or are they (n,m) matrices ? My intuition says that since they somewhat are analogous to the Mean and Standard Deviation, they should be (n,1) vectors.
|
Let $\mathbb {S} =\left \{ 1,2,3,...,9,11,12,...,19,21,...99,111,112,113... \right \} $ i.e, the positive integers set which contain zero digit is omitted. Now show that $ \sum_{n\in \mathbb {S}} \frac{1}{n} $ is convergent . I really don't have no idea about how to prove this
|
I'm working on the following contest math problem: Define an evil number to be any positive integer that contains the digit $9$. Show that $$ \sum_{x} \frac{1}{x} < 80 $$ where the sum is over all non-evil positive integers $x$. I'm very confused on where to begin. Initially, I tried to consider this sum as part of the sum of $1/x$ over all positive integers, namely by noting that $$ \sum_{n=1}^{\infty} \frac{1}{n} = \sum_{x} \frac{1}{x} + \sum_{y} \frac{1}{y} $$ where the first summation on the right side is the same as in the problem statement and the second is the sum over all evil numbers. However, I can't seem to find a way to use this since the sum of the left diverges. Could anyone lend a helping hand?
|
I have seen these on my floor several times now that spring has arrived and temps have started to go up. It is silvery in color, appears to have a hard and segmented shell, it kind of reminds me of a lobster. They are very small, the dark line in the picture is the grout between two tiles on my floor for scale. I am guessing it is about three quarters of a centimeter in length. I am in Utah.
|
I am in Portugal (Lisbon) at the moment, and when leaving my room late at night (12 pm ~ 04 am) I usually face about 4 of these arthropods in the corridors: (For reference, the "line" in the image is a standard separation on the floor. This particular example of the animal is a little smaller than a nail.) They seem to have quite variable sizes and walk primarily on ground. Also, as implicit above, they seem to be active primarily during the late night. (I don't see them much often, if at all, during the morning/afternoon.) They can be quite fast, but if left unharmed do not move much. They also appear to take shelter inside the walls. From what I searched, it seems possible that they are centipedes. I've seen sites saying that they are useful to keep other less pleasant animals at bay. My questions are: What are those animals, and should I leave them be or not?
|
console.log(undefined !== null);//true console.log(undefined == null);//true I can't undestand why undefined !==null,but i know undefined == null,because The language specification : If x is null and y is undefined, return true
|
I'm using to go through JavaScript, and it's returning many suggestions to replace == (two equals signs) with === (three equals signs) when doing things like comparing idSele_UNVEHtype.value.length == 0 inside of an if statement. Is there a performance benefit to replacing == with ===? Any performance improvement would be welcomed as many comparison operators exist. If no type conversion takes place, would there be a performance gain over ==?
|
I have been asking this questions to a few native English speakers but none have given me a satisfactory answer, and it has been bugging me for so long. What is the English word for the flavor that found in green fruits like green bananas or green persimmon? The closest I have found is bitter, but if you have eaten those 2 fruits, you would know it is not bitter. In Vietnamese we say “chát”, which when put in Google Translate it came out as “acrid” but the explanation doesn’t sound right, so here I am asking this.
|
There are some fruits* that cause a peculiar (unpleasant) numb sensation in the mouth. An unripe or a are two examples that come to mind. I can't describe the feeling any more eloquently so my bet/hope is that you will know what feeling I am talking about. Is there a word in English that describes the mentioned quality of these fruits and/or the sensation in the mouth? *I don't know that only fruit can cause it, but I can't think of anything else at the moment.
|
Given $n+1$ control points, B-spline blending functions are polynomials of degree $d-1$, $(1<d\leq n+1)$. This much is easy to comprehend. Now comes the part I am not able to make any sense of. Each polynomial function is defined over $d$ subintervals of the total range of $u$. The selected set of subinterval endpoints $u_j$ is referred to as a knot vector. What is the purpose of knot vector? What is its physical significance?
|
A B-spline blending curve formulation is: $P(u)=\sum_{k=0}^np_k B_{k,d}(u)$ Given $n+1$ control points, B-spline blending functions are polynomials of degree $d-1$, $(1<d<=n+1)$. This much is easy to comprehend. Now comes the part I am not able to make any sense of. Each polynomial function is defined over $d$ subintervals of the total range of $u$. The selected set of subinterval endpoints $u_j$ is referred to as a knot vector. What is the purpose of knot vector? What is its physical significance?
|
I have written down a code to show myself how I can use templates. My class is in an .h file and my classdefinition is in an .cpp file. Following content is in the .h file: template <class T> class one { private: T data; public: one(); one(T s); T two(); T getData(); }; Content of the .cpp file: #include <iostream> using namespace std; #include "template.h" template <class T>one<T>::one() { } template <class T> one<T>::one(T s) { } template <class T> T one<T>::two() { return 0; } template <class T> T one<T>::getData() { return 0; } with the following file I try to indicate the object of the class one: int main() { one<string> * s = new one<string>; return 0; } Now I got following compiler error: /tmp/cchK1XpI.o: In function main': templatetest.cpp:(.text+0x1c): undefined reference toone::one()' collect2: error: ld returned 1 exit status I tried to understand where the wrong reference is but cant find it. (I tried it aswell with type int and the same error showed. So if anyone have a solution for this please share it with me!
|
Quote from : The only portable way of using templates at the moment is to implement them in header files by using inline functions. Why is this? (Clarification: header files are not the only portable solution. But they are the most convenient portable solution.)
|
Is it possible in apt/apt-get to install a package and only some of its recommendations? For example: I want to install kde-plasma-desktop which recommends sddm, but I don't want to install sddm. What I do want is to install the rest of the recommended packages. Is there any way of doing this with apt?
|
I want to install xfce4-goodies but I don't want Midori Browser. With --no-install-recommends I don't know how to specify only Midori. I want the rest of packages. How to do that? Thanks!
|
any help/explanation is appreciated (i know this is such a newb question but nonetheless) when I try to "sudo apt update" the command fails on one "link" (Failed to fetch 403 Forbidden [IP: 143.95.32.90 80] ) why is that? did the apt update command complete successfully? does this have anything to do with updating repositories in /etc/apt/sources.list? Thank you in advance for any help folks, greatly appreciate any feedback.
|
PPA seems to be constantly offline. Whenever I use sudo apt-get update, this error is shown: W: Failed to fetch http://ppa.launchpad.net/ 404 Not Found How do I fix these errors?
|
I am having an issue with getting a Scanner to read what is actually used as an input. I have looked at every response that I could find to other people on this site, and have not yet found anything that works for the problem. I have written a test code that returns the result of a previous if/else statement so that I can try to find where the problem may be. I think that the scanner is only temporarily storing my input as a string, and then it becomes some other datatype. public static String goAgain(String r) { if (r == "y") { return "y"; } else { System.out.println("Goodbye."); return "n"; } } public static void main(String args[]) { Scanner repeat = new Scanner(System.in); System.out.print("Are you ready? "); String again = repeat.next(); String user_response = goAgain(again); System.out.println(user_response); // (also tried System.out.prinln(again); } What should happen is when the user inputs the letter y, the letter y should be returned to the goAgain method. What actually happens is something else ends up being inserted, and it returns something other than the letter y, and so prints "Goodbye" and the letter "n" to the console. Also, when the variable again is printed instead of user_response, it prints the letter y.
|
I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug. Is == bad? When should it and should it not be used? What's the difference?
|
I have recently installed nemo with: sudo apt-get install nemo But I am finding that other applications still are using nautilus to open folders like for instance the Unity search still opens its search results and folders in nautilus. So is there any way that I can get it to use nemo as default (at least the search)? OS Information: Description: Ubuntu 14.10 Release: 14.10 Package Information: Nautilus: nautilus: Installed: 1:3.10.1-0ubuntu15.1 Candidate: 1:3.10.1-0ubuntu15.1 Version table: *** 1:3.10.1-0ubuntu15.1 0 500 http://gb.archive.ubuntu.com/ubuntu/ utopic-updates/main amd64 Packages 100 /var/lib/dpkg/status 1:3.10.1-0ubuntu15 0 500 http://gb.archive.ubuntu.com/ubuntu/ utopic/main amd64 Packages Nemo: nemo: Installed: 2.2.4-1 Candidate: 2.2.4-1 Version table: *** 2.2.4-1 0 500 http://gb.archive.ubuntu.com/ubuntu/ utopic/universe amd64 Packages 100 /var/lib/dpkg/status
|
I installed Ubuntu 12.10, then installed Nemo. Now I would like to make Nemo the default file manager. I've searched the web for a solution but every time I restart my computer Nautilus come back. Does anyone know an effective solution?
|
How can I find a number of files in a folder, assign it to a variable, then echo that variable, all in one command line?
|
I have a directory with a large number of files. I don't see a ls switch to provide the count. Is there some command line magic to get a count of files?
|
I installed Ubuntu 20.04 six Months ago and my Issue is, I installed Ubuntu with custom partition schema (created partitions myself) as this: My Partition Table And Because I do development (and curious to test OSS projects usually), 20GB in the /home is not enough and very often I have to move things around to other partitions which obviously gonna delete them soon because I just experimenting with'em anyway. I seperated /home and /root just because if I messed up smth in the system my personal files will be safe (hopefully). I wanted to be to shrink the /root partition which is ~260GB in order to increase /home which is 20GB partition, but it seems impossible as the data in /root is stored in the beginning of the partition so I can't grow the /home partition. Hence, I read about that, Linux systems use files as swap nowadays, I thought I could delete that partition but also afraid of losing data if I grow the /home partition in the beginning. I thought that no place is better to ask! if there is another option to move the data far from the beginning so I can resize the partitions at either side safely?
|
Previously, I have installed Windows 7 on my 320 GB laptop with three partitions 173, 84 and 63 GB each. The 63 GB partition was where the Windows was installed. The rest were for file containers. Now I changed my OS to Ubuntu 12.04 LTS. I installed Ubuntu by replacing the entire Windows 7 on the 63 GB partition. The rest of the partitions remain as an NTFS Windows partition and I can still access them both (the 173 and 84 GB partitions). Now I want to change the two partitions of Windows into an Ubuntu format partitions plus most importantly, I want to extend the 63 GB partition to more than a 100 GB because at the moment I am running out of disk space. Whenever I try to install any application, especially using wine, it always complains for a shortage of disk space. How do I do the extending activity before I entirely format my laptop again and lose all the important files on my partitions?
|
I'm using jQuery with SharePoint 2013, and have to get the table Id to add an attribute. The table Id is {44C80A95-F3E4-40DA-9A97-50CADFFFED61}-{DD02CEA7-CC2B-4E4A-A725-86E82C6D11FC} When I use: jQuery("#{44C80A95-F3E4-40DA-9A97-50CADFFFED61}-{DD02CEA7-CC2B-4E4A-A725-86E82C6D11FC}").attr("width","100%"); It gives me this erro: Uncaught Error: Syntax error, unrecognized expression: #{44C80A95-F3E4-40DA-9A97-50CADFFFED61}-{DD02CEA7-CC2B-4E4A-A725-86E82C6D11FC} The problem is with the "{". How to solve this problem?
|
When creating the id attributes for HTML elements, what rules are there for the value?
|
I'm looking for airline ticket prices, and since my route around Europe is essentially one big circle, it doesn't really matter where I start. I just want to find the cheapest tickets that will get me to Europe. Is there a way to look for airline prices for City ABC to Europe? Or City ABC to a list of any of these 30 destinations? (The choice of 30 was arbitrary, but I was thinking of pooling a list of all capitals or major cities in my route and including all the airports within, say, a 25 mile radius of each of those cities). As of now, I'm just doing city by city and it's making it difficult to compare prices.
|
Several airline and trip planning sites will allow you to check "I am flexible with my dates" or a similar option. Is there any way to also search more broadly for location? For example, if you wanted to leave from YYZ or YKF and arrive at any airport in California, can a search for such flights be done somehow? I ask because when I plan plane trips, I want the lowest price. I'm OK with leaving a day or two later if I save $200 (same with the return trip). There are 3 airports within 80 km of me, I'll leave from the one with the cheapest flight. And I'm also OK with changing the trip to spend time exploring San Francisco instead of lying on the beach near San Diego, and that sort of thing. Normally this would take dozens of searches, but I'd like to see it all at once.
|
That's all they give you. I tried putting it into the linear approximation equation of: $$ f(a)+f'(a)(x-a) $$ but I get almost the same value as $64.07^{2/3}$, which is around $16.0116$. Just not sure how else to go about doing this problem. Thanks. Here's the problem. I'm doing this online and it comes back as incorrect. I've tried nearly every possible solution to this (16.0117, 16.0116, 16.012, 16, 16.1, etc.) Is there a specific solution to this? Thanks.
|
That's all they give you. I tried putting it into the linear approximation equation of: $$ f(a)+f'(a)(x-a) $$ but I get almost the same value as $64.07^{2/3}$, which is around $16.0116$. Just not sure how else to go about doing this problem. Thanks.
|
When looking at a suggested edit that only changed the title, but not the body of the question, the review page will always show the current body and not what the body has been at the time of that edit. For example only changed the title. As I wasn’t happy with what was done, I went to the question, and , changing both the title and the question body. However, when you look at the suggested edit, you can see the body I was editing in after the suggested edit. So the suggest edit does not really reflect the actually made changes.
|
Yesterday I was pointed at some rejected suggested edits. Some of the corrections were valid, so I edited the posts accordingly, while making several further edits. Looking at the suggested edits now however, it seems that for those posts where only changes to the title were originally suggested, the post mortem suggested edit view now incorporates the body of the latest revision. (Or at least it appears like that to me) Take for example . If you take a look at of that post, you will see my later edits. The edited body seems to have been incorporated in the suggested edit view. For edits where originally changes to the body were suggested, there is no such confusion. Why does this matter? In the case of some post mortem discussions or explanations it might help to see the actual situation as it was when the edit was suggested. Especially in the case of edits that might be considered too minor. So have I stumbled upon a bug here?
|
Occasionally, I have inline math in my text (e.g., $Y^{(0)}$). This will make the line on which it appears taller and introduce an extra space between that line and the previous one. This has the undesired effect of making that line stand out. The solution is to use \smash{$Y^{(0)}$} instead. But I don't want to have to do this manually for all the inline math that I have. So, is there a way to \smash everything by default? I.e., I want my line height to be fixed and not adjust to things like $Y^{(0)}$.
|
Often when typesetting mathematics, one wants to use math symbols in line. When these are certain symbols, or more often, decorated symbols, whose height is sufficiently large, the line spacing (that is, the space between the current line and the previous one) is increased in order to compensate for the height of the symbol. A usual example is $\widetilde{f}$, for instance. I would like to stop this from happening, even if it leads to possible overlap of symbols between the two lines. Is this possible? Another one that will certainly induce a lineskip increase is \overset{\alpha}{\to}. I would also like this not to induce a lineskip increase. If it is relevant, I am using XeLaTeX with unicode-math and the Lucida fonts, but I would very much prefer a general solution, as I encounter this problem with computer modern (and the $\widetilde{f}$) as well.
|
The share button for Twitter on Area 51 looks dated, and none of the buttons are retina display optimized. An itch to scratch would be to switch the "t" to a bird and/or retinize those images.
|
A variation of the old (really old) Twitter logo is being used in various places on Area51 when sharing is involved: This goes against (which have been in place for at least 4 years now), which state: USAGE GUIDELINES / IT’S A BIRD, NOT A PLANE The Twitter marks represent the core values of our brand, from meaningful connections in real time to simple amplified expression. Please don’t present the marks in a manner that suggests sponsorship or endorsement by Twitter, or confuse Twitter with another brand. Always use our official and unmodified Twitter logo to represent Twitter. Don't ... Use older versions of the logo, previous logos, or any marks that may be confused with the brand
|
everyone I'm stuck on this proof. I know that $\gcd(a,bc)=\gcd(a,b)\cdot \gcd(a,c)$ but I don't know how I use $\gcd(b,c)=1$ to get that $\gcd(a,bc)=\gcd(a,b)\cdot \gcd(a,c)$
|
Let $a,m,n\in\mathbf{N}$. Show that if $\gcd(m,n)=1$, then $\gcd(a,mn)=\gcd(a,m)\cdot\gcd(a,n)$. Proof: Let $u,v\in\mathbf{Z}$ such that $\gcd(m,n)=um+vn=1$. Let $b,c\in\mathbf{Z}$ such that $\gcd(m,a)=ab+cm$. Let $d,e\in\mathbf{Z}$ such that $\gcd(a,n)=ad+en$. So $\gcd(a,m)\cdot\gcd(a,n)=a^2bd+cmen+aben+emad$. Where do I go from here?
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.