More specifically, what is in the nature of these particles that they carry a charge, and thus repel objects of similar charge and attract those of opposite charge?  Also, why would the charge of an electron and proton have the same magnitude???  Could it be that there are infinite universes, and yet only those where these particles have the same charge could atoms form, and allow enough order for an observer to ask these questions?  This question is different from others about the origin of charge in that it is directly querying about the multiverse theory, and whether this is a possible consequence.
This is something that has long bothered me, and I have asked a few physicists and chemists and never gotten a very satisfying answer. Why are particles charged? And I'm not asking (and this is the answer you often get) why some molecule might be negatively charged because the answer to that is simply is that there was one more negatively charged particle than positively charged particle. That doesn't answer my question, however, of why there are charged particles at all?  So, on a fundamental level, what makes one particle charged and another one neutral.  For instance, protons and neutrons have almost exactly the same mass, which I'm assuming that means they have very similar internal compositions, yet one is positively charged and the other neutral. What is going on that makes these particles different?  On a similar note, and I'd really like to know this, how is it that a proton and an electron have exactly equal and opposite charge, yet an electron is about 1000 times less massive than a proton?  I have particular trouble with this question because if the answer were something along the lines of "particle X which composes protons all have partial positive charges of n amount..." I would just ask why particle X has any charge and we'd be in the same predicament.  I'm sure there is a satisfactory answer to my question, I just can't find it and don't know what resources are reliable or detailed enough to be satisfactory.
For starters I am using this GREAT answer to achieve custom post types as well as a custom way to insert those post types into other pages, you can view that answer here:   I am running into a problem however when wordpress auto saves itself, it clears whatever metadata i have put into the forms.  EXAMPLE:  I select the 3 drop downs I want from my metabox and hit update.  The page reloads and the 3 choices are still selected.  In phpMyAdmin i can look up the metadata and see the array in place as it should be.  I now wait for wordpress to auto save.  As soon as this happens i can either refresh the page (not update, just refresh) and the metadata is lost, or i can look up the metadata in phpMyAdmin and it will display nothing (ie: its gone).  I'm guessing that this has something to do with needing to tie into another hook (some sorta auto update hook) or something, but even then it doesn't make sense that it would actually delete your metadata (rather than just not auto updating it).  Last note: If you copy and paste Mikes code into functions.php, you should be able to recreate my error (in wordpress 3.1) very easy. I am having trouble proving the statement:     Let $$S = \{m + n\sqrt 2 : m, n \in\mathbb Z\}$$ Prove that for every $\epsilon &gt; 0$, the intersection of $S$ and $(0, \epsilon)$ is nonempty. In SQL Server 2005, are there any disadvantages to making all character fields nvarchar(MAX) rather than specifying a length explicitly, e.g. nvarchar(255)? (Apart from the obvious one that you aren't able to limit the field length at the database level) So we have something like:  \documentclass{article} \setcounter{secnumdepth}{2} \setcounter{tocdepth}{2} \usepackage{amsmath}  \begin{document}  \tableofcontents  \section{Brushless Motor Fundamentals} \subsection{Brushless Motor Operation} \subsubsection{DC Motor Operation} Torque is generated in DC motors from the magnetic force, also known as the Lorentz force, which is produced when an electric current is passed through a coil in a magnetic field. This force is given by $F=q[E+(v\times B)]$, where $F$ is the force perpendicular to the coil, $E$ is the electric field in the coil, $B$ is the magnetic field, and $v$ is the velocity of the charged particles in the coil. From mechanics, torque is $\tau=F\times r$.  \section{Brushless Motor Fundamentals 2} \subsection{Brushless Motor Operation} \subsubsection{DC Motor Operation 2} If the electrical force is ignored and the remaining magnetic force is used, with the assumption that $v$ is perpendicular to $B$, we find that $\tau=qvBrsin\theta$.  \end{document}   How to show subsubsections and paragraphs in TOC? For $a,b,c&gt;0$, Find $$ \lim_{n \to \infty}\left(\frac{a^{1/n}+b^{1/n}+c^{1/n}}{3}\right)^n$$  how can I find the limit of sequence above?  Provide me a hint or full solution. thanks ^^ Introduction to string theory How to write conditional equations with one-sided curly brackets I want to write a conditional expression such as the following.    What is the best way to express such conditional expressions in Latex? Why are my JavaScript objects equal to Proxy {} Wake screen after scheduled task wakes computer Find all values of a for which $\{v_1,v_2,v_3\}$ form a basis for ${\bf R}^3$ Why could the dwarves only enter Erebor with the secret passage? Please bear with me as I've never read any of the LOTR books or the Hobbit, only seen the movies so far...  But when the sunlight fades and the dwarves think they've lost their only chance to enter Erebor using the secret passage and the key, they turn around to head home. Why is it that the dwarves would be unable to enter Erebor the way they did years ago, using regular doors to get inside? I'm assuming that's how they entered Erebor years ago? Do electrons in an electron beam (cathode ray) follow the ? Or in other words, does the Pauli exclusion principle apply for the beam of electrons? How to alter touchpad settings on Ubuntu GNOME 16.04? After upgrading to Ubuntu GNOME 16.04 with GNOME 3.20 I have found that if I tap my touchpad it clicks which is something I do not want due to a faulty touchpad, previously I was able to disable this through the gnome-control-center, but seemingly there is no way to do this any more through there, so how do I do it? Also, even though it is set to false in gsettings and the dconf-editor seemingly for some reason somewhere in the system it is also set to true as it is behaving as such. I am also unable to set natural scrolling or any of the other touchpad settings seemingly, why not? Solve $x^2+5x+6 \equiv 0 \pmod{\!11\cdot 17}$ Solve $x^2+5x+6 \equiv 187 \mod 187$ Solution $$x^2+5x+6 \equiv 187 \mod 187$$ $$ (x+\frac{5}{2})^2 \equiv \frac{1}{4}$$ $$ 4(x+\frac{5}{2})^2 \equiv 1$$ $$ y:= x+\frac{5}{2} $$ $$ 4y^2 \equiv 1 \mod 11 \wedge 4y^2 \equiv 1 \mod 17  $$ $$ ( 2y \equiv 1 \mod 11 \vee 2y \equiv 10 \mod 11 ) \wedge ( 2y \equiv 1 \mod 17  \vee 2y \equiv 13 \mod 17)  $$ $$ ( y \equiv 6 \mod 11 \vee y \equiv 5 \mod 11 ) \wedge ( y \equiv 9 \mod 17  \vee y \equiv 15 \mod 17)  $$ Combining that from CRT I got: $$ y \in \left\{49, 60,83,94 \right\} $$ and for example: $$ x+\frac{5}{2}  \equiv 94 \mod 187$$ $$ 2x  \equiv 183 \mod 187$$ some calculus and get... $$x \equiv 185 $$ And the same thing for each other case. Question Is there any faster (or smarter) way to solve equations like that? Let $f$ and $g$ be continuous at $ x=a$, with $f(a)<g(a)$. Prove that there exists a neighborhood $I$ of a such that $f(x)<g(x)$ for all $x \in I$. I've switched from Drupal 7.14 to 7.15 three weeks ago and therefore, I'm encountering a series of very sophisticated (for me) memory limit errors.  Those errors occur any time I'm trying to clear cache in performance or to run update scripts.  My hosting company has increased my memory limit in php.ini up to 126 M, 256 M, 512 M, and even 1024 M. But the errors still occur. I've migrated my site from shared to VPS, But the error incredibly still occurs. I have no way and no idea how to move forward.   Here are the errors:   Fatal error: Allowed memory size of 536870912 bytes exhausted (tried to allocate 30 bytes) in /home/example/public_html/sites/all/modules/views/views.module on line 416 Fatal error: Allowed memory size of 536870912 bytes exhausted (tried to allocate 108 bytes) in /home/example/public_html/includes/menu.inc on line 2736 Fatal error: Allowed memory size of 536870912 bytes exhausted (tried to allocate 71 bytes) in /home/example/public_html/sites/all/modules/chain_menu_access/chain_menu_access.module on line 59 allocate 64 bytes) in /home/example/public_html/sites/all/modules/views/includes/base.inc on line 93 Data   I want operator users on this machine to mount their own cifs shares The sudoers file already contains the /bin/mount -t cifs //*/* /media/* -o username=* command for all operators I want the users to mount a cifs share through a script typing the password only once, not twice. The sudo password and the cifs password are identical.   What I already have  This script works:  #!/bin/bash sudo 'mount -t cifs //192.168.1.1/home /media/$USER/home -o username=$USER'   ...but it requires the users to type the same password twice!     Once for sudo Once for the mount itself   This would also work:  #!/bin/bash echo -n Password:  read -s szPassword echo $szPassword | sudo -S sh -c 'echo $szPassword | mount -t cifs //192.168.1.1/home /media/$USER/home -o username=$USER'   ...but this would require me to allow all operator users to be able to sudo sh (major security problem)  Question  How to mount a cifs share in bash¹ without putting sh in the sudoers file nor creating a permanent/temporary file???  Note 1: no python, perl, C, Go, ... please? Note 2: I know I can just remove the password through the sudoers file, but I'm trying to tighten security, not loosen it, without giving up convenience... How is the Integral of $\int_a^bf(x)~dx=\int_a^bf(a+b-x)~dx$ Can Some one tell me what this method is called and how it works With a detailed proof   $$\int_a^bf(x)~dx=\int_a^bf(a+b-x)~dx$$  I've been using this a lot in definite integration but haven't seemed to have realized why it is true.  But whatever it is it always seems to work.  Basically a proof of how it is always true. Appropriate data transformation Proving $\sum_{k=0}^n(-1)^k\binom nk=0$