After editing both /.bashrc and /etc/bash.bashrc the path is not in the environment. Why?
What is the purpose of .bashrc and how does it work?
How to find max of amount of opportunity related to account? I have a below requirement : I need to find maximum amount on related opportunities and to display on account. Ex: suppose I have account A1 and A1 have 5 opportunities with amount o1=>100 o2=>500 o3=>300 o4=>1000 o5=>50 on my account i should have max_opportunity_amount =1000.  I have written below trigger ,but  I am not sure what to do further  trigger maxOppAmountonAcc on Opportunity(after insert){      map&lt;id,Opportunity&gt; oppMap = new map&lt;id,Opportunity&gt; ();     set&lt;Id&gt; oppId = new set&lt;Id&gt;();     for(Opportunity o : Trigger.new)     {         oppMap.put(o.accountId,o);         oppId.add(o.id);     }       List&lt;Account&gt; accList = new List&lt;Account&gt;();      for(Account a : [Select id ,MaxOppAmount__c,(select id,max(amount)  from opportunities) from Account where id in : oppMap.keyset()])     {      }  } The coefficient of kinetic friction can be calculated using $\mu_k = F_k/F_n$. A change in angle does not affect the normal force, but doesn't a change in angle affect the friction? As in if the angle is steeper, wouldn't the object have a greater propensity to move down the slope, thus there will be less friction? Do lure modules and incense cause new pokemon to spawn near you, or existing pokemon to be drawn to you? How to show that the monomials are not a Schauder basis for $C[0,1]$ why the monomials are not a Schauder basis for $C[0,1]$?  $p_n(x)=x^n$ such that $(p_n)$ does not form a Schauder basis for $C[0,1]$  span$\lbrace p_n : n\ge 0\rbrace$ is dense in $C[0,1]$ by Weierstrass approxmation theorem, but I cannot figure out why they are not a Schauder basis.  Could you please explain ${!FOO} performs a double substitution in bash, meaning it takes the (string) value of FOO and uses it as a variable name. zsh doesn’t support this feature.  Is there a way to make this work the same in bash and zsh?  Background:  I’ve got a list of environment variables, like  PATH MAIL EDITOR   and want to first print the variable names and afterwards their values.  This works in bash but not zsh:    for VAR in LIST do         echo $VAR         echo ${!VAR} done   It should be somehow possible “the old way” with eval, but I can’t get it to work:  for VAR in LIST do         echo $VAR         echo `eval \$$VAR` done   I’m never going to understand why I can’t simply do arbitrary deep substitutions like ${${VAR}} or even ${${${VAR}}} if need be, so an explanation for that would be nice, too. Why can't I change the permissions of files I have access to? Where in the file system are applications installed? I have installed a few Android applications both with the adb install MyApplication.apk command and via a webserver (like an alternative to Android Market).  But where in the Android file system on my phone is the MyApplication.apk file placed? Are applications installed with adb install not placed in the same directory as applications downloaded from the Market?  I found some applications on /system/app but I can't recognize them as some downloaded from Android Market or the one I have installed with adb install.  Where on the system is applications that I have installed located?  My phone is not rooted, and I am running Nexus One with Android 2.2.1. What levels-up Psi-abilities? Sum of real numbers that multiply to 1 I've seen a question in my math book with this explanation above it: "If the product of n positive real numbers is 1, then the sum of these numbers must be more than n". I was wondering if this is correct, and if it is, could someone give an explanation or a proof for it? A pitcher contains $X + 1$ blue balls and $Y + 1$ red balls. It is known that $X, Y$ are independent random variables, and it is given that $X \sim \mathrm{Poisson}(n), Y \sim\mathrm{Poisson}(2n)$. Calculate the limit: $\displaystyle\lim_{n\to \infty}\mathbb P (X + n = Y) $   I tried to condition on the value of $Y$ and to use the Law of total probability but it did not lead to a solution. ( I tried to sum: $ \sum_{i=0}^\infty\mathbb P(X+n=Y|Y=i)\mathbb P(Y=i) $ and get an expression that I can calculate its limit as n goes to infinity) Cardinality of the Cartesian Product of Two Equinumerous Infinite Sets Is the cardinality of the Cartesian product of two equinumerous infinite sets the same as the cardinality of any one of the sets? I couldn't find this explicitly stated in any handout or text. This certainly seems to be true from the examples I have seen:  The Cartesian product of two infinitely countable sets is again infinitely countable. The Cartesian product of two sets with cardinality of continuum again has cardinality of continuum. Where should I copy-paste-install software to? I'm installing IntelliJ, and the readme tells me to choose an installation folder. Where is a good, standard place to put installed programs? Restoring original Settings Menu in QGIS customization? Making some tests in Windows XP for customizing a user interface in QGIS 1.8 (see ), I have unchecked, among other options, the Settings Menu. This means that, after restarting QGIS, there's no way of recovering the older settings because there is not already a Setting Menu. So, I cannot reload any ini file.  For your information, as a precaution, previously I have saved in a folder both the original ini file, with all the options, and the customized ini file with only some options (of course, not included here the necessary Settings Menu).  Before reinstalling QGIS (version 1,8), I would like to try other smarter options if there's any. Where and what does QGIS look at where this applications starts? How to calculate the difference between two dates using PHP? I have two dates of the form:  Start Date: 2007-03-24  End Date: 2009-06-26   Now I need to find the difference between these two in the following form:  2 years, 3 months and 2 days   How can I do this in PHP? I have recently upgraded Ubuntu 19.10 to latest LTS Ubuntu 20.04. After updating, I get serious artifacts on my screen. Every time I reboot (or log-in), my screen is fuzzy or scrambled (picture attached):     This is temporary. The fuzzy screen goes away when I change the background. But it reappears the moment I reboot or log back in.   I have Intel HD Graphics 520 (Skylake GT2).  The output of lspci -nn |grep -E 'VGA|Display' is:  00:02.0 VGA compatible controller [0300]: Intel Corporation Skylake GT2 [HD Graphics 520] [8086:1916] (rev 07)   Update:   On enabling Wayland in Ubuntu 20.04 and logging in to, these artifacts are however cured.   This is okay for now, but I am not sure about Wayland as I have not yet used it before.   Is there a way to correct the graphic issue with normal Ubuntu startup? Spy from Earth studies Galactic Empire nobility and prevents plot to depose Emperor How do I remove diacritics (accents) from a string in .NET? I'm trying to convert some strings that are in French Canadian and basically, I'd like to be able to take out the French accent marks in the letters while keeping the letter. (E.g. convert é to e, so crème brûlée would become creme brulee)  What is the best method for achieving this? I have a list of tuples like this:  [ ('a', 1), ('a', 2), ('a', 3), ('b', 1), ('b', 2), ('c', 1), ]   I want to iterate through this keying by the first item, so, for example, I could print something like this:  a 1 2 3 b 1 2 c 1   How would I go about doing this without keeping an item to track whether the first item is the same as I loop around the tuples? This feels rather messy (plus I have to sort the list to start with)... Where are the save files in Skyrim? Find all $x$ such that $x^6 = (x+1)^6$. Find all $x$ such that $$x^6=(x+1)^6.$$   So far, I have found the real solution $x= -\frac{1}{2}$, and the complex solution $x = -\sqrt[3]{-1}$.  Are there more, and if so what/how would be the most efficient find all the solutions to this problem? I am struggling to find the rest of the solutions.