B Defining an operation such that ##1+2+3=123##

  • B
  • Thread starter Thread starter Saracen Rue
  • Start date Start date
Saracen Rue
Messages
150
Reaction score
10
Firstly, I'm aware that title doesn't really make sense but stick with me on this. I'm trying to find a way to define an operation which will "join" two numbers instead of adding them. So for example, ##12+34=1234##. Ideally, it would be great if it also had something similar to sigma notation, like so:
$$\sum_{k=1}^{n} k= 12345...n$$

I'm sure this is actually something trivial that has been defined before, but I was finding it really difficult to search it up on Google (apparently "addition but instead of adding numbers just clomp together" doesn't yield very good results). So yeah, if anyone can tell me a better way to name this sort of maths it'd be greatly appreciated.
 
Mathematics news on Phys.org
This is called concatenation. You often have to program this kind of operation for strings or text.
 
  • Like
Likes berkeman, fresh_42, jedishrfu and 2 others
In computer languages, this is often done but there is no standardized symbol that would be universally recognized in other fields. Since C++ is such a well-established language, it might be the best thing to mimic. It uses the plus '+' symbol. The trick would be to distinguish it from numerical addition. Consider using quotes to make it clear that you are treating the number as a text string: "12"+"34"="1234".
If this is to appear in a document, you should clearly define your notation and symbology in the document.
 
I suppose you have \oplus : \mathbb{N}^2 \to \mathbb{N} : (a,b) \mapsto \begin{cases} 10^{1 + \lfloor\log_{10}(b)\rfloor}a + b, &amp; b \neq 0, \\ 10a, &amp; b = 0\end{cases} which (if it does what I think it does) is associative but not commutative, and you need to decide whether <br /> \bigoplus_{n=0}^N a_n means a_0 \oplus a_1 \oplus \cdots \oplus a_N or a_N \oplus a_{N-1} \oplus \cdots \oplus a_0.
 
  • Like
Likes malawi_glenn and PeroK
In some computer languages, the addition operator took on different meaning dependent on the datatypes of items being added. It acted as normal addition for numeric types and as a concatenation operator for string types.

There were some purists who complained that since concatentation is not commutative that the addition operator shouldn't serve that function. However, using the addition operator for concatenation had become a defacto standard and was here to stay.

In Python, one can concat in several different ways:

- string1 + string2
- " ".join(string1, string2)
- ...

https://www.geeksforgeeks.org/python-string-concatenation/

and here's a larger set of multi language string concatentation examples:

https://en.wikipedia.org/wiki/Comparison_of_programming_languages_(string_functions)#Concatenation
 
  • Like
  • Informative
Likes berkeman, PeroK and FactChecker
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top