Is there a way to convert the code below to have a dot added between the numbers it puts out? I'm not trying to use an algorithm or foreign library. I'm trying to continue my python knowledge with the built-in modules first  print(list("😀".encode("utf-8")))
What would be your preferred way to concatenate strings from a sequence such that between every two consecutive pairs a comma is added. That is, how do you map, for instance, ['a', 'b', 'c'] to 'a,b,c'? (The cases ['s'] and [] should be mapped to 's' and '', respectively.)  I usually end up using something like ''.join(map(lambda x: x+',',l))[:-1], but also feeling somewhat unsatisfied.
Adjectives or compound noun? Proving $\int_0^1 \frac{(\ln(x))^5}{1+x} \mathrm{d}x = -\frac{31\pi^6}{252}$ I would like to show the following identity:     $$\boxed{ I :=  \int_0^1 \dfrac{(\ln(x))^5}{1+x} \mathrm{d}x = -\dfrac{31\pi^6}{252} }$$     Here is what I tried. The change of variables $u=1/x$ yields $$I= \int_1^{\infty} \dfrac{(\ln(x))^5}{1+1/u} \dfrac{1}{u^2} \mathrm{d}u = \int_1^{\infty} \dfrac{(\ln(x))^5}{u^2+u} \mathrm{d}u$$ Then $z=u-1$ gives $$I = \int_{0}^{\infty} \dfrac{(\ln(z+1))^5}{z^2+3z+2} \mathrm{d}z $$ with $z^2+3z+2=(z+1)(z+2)$. I wanted to use contour integration like , but I was not sure how to proceed in this case. Anyway, the computations of the residues (of which "well-chosen" function? Maybe something like ?) seem to be difficult.  I believe that we can generalize to $\frac{(\ln(x))^n}{1+x}$, or maybe even more (e.g. $\frac{(\ln(x))^n}{ax^2+bx+c}$). Related computations are: , , , .  Thank you for your detailed help. What is the CVE-2014-6271 bash vulnerability (Shellshock) and how do I fix it? Recently, there have been news going around regarding "CVE-2014-6271" (See ), which is a vulnerability in Bash. How do I know if I am affected by this, how can I fix it, and why should I care?  This is designed as a canonical answer for this vulnerability, due to its scope and severity. if $a,b$ are nilpotent elements of a commutative ring $R$, show that $a+b$ is also nilpotent What are the taxation rules for US non-resident aliens with respect to qualified dividends? Are the rules different for qualified versus non-qualified dividends? Assuming no DTAA exists between the US and the country of residence. Can anyone can suggest where I can freely download ArcObjects SDKs for ArcGIS?  I am using version 10.2. How can I delete my account? How can I delete my Stack Exchange account(s)? Also,  What happens to my content? Can I request it be deleted as well? What if I'm suspended, rate-limited, or banned from posting questions or answers? What will happen to my votes? Will other users be impacted? Why wasn't my account deleted immediately after the timer expiring? What will happen to my pending bounties and close, reopen, delete, or undelete votes? I want my account deleted on all Stack Exchange sites. How do I do this? Will my profile on chat be removed once I delete my site account?   For more information, see &quot;&quot; in the . How does one write on the outside of a circle?  I am looking for sample files/packages which imitate a magazine lay-out. Specifically a page with two columns having a circular picture between the two columns.    Example of the desired layout, created using Word: Ubuntu on 32-bit UEFI (only) based tablet pc I've created a bootable USB of Ubuntu 16.04 64-bit with Rufus, setting the drive to be a GPT for UEFI. Then I booted my tablet PC and I ran the UEFI BIOS, from which I turned secure boot off. I then restarted and went again on the BIOS to boot from my key, but all I got was a black screen that lasted few seconds and then it brought me back to the BIOS. I read about a bootia32.efi file and other procedures that can be followed, but I didn't find a good explanation of what I need to get done. My tablet PC runs an Intel Core Atom Z3735F and has 2 GB of RAM. If you have the answer please let me know. Limit $\lim_{n\to \infty} \frac{1}{2n} \log{2n\choose n}$ Run Metro application on startup? I want to know where the Metro applications (Mail, People, Messages, ...) executable file path is.  Also, how can I run Mail application when my PC starts? How do I troubleshoot a Windows freeze or slowness? A machine is described as being "really slow" or "freezing". How can I troubleshoot/resolve this issue? What should be the first steps to take? How to make a char string from a C macro's value? For example, how to avoid writing the 'func_name' twice?  #ifndef TEST_FUN #  define TEST_FUN func_name #  define TEST_FUN_NAME "func_name" #endif   I'd like to follow the  rule.  Version of C preprocessor:  $ cpp --version cpp (GCC) 4.1.2 20070626 (Red Hat 4.1.2-14) How to know if my servers should use jumbo frames (MTU) I have just discovered that my local bank, Nordea, has decided to remove the only good thing about their entire operation: the so-called "simplified login" feature on their website, which allows (soon allowed) the customer to log in to a kind of very limited "read-only" mode which basically just allowed you to see your current balance, the last few transactions (limited descriptions) and see whether or not there are any new "customer support messages", but not read those messages, not make any kind of payments, edit accounts, etc.  Now, they will only allow "full" logins, which 100% prevents any kind of automation and requires you to sit with a hardware device and enter numbers into it and then into the webpage before it allows you to see as much as your account balance. Other than being very obnoxious for every customer, it also blocks me and other "advanced" users out from our custom-programmed bots which have always regularly logged in with that "simplified" login method just to regexp out the current balance/new messages and then notify us via whatever mechanism we use privately.  I have previously asked them if they have any kind of JSON/RSS API of any kind, but no. They don't even have as much as e-mail notifications! Nothing except their spyware "smartphone app" which I would never install, nor would I ever allow such a surveillance device to track me 24/7 in the first place. Only by being a registered corporation with special, way more costly account types do you get any kind of "API" access from them, even to do this most basic imaginable task.  Before you tell me to switch banks, the others are at least just as bad (even worse from what I can tell, and for a longer time), and the act of switching banks is practically impossible for me personally.  What I'm asking is if maybe somebody knows of some sort of "hidden standard" or something which all banks in the world support, but don't have documented, for people like me to automate basic things such as knowing my account balance. Needless to say, I have looked for this countless times on their website, asked them about it, and asked other people about it. Nobody seems to know anything, or, if they do, won't tell me.  I know that there are a bunch of "Nordea-supporting" PHP libraries and whatnot on Github, but they are all ancient and even if they were up to date, they were most likely using the same method as I have been using: automating the login process through their "simplified login" mechanism, which is "soon" to be gone. (Probably at new year; they didn't even mention any dates or time frames.)  And yes, I have a Bitcoin wallet and have that fully automated. The problem is that virtually nobody else in the world cares about my Bitcoin, so "switching to Bitcoin" remains a pipe dream which I would be ready to do, but the world clearly isn't. Countable axiom of choice: why you can't prove it from just ZF This is a follow-up question to the discussion about the finite axiom of choice .  Suppose we have a countable collection of non-empty sets $\{A_1, A_2, A_3,\cdots\}$ Reasoning as indicated in that discussion, we can prove the existence of a choice function $c_n$ such that $c_n(i)$ belongs to $A_i$ for $i = 1,\cdots,n$  Again reasoning as suggested and using induction, we can prove the existence of a function $C$ defined over $\{1, 2, \cdots\}$ such that $C(n)$ is a choice function defined for $i=1,\cdots,n$ with $C(n)(i)$ an element of A_i. We can require in addition that $C(n)(i)$ and $C(n-1)(i)$ are equal for $i=1,\cdots,n-1$.  Now it would it seem that we can prove the countable axiom of choice by taking the union of $C(1)$, $C(2)$, $\cdots$  The question is as follows: why is that proof wrong? I suspect the answer may have something to do with the axiom of union. When I reinstall Windows XP by mistake I deleted all five partitions. I did not format them yet though.  How can I recover the partitions? When I attach the hard disk to another PC it just says that the partition is unformated and asks "Would you like to format it?". A movie about artificial intelligence gone rogue Why does Linux require that a user be root/using sudo/specifically authorized per mount in order to mount something? It seems like the decision as to whether to allow a user to mount something should be based on their access rights to the source volume/network share and to the mount point. A couple of uses for non-root mounting are mounting file-system images to a user owned direction and mounting a network share to a user owned directory. It seems like if the user has control over both sides of the mount equation everything should be cool.  Clarification of access restriction:  I feel I should be able to mount anything that the user otherwise would have access to to a mount-point that the user is the owner of.  For instance, on my computer /dev/sda1 is owned by user root and group disk with permissions brw-rw----. Therefore non-root users can't mess with /dev/sda1 and clearly mount shouldn't allow them to mount it. However if the user owns /home/my_user/my_imagefile.img and mount point /home/my_user/my_image/ why shouldn't they be able to mount that image file on that mount point with:  mount /home/my_user/my_imagefile.img /home/my_user/my_image/ -o loop   As kormac pointed out there is a suid problem. So some restrictions would have to be added to prevent suid from being a problem as well as potentially some other issues. Perhaps one way to do this would be to make the OS treat all files as belonging to the user that did the mounting. However for simple read/write/execute, I don't see why this would be a problem.  Use case:  I have an account in a lab where my home space is restricted to 8GB. This is tiny and very very annoying. I would like to mount an nfs volume from my personal server to essentially increase the amount of room that I have. However, because Linux does not allow such things I'm stuck with scp'ing files back and forth to stay under the 8GB limit. Exploiting JavaScript's eval() method