End behavior of Ramanujan's Taxicab numbers
B Benfield, O Lippard, A Roy - The Ramanujan Journal, 2025 - Springer
Generalized taxicab numbers are the smallest positive integers that are the sum of exactly j,
positive\(k^{\textrm {th}}\) powers in exactly m distinct ways. This paper considers for which …
positive\(k^{\textrm {th}}\) powers in exactly m distinct ways. This paper considers for which …
[PDF][PDF] New upper bounds for taxicab and cabtaxi numbers
C Boyer - Journal of Integer Sequences, 2008 - christianboyer.com
Hardy was surprised by Ramanujan's remark about a London taxi numbered 1729:“it is a
very interesting number, it is the smallest number expressible as a sum of two cubes in two …
very interesting number, it is the smallest number expressible as a sum of two cubes in two …
A computation model with automatic functions and relations as primitive operations
Prior work of Hartmanis and Simon [36] and Floyd and Knuth [30] investigated what happens
if a device uses primitive steps more natural than single updates of a Turing tape. One …
if a device uses primitive steps more natural than single updates of a Turing tape. One …
On primary Carmichael numbers
BC Kellner - arxiv preprint arxiv:1902.11283, 2019 - arxiv.org
The primary Carmichael numbers were recently introduced as a special subset of the
Carmichael numbers. A primary Carmichael number $ m $ has the unique property that …
Carmichael numbers. A primary Carmichael number $ m $ has the unique property that …
A pattern in Cris Calude's Work
AP Pedersen, J Stecher - 2022 - philpapers.org
Two decades ago, while one of us20 was a PhD student, I discovered Information and
Randomness [3]. I wrote to Cris with a question about the book. He was surprised to find out …
Randomness [3]. I wrote to Cris with a question about the book. He was surprised to find out …
A Pattern in Cris Calude's Work
J Stecher - 2022 - philpapers.org
Two decades ago, while one of us20 was a PhD student, I discovered Information and
Randomness [3]. I wrote to Cris with a question about the book. He was surprised to find out …
Randomness [3]. I wrote to Cris with a question about the book. He was surprised to find out …
[PDF][PDF] A Complete Bibliography of Publications in J. UCS: Journal of Universal Computer Science
NHF Beebe - 2023 - ctan.math.utah.edu
A Complete Bibliography of Publications in J.UCS: Journal of Universal Computer Science
Page 1 A Complete Bibliography of Publications in J.UCS: Journal of Universal Computer …
Page 1 A Complete Bibliography of Publications in J.UCS: Journal of Universal Computer …
[PDF][PDF] More Upper Bounds on Taxicab and Cabtaxi Numbers.
PC Su - J. Integer Seq., 2016 - emis.muni.cz
For positive integers a, b and integers x, y such that S= a3+ b3= x3+ y3, we prove that x+ y≡
a+ b (mod 6); moreover, we give a parametric function ri→(x (ri), y (ri)) with (x (ri)) 3+(y (ri)) …
a+ b (mod 6); moreover, we give a parametric function ri→(x (ri), y (ri)) with (x (ri)) 3+(y (ri)) …
Automata recognizing no words: A statistical approach
CS Calude, C Câmpeanu… - Fundamenta …, 2006 - content.iospress.com
How likely is that a randomly given (non-) deterministic finite automaton recognizes no
word? A quick reflection seems to indicate that not too many finite automata accept no word; …
word? A quick reflection seems to indicate that not too many finite automata accept no word; …
On Hunting for Taxicab Numbers
P Emelyanov - arxiv preprint arxiv:0802.1147, 2008 - arxiv.org
In this article, we make use of some known method to investigate some properties of the
numbers represented as sums of two equal odd powers, ie, the equation $ x^ n+ y^ n= N …
numbers represented as sums of two equal odd powers, ie, the equation $ x^ n+ y^ n= N …