Institution
National Kaohsiung University of Science and Technology
Recent research
- AI & ComputingOpen access
On the Infinitude of a Prime-Factor Recurrence
We study the prime-factor recurrence recorded as OEIS A242462, starting from 10 and using the least odd prime divisor at each step. Following the squarefreeness observation and conditional criteria of J. Lowell, we show that no term is a power of two; hence the recurrence continu...
- AI & ComputingOpen access
Calibration-assisted stress-optic phase programming for a 3D-printed optical neural-network frontend
We report a calibration-assisted stress-optic phase-programming method for a 3D-printed optical neural-network (ONN) frontend. Full-vector stress-optic modeling gives a full-stress effective-index shift of Δ 𝑛 e f f = − 2 . 1 2 8 4 × 1 0 − 4 at 850 nm, setting the phase-length...
- AI & ComputingOpen access
On Divisibility-Constrained Partitions of an Arbitrary Integer
We consider integer partitions for which the sum of the parts divides their product. Five OEIS counting functions are examined: the fixed-four-part count A343320 and the unrestricted-length counts A057568, A379733, A379734, and A379735, with distinctness and exclusion of the part...
- AI & ComputingOpen access
Universal and Simultaneous Constructions of Perfect Powers with Equal Decimal Digit Frequencies
We construct perfect powers whose decimal representations contain each of the ten digits equally often. A general even-exponent construction is obtained from full-reptend prime-power denominators and a digit-preserving cancellation of signed block carries. The construction is unc...
- Society & Economics
ABSTRACT This study examines firm low‐carbon performance (FLCP) by integrating the Technology–Organization–Environment (TOE) framework with the Natural Resource‐Based View, Dynamic Capabilities Theory, and Institutional Theory. Using survey data from 318 managers in Chinese firms...
- AI & ComputingOpen access
Palfree Squares in a Two-Parameter Family of Near-Repdigits
For integers \(1 \le d \le 9\), \(0 \le e \le 9\), and \(n \ge 1\), let\[N_{d,e}(n)=d\frac{10^n-1}{9}+(e-d).\]For \(n \ge 2\), this is the decimal integer consisting of \(n-1\) copies of \(d\) followed by \(e\). We classify exactly when \(N_{d,e}(n)^2\) is palfree, meaning that i...
- AI & ComputingOpen access
We study three fixed-exponent classes separately: squares, corresponding to OEIS A050741/A050749; cubes, corresponding to A050742/A050750; and fourth powers, corresponding to A050743/A050751. For squares, we recast the known construction of Rodrigo (2017), based on the roots \(R_...
- AI & ComputingOpen access
Adjacent-Digit Distinctness in Squares of Generalized Repunits
For an integer base \(b\ge 3\), let \[ R_n^{(b)}=1+b+\cdots+b^{n-1}=\frac{b^n-1}{b-1} \] be the length-\(n\) repunit in base \(b\). We prove that the standard base-\(b\) expansion of \(\bigl(R_n^{(b)}\bigr)^2\) has no two equal adjacent digits if and only if \(n=1\) or \(n\not\eq...
- Climate & EnvironmentOpen access
Explainable quantum inspired LSTM model for water quality classification in fishponds
Abstract Water quality monitoring is a crucial aspect of aquaculture, contributing significantly to the health, productivity, and sustainable management of aquatic environments. It is important to monitor key parameters like pH, dissolved oxygen, turbidity and temperature levels...
- AI & ComputingOpen access
An Explicit Infinite Family of Fifth Powers with No Equal Adjacent Decimal Digits
We study OEIS A050744/A050752, where A050744 records integers \(x\) for which the decimal expansion of \(x^5\) has no pair of equal adjacent digits and A050752 records the corresponding fifth powers. For every integer \(t\ge1\), we consider \[ x_t=\frac{2(10^{54t}-5\cdot10^{27t}+...
- AI & ComputingOpen access
Infinitude of a Greedy Sequence of Perfect Powers with Distinct Neighboring Digits
We study the increasing greedy construction represented by OEIS A175031. Starting from perfect powers whose neighboring decimal digits are distinct, after a term is chosen the next term is the least larger admissible perfect power whose first digit differs from the last digit of...
- AI & ComputingOpen access
We study three fixed-exponent classes separately: squares, corresponding to OEIS A050741/A050749; cubes, corresponding to A050742/A050750; and fourth powers, corresponding to A050743/A050751. For squares, we recast the known construction of Rodrigo (2017), based on the roots \(R_...
- Society & EconomicsOpen access
The swift progress and broad application of information and communication technologies (ICTs) have significantly advanced their integration into the educational sector. This research aims to address the impacts of flow antecedents, including online learning self-efficacy and intr...
- AI & ComputingOpen access
Adjacent-Digit Distinctness in Squares of Generalized Repunits
For an integer base \(b \ge 3\), let\[R_n^{(b)}=1+b+\cdots+b^{n-1}=\frac{b^n-1}{b-1}\]be the length-\(n\) repunit in base \(b\). We prove that the standard base-\(b\) expansion of\[\left(R_n^{(b)}\right)^2\]has no two equal adjacent digits if and only if\[n=1\qquad\text{or}\qquad...
- AI & ComputingOpen access
Explicit Square Constructions for Odd-Length Geometric Progressions
OEIS A092960 records the least square representable as one plus the sum of $n$ successive terms of a geometric progression, with value $0$ when no such square exists. For every odd $n\ge3$, we give an explicit $n$-term geometric progression with first term $2^n-3$ and common rati...
- AI & ComputingOpen access
Nonvanishing and Growth of Least Prime Denominators for Decimal Powers
This preprint studies OEIS A090519, where \(a(n)\) is the least prime \(p\) such that \(\lfloor 10^n/p\rfloor\) is prime, with value 0 if no such prime exists. We prove that \(a(n)>0\) for every \(n\ge 1\), resolving the nonvanishing conjecture recorded for the sequence. An eleme...
- AI & ComputingOpen access
Nonvanishing and Growth of Least Prime Denominators for Decimal Powers
This preprint studies OEIS A090519, where \(a(n)\) is the least prime \(p\) such that \(\lfloor 10^n/p\rfloor\) is prime, with value 0 if no such prime exists. We prove that \(a(n)>0\) for every \(n\ge 1\), resolving the nonvanishing conjecture recorded for the sequence. An eleme...
- AI & ComputingOpen access
Prime Witnesses in a Floor-Quotient Sequence
For an integer \(X\ge 1\), let \(\mathcal W(X)\) be the set of primes \(p\) for which \(\lfloor X/p\rfloor\) is prime, and let \(W(X)=|\mathcal W(X)|\). For a fixed prime \(q\), we prove the exact identity\[W_q(X)=\pi(X/q)-\pi(X/(q+1)),\]and hence\[W_q(X)\sim \frac{X}{q(q+1)\log...
- AI & ComputingOpen access
Arbitrarily Long Increasing and Decreasing Runs in ⌊n^(p_n/n)⌋
Let \(p_n\) denote the \(n\)th prime and define\[A_n=\left\lfloor n^{p_n/n}\right\rfloor.\]OEIS A318199 records the conjecture that no consecutive strictly increasing run contains more than 17 terms. Introducing \(B_n=n^{p_n/n}\) and \(g_n=p_{n+1}-p_n\), we derive the exact ident...
- Engineering & Technology
Abstract Traditional anticorrosion coatings for marine infrastructure often rely on toxic chemical inhibitors that pose significant risks to aquatic ecosystems. Herein, we report a smart green protection platform for SS400 carbon steel that synergizes microbiologically influenced...