中文
相关论文

相关论文: The Binary Mole

200 篇论文

The binary Euclidean algorithm is a variant of the classical Euclidean algorithm. It avoids multiplications and divisions, except by powers of two, so is potentially faster than the classical algorithm on a binary machine. We describe the…

数据结构与算法 · 计算机科学 2013-03-13 Richard P. Brent

A natural number is a binary $k$'th power if its binary representation consists of $k$ consecutive identical blocks. We prove an analogue of Waring's theorem for sums of binary $k$'th powers. More precisely, we show that for each integer $k…

数论 · 数学 2018-01-16 Daniel M. Kane , Carlo Sanna , Jeffrey Shallit

In this paper, we study the number of representations of a positive integer $n$ by two positive integers whose product is a multiple of a polygonal number.

数论 · 数学 2017-09-20 Hao Zhong , Tianxin Cai

Fixing the value of Avogadro's constant, the number of atoms in 12 grams of carbon-12, at exactly 84446886^3 would imply that one gram is the mass of exactly 18x14074481^3 carbon-12 atoms. This new definition of the gram, and thereby also…

综合物理 · 物理学 2007-09-18 Ronald F. Fox , Theodore P. Hill

A natural number N is said to be palindromic if its binary representation reads the same forwards and backwards. In this paper we study the quotients of two palindromic numbers and answer some basic questions about the resulting sets of…

数论 · 数学 2022-03-01 James Haoyu Bai , Joseph Meleshko , Samin Riasat , Jeffrey Shallit

We show that the binary representation of the integers has a role to play in many aspects of Clifford algebras.

数学物理 · 物理学 2017-01-13 Marco Budinich

For each $\alpha > 2$ there is a binary word with critical exponent $\alpha$.

组合数学 · 数学 2009-04-14 James D. Currie , Narad Rampersad

Recently, a short and elegant proof was presented showing that a binary word of length $n$ contains at most $n-3$ runs. Here we show, using the same technique and a computer search, that the number of runs in a binary word of length $n$ is…

形式语言与自动机理论 · 计算机科学 2019-12-18 Johannes Fischer , Štěpán Holub , Tomohiro I , Moshe Lewenstein

Let $(F_n)_{n \geq 1}$ be the sequence of Fibonacci numbers. For all integers $a$ and $b \geq 1$ with $\gcd(a, b) = 1$, let $[a^{-1} \!\bmod b]$ be the multiplicative inverse of $a$ modulo $b$, which we pick in the usual set of…

数论 · 数学 2023-06-16 Carlo Sanna

We establish that almost every positive integer $n$ is the sum of four cubes, two of which are at most $n^{\theta}$, as long as $\theta\geq192/869$. An asymptotic formula for the number of such representations is established when…

数论 · 数学 2010-06-29 Siu-lun Alan Lee

An involution of a real commutative algebra $A$ is a real-linear homomorphism $f : A \rightarrow A$ such that $f^2 = \mathrm{Id}$. We show that there are six involutions of the algebra of bicomplex numbers, contrary to the actual number of…

环与代数 · 数学 2022-08-04 Pierre-Olivier Parisé

The new International System of Units may let us select an integer value for Avogadro's number. Some might prefer an integer that's divisible by 12, so that an integer number of $^{12}C$ atoms may be associated (to first order) with a…

综合物理 · 物理学 2015-08-06 P. Fraundorf , Melanie Lipp

A formula for the number of toroidal m x n binary arrays, allowing rotation of the rows and/or the columns but not reflection, is known. Here we find a formula for the number of toroidal m x n binary arrays, allowing rotation and/or…

组合数学 · 数学 2013-06-04 S. N. Ethier

The Ulam sequence is defined as $a_1 =1, a_2 = 2$ and $a_n$ being the smallest integer that can be written as the sum of two distinct earlier elements in a unique way. This gives $$1, 2, 3, 4, 6, 8, 11, 13, 16, 18, 26, 28, 36, 38, 47,…

组合数学 · 数学 2016-07-07 Stefan Steinerberger

We relate binary words with a given number of subsequences to continued fractions of rational numbers with a given denominator. We deduce that there are binary strings of length $O(\log n \log \log n)$ with exactly $n$ subsequences; this…

组合数学 · 数学 2022-10-04 Radosław Żak

A perfect number is a number whose divisors add up to twice the number itself. The existence of odd perfect numbers is a millennia-old unsolved problem. This note proposes a proof of the nonexistence of odd perfect numbers. More generally,…

综合数学 · 数学 2011-03-04 N. A. Carella

Let $f(n)=\min_{p} |n-p|$, where $p$ is a prime. We show that there is a positive constant $\delta$ such that for any large integer $N$ there exist two positive integers $n_1$ and $n_2$ such that $N=n_1 + n_2$ and $f(n_i)\gg \ln N (\ln\ln…

数论 · 数学 2024-09-24 Artyom Radomskii

In this paper, we investigate the 2-adic valuations of the Stirling numbers $S(n, k)$ of the second kind. We show that $v_2(S(4i, 5))=v_2(S(4i+3, 5))$ if and only if $i\not\equiv 7\pmod {32}$. This confirms a conjecture of Amdeberhan, Manna…

数论 · 数学 2012-06-26 Shaofang Hong , Jianrong Zhao , Wei Zhao

The representation of any integer as the sum of two cubes to a fixed modulus is always possible if and only if the modulus is not divisible by seven or nine. For a positive non-prime integer N there is given an inductive way to find its…

数论 · 数学 2011-09-05 Ala Avoyan , David Tsirekidze

In this note, we construct and study an algebraic system similar to the natural numbers, but with noncommutative addition. The addition we introduce is a binary operation that commutes with itself in the sense of N. Durov. Neverheless, the…

量子代数 · 数学 2010-03-11 Tyler Foster