I am attempting to rescue files from a broken system via the root terminal of the recovery console.  I have a seagate 2TB external hard drive.  Output of sudo fdisk -l:  /dev/sdb1 is the device boot HPFS/NTFS/exFAT is the system   Everytime I try to copy files to the hard drive via:  sudo cp [file] /media/Expansion\ Drive   I get:  cp: cannot create regular file `/media/Expansion Drive/[file]' : Read only file system   I have tried:  sudo chmod -R 775 /media/Expansion\ Drive sudo chmod -R 777 /media/Expansion\ Drive   and  sudo chmod a+rwx -R /media/Expansion\ Drive   and for each command, the output is:  chmod:  changing permissions of `/media/Expasion Drive': Read-only file system   So I'm at a loss.  I've tried searching for more help, but the majority of solutions that I have found involve using nautilus of some other GUI and I am unable to access those resources because I can only access from the recovery console root shell  Please help! The crash seemed spontaneous and I was unable to back up my current project... Any help would be greatly appreciated.
I want to copy any file to my external hard drive. But always when I tried to do this I have next output:  cp: cannot create regular file /media/NameOfCard/[file]' : Read only file system  I also tried:  sudo chmod -R 775 /media/NameOfCard sudo chmod -R 777 /media/NameOfCard   But the same effect - ... Read only file system  Update:   After mount I have next output:  nazar_art@nazar-desctop:~$ mount /dev/sda1 on / type ext4 (rw,errors=remount-ro) proc on /proc type proc (rw,noexec,nosuid,nodev) sysfs on /sys type sysfs (rw,noexec,nosuid,nodev) none on /sys/fs/fuse/connections type fusectl (rw) none on /sys/kernel/debug type debugfs (rw) none on /sys/kernel/security type securityfs (rw) udev on /dev type devtmpfs (rw,mode=0755) devpts on /dev/pts type devpts (rw,noexec,nosuid,gid=5,mode=0620) tmpfs on /run type tmpfs (rw,noexec,nosuid,size=10%,mode=0755) none on /run/lock type tmpfs (rw,noexec,nosuid,nodev,size=5242880) none on /run/shm type tmpfs (rw,nosuid,nodev) /dev/sdb1 on /media/sdb1 type vfat (rw) binfmt_misc on /proc/sys/fs/binfmt_misc type binfmt_misc (rw,noexec,nosuid,nodev) gvfs-fuse-daemon on /home/nazar_art/.gvfs type fuse.gvfs-fuse-daemon (rw,nosuid,nodev,user=nazar_art)   Any suggestions?   How to solve this trouble and let permission to copy and delete files to hard drive?
how to fix ioctl permissions denied error? I searched in lots of websites/forums but did not find a solution for this problem, and this site is last chance, this is problem: This problem have several other users too. my phone is Galaxy S7 Edge , exynos, Oreo 8.0 (Stock ROM), rooted with magisk latest version. root works well in other applications. In pentesting applications like csploit, Network Spoofer, WifiKill and others  root works well(grants permission)  but when start using options of app(for example, arp spoofing, network sniffer, MITM, etc) drops same error: [ERROR] Unable to retrieve local hardware address libnet ( ioctl: Permission denied ) what to do? Can this issue fixed? or exactly which permission is it?  Also one interesting thing, when I installed old version of WifiKill app it worked - killed wifi connection. Where's the BIOS on an Intel Mac? Why don't planets have Circular orbits? Insert a paragraph into a list that uses the whole text width Basic mathematical induction regarding inequalities These are just the examples from my textbook, but I don't think it did not explain well.  One of the problem was to prove the inequality   $$n&lt;2^n$$  for all integers $n$.  I understand we assume if $P(n)$ is true, $P(k+1)$ is true.  Thus $k+1&lt; 2^{k+1}$  But in the text book, they added one more line that I don't understand:  $$k+1&lt;2^k+1 \le 2^k+2^k=2\cdot2^k=2^{k+1}$$  I understand  $$k+1&lt;2^{k+1}$$  But how do I know $2^k+1$ is larger than $k+1$, and smaller than $2^{k+1}$?  I have one another example just in case,  proving $2^n&lt;n!$ using induction.  $$2^{k+1}=2\cdot 2^k&lt;2\cdot k!&lt;(k+1)k!=(k+1)!$$  I understand we should start with $2^{k+1}&lt;(k+1)!$, but  Where did $2\cdot k!$ come from? Textbook says it came from inductive hypothesis, but I still don't get it.  Please advise. Is it safe to give out one's bank account number? I'm managing the utility of the house and I'm sharing with another person. He asks me to provide my bank account number, so that he can transfer his money to my account when paying the utility.    I wonder if it is safe to give out my bank account number?   For example, if I'm correct, many online payments just need the account number to draw money out of it. Is giving out the bank account number safer than handing a check to another person, since there is also the account number printed on the check? I am from Bangladesh, and I have an Indian tourist visa, which I received from the Indian High Commission in Bangladesh. At this moment I am in Bhutan. Now I want to enter India by air. Is it possible? And will I face any problems when I come back from Kolkata to Dhaka? Show that the square of any prime number is the Factof of some integer I'm having a really, really hard time figuring out how to install mods on Minecraft. I've looked everywhere I can think of for help but the information is almost always outdated or unhelpful.  I've seen on several sites about the use of something called Forge. The Mod I want to use requires 1.6.4 Forge and I have both Forge and the Mod folders sitting in my downloads folder.  I haven't installed any kind of mods for any game prior to this and I have little clue to the technical side of Minecraft, so please keep this in mind when you give me an answer please!  Things that might help you figure out how to help me:   I want to play this mod  and am using the 1.6.4 Forge given on a link that website gives How to find real world Selenium projects Where can I find sample or real Selenium projects. All the material I can find on github and on internet are basic, and never intermediate or advanced.  How does a real Selenium project look in real life? How can I find sample code? I've seen $d(xy) = y(dx) + x(dy)$, but I don't understand the principle behind it and memorizing it is lame.  Can anyone explain what is going on here?  For example from physics, $$F = {{dP} \over {dt}}$$ $$F = {{d(mv)} \over {dt}}$$ $$F = {{v(dm) + m(dv)} \over {dt}}$$ Since $$dm = 0$$  $$F = {{m(dv)} \over {dt}}$$ Since $$a = {{dv} \over {dt}}$$ $$F = ma$$ Why didn't Dumbledore just hunt Voldemort down? sed append after a line containing multiple unordered strings I'm trying to use sed to append appendstring after a line that contains both Hello and World.  Hello something here World World fsf Hello   This works if I do consider order:  sed -i '/Hello*World\|World*Hello/a appendstring' file   But if I have many strings to match and they are not in order, this is definitely not effective.  Then I tried solutions from another link which discussed deleting a line that contains both strings without considering their order.     However,  sed -i '/Hello/!b;/World/d' file   This does not even work for deletion.   The following one, also one of the answers to that question:  sed -i '/Hello/{/World/d}' file   works, so I tried to implement it to append. Using:  sed -i '/Hello/{/World/a} appendstring' file   But received error:  sed: -e expression #1, char 0: unmatched `{'   Update: The post in the link stated the solution with !b, and it was not working in cshell because of the exlamation mark, but it is working in sh and bash. And it can also be easily extended to inserting many lines when running sed inside a script and the appending a large paragraph.  sed -i '/Hello/!b; /World/a \ addline \ addanotherline ' file How do I determine the result of a Saving Throw? I'm a pretty new player, and I'm building a bard in D&amp;D 5e. I understand how saving throws work in general, but I am a little confused about one thing. Say I cast Blindness/Deafness on a humanoid. They must then make a Constitution saving throw. My question is: what value do they have to roll in order to make the save? Does their roll (plus their constitution modifier) have to beat my constitution (plus my modifier)? This is more of a general player question than one specific to the Bard or that spell. Product of pairwise coprime integers divides $b$ if each integer divides $b$ Let $a_1....a_n$ be pairwise coprime.  That is $gcd(a_i, a_k) = 1$ for distinct $i,k$, I would like to show that if each $a_i$ divides $b$ then so does the product.  I can understand intuitively why it's true - just not sure how to formulate the proof exactly. I want to say if we consider the prime factorizations of each $a_i$, then no two prime factorizations share any prime numbers.   So the product of $a_1...a_n$ must appear in the prime factorization of $b$.  Is this correct?  Or at least if if the idea is correct, any way to formulate it more clearly? 9 rows is just way too small by default. Is this a text-editor for ants? How do I install software using the Ubuntu Software Center? The title says it all. I'd like to know how I can install software - an example is the Chromium web browser. Gnome-shell seems to like to leave one monitor as "fixed" when you switch workspaces.  Additionally, there is no preview in the Activities view of my secondary monitor.  Also, on the second monitor, where there should be either empty desktop space, or a copy of the panel, I just have a white bar.  How can I get gnome-shell to treat my secondary monitor like the primary one? Why does an environment's label have to appear after the caption? How come Dropbox gets an icon in Finder sidebar?