BIBenedict Irwin

Benedict Irwin

*This is an algorithmically generated author record based on publicly available information.

Benedict Irwin has a total of 52 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    On the Generating Functions of p-Rough Numbers and their Inverse Z-Transforms

    by Benedict Irwin

    A p-rough number for some prime p, is a member of the set of numbers not divisible by any prime q < p. This document will note down the generating functions for the first few prime-rough numbers, and discuss their inverse Z-transforms, i.e a function a(n) that gives the nth member of the set. INTRODUCTION The 3-rough numbers are simply the odd numbers 1, 3, 5, 7, 9, 11⋯, the numbers which are not divisible by p ∈ {2}, See the table below for the appropriate OEIS label. {|c|c|} \hline p & p \\ \hline 2 & A000027 & 1,2,3,4,5,6,7\\ 3 & A005408 & 1,3,5,7,9,11,13\\ 5 & A007310 & 1,5,7,11,13,17,19\\ 7 & A007775 & 1, 7, 11, 13, 17, 19, 23\\ 11 & A008364& 1, 11, 13, 17, 19, 23, 29\\ 13 & A008365& 1, 13, 17, 19, 23, 29, 31\\ 17 & A008366& 1, 17, 19, 23, 29, 31, 37,\\ 19 & A166061& 1, 19, 23, 29, 31, 37, 41\\ 23 & A166063& 1, 23, 29, 31, 37, 41, 43\\ \hline From the table above we can see the first entry is always 1, the second entry is the nth prime, (i.e the index in the name of that sequence) and the next entry is the name of the next sequence. There are an increasing number of primes in each sequence, rather the probability of finding a prime number is higher. GENERATING FUNCTIONS A generating function for a sequence with terms a(n) is simply the series, G_a(z)=a(0)z^0 + a(1)z^1 + a(2)z^2 + \cdots= ^\infty a(n)z^n, however, for some sequences it makes more sense to count from 1, giving the description G_a(z)=a(1)z^1 + a(2)z^2 + \cdots= ^\infty a(n)z^n, the latter is the description we will use. We can see that the generating function for the natural numbers 1, 2, 3, ⋯ (which are also the 2-rough numbers) is then G_2(z)={(z-1)^2}=z+2z^2+3z^3+\cdots\\ a_2(n)=n Then for the 3-rough numbers we have the odd numbers, G_3(z)={(z-1)^2} \\ a_3(n) = 2n-1 we can use the Mathematica expression \\ to extract the sequence function a₃(n). For the 5-rough numbers we have numbers congruent to 1 or 5 mod 6, G_5(z) ={(1-z)^2(1+z)}\\ a_5(n) = {2}(6n+(-1)^n-3) From these we notice that G_3(z)=G_2(z)(1+z)\\ G_5(z)={G_3(z)}(1+4z+z^2) From here on things get less simple. The next sequence is the 7-rough numbers G_7(z)={(1+z)(z^2+1)(z^4+1)(z-1)^2} But the sequence description a(n) is terribly complicated a_7(n)= {8}e^{-{4}in\pi}\left((1-3i)+(2+i)+(-1)^n\left((1-3i)-(2+i)+((i-14)+30n)\cos(n\pi/4)+(2+6i)\cos(n\pi/2)+(2-i)\cos(3n\pi/4)+((16i-1)-30in)\sin(n\pi/4)+(2+4i)\sin(n\pi/2)-\sin(3n\pi/4)\right)\right) Then we have the 11-rough numbers G_{11}(z) = + 10z^{47} + 2z^{46} + 4z^{45} + 2z^{44} + 4z^{43} + 6z^{42} + 2z^{41} + 6z^{40} + 4z^{39} + 2z^{38} + 4z^{37} + 6z^{36} + 6z^{35} + 2z^{34} + 6z^{33} + 4z^{32} + 2z^{31} + 6z^{30} + 4z^{29} + 6z^{28} + 8z^{27} + 4z^{26} + 2z^{25} + 4z^{24} + 2z^{23} + 4z^{22} + 8z^{21} + 6z^{20} + 4z^{19} + 6z^{18} + 2z^{17} + 4z^{16} + 6z^{15} + 2z^{14} + 6z^{13} + 6z^{12} + 4z^{11} + 2z^{10} + 4z^9 + 6z^8 + 2z^7 + 6z^6 + 4z^5 + 2z^4 + 4z^3 + 2z^2 + 10z + 1)}{(z^{49} - z^{48} - z + 1)} \\ G_{11}(z) = +1 + 2(z^{46}+ z^{44}+ z^{41}+ z^{38}+ z^{34}+ z^{31}+ z^{25}+ z^{23}+ z^{17}+ z^{14}+ z^{10}+ z^7+ z^4+ z^2) + 4(z^{45} + z^{43} + z^{39} + z^{37} + z^{32}+ z^{29}+ z^{26} + z^{24} + z^{22} + z^{19} + z^{16} + z^{11}+z^9+z^5+z^3) + 6(z^{42} + z^{40} + z^{36} + z^{35} + z^{33} + z^{30} + z^{28} + z^{20} + z^{18} + z^{15} + z^{13} + z^{12} + z^8 + z^6) + 8(z^{27} + z^{21})+ 10(z^{47}+z) )}{(z^{49} - z^{48} - z + 1)} Whose sequence description takes us a few screens and is silly to place here... For this we have learnt that the generating functions remain somewhat simple compared to the sequence descriptions.

  • Open Access

    A sequence a ( n + 1) is product over binary components of n , plus 1.

    by Benedict Irwin

    I note down a curious relationship in the sequence OEIS A245479, which displays a novel property. The sequence is titled “Numbers n such that the n-th cyclotomic polynomial has a root mod 7.”, and is easily described by a generating function and explicit formula. The sequence also appears to display a product recurrence relation in the following manner. If n = 2α + 2β + 2γ + ⋯, the binary polynomial for n, then the (n + 1)th term of the sequence a(n + 1) is given by a(n+1)=a(2^\alpha+1)\cdot a(2^\beta+1)\cdot a(2^\gamma+1)\cdot \cdots where 2α, 2β, 2γ... are necessarily less than or equal to n. Thus each higher term in the sequence can be described by a product of the lower terms. MAIN The generating function for our sequence (indexed from 1) with terms a(n) is A(x)=^\infty a(k)x^k we may also write this as a formal product series A(x)=^\infty (1+b(k)x^k) If we do this for A245479, 1, 2, 3, 6, 7, 14, 21, 42, 49, 98, 147, 294, ⋯ we find the coefficients b(n) to be 2, 3, 0, 7, 0, 0, 0, 49, 0, 0, 0, 0, 0, 0, 0, 2401, ⋯ this means we can write x+2x^2+3x^3+6x^4+7x^5+14x^6+\cdots = x(1+2x)(1+3x^2)(1+7x^4)(1+49x^8)(1+2401x^{16})\cdots we can notice that only the powers of 2 appear in x on the right hand side, and the coefficients of these powers are the (2n + 1)th terms of a(n). This means we may write ^\infty a(k)x^k=x^\infty (1+a(2^k+1)x^{2^k}) if this is true it will immediatly follow that a(n+1)=a(2^\alpha+1)\cdot a(2^\beta+1)\cdot a(2^\gamma+1)\cdot \cdots with n=2^\alpha+2^\beta+2^\gamma+\cdots for example let n = 31 31=2^0+2^1+2^2+2^3+2^4 then we have a(32)=a(2)a(3)a(5)a(9)a(17) inserting the numbers 4941258=2\cdot3\cdot7\cdot49\cdot2401 which is true. This can also be written 4941258=2\cdot3\cdot7\cdot7^2\cdot7^4 CONCEPT Like a logarithm satisfies f(ab)=f(a)+f(b) and an exponential f(a+b)=f(a)f(b) we the have a function which over the integers satisfies f\left(1+} 2^b\right)=}f(1+2^b) what is this function? We may take the inverse Z-Transform of the generating function from OEIS, with a reciprocated input A\left({x}\right)=-{x}\left({x}+1\right){x^2}+1}{{x^4}-1} f(n)^{-1}(A)= \cdots we see it has complex terms when extended to non-integer values of n. We see that in general this relationship does not hold for non-integer values of n, as f(+^3+1)\ne f(+1)f(^3+1) Let us call this function bmf(n). Then we may begin to unravel it’s power. USES If an integer p = m + 1 is an odd prime it must have a binary term 2⁰. Then (p+1)=(2)(m+1) but m = p − 1 so (p+1)=(2)(p) then (p+1)}{(p)}=2 we see from inspection that (n+1)}{(n)}=2 for all odd n. That’s a start. If we consider Mersenne primes, whose binary representation may not contain any 0, we note that for a Mersenne prime p = 2k − 1 (p+1)=(2)(3)(5)\cdots\left({2} +1\right)\\ (p+1)=(2)(3)(5)\cdots\left(2^{k-1}+1\right)

  • Open Access

    Expansion Transform

    by Benedict Irwin

  • Open Access

    Sums of Sums Sequences

    by Benedict Irwin

    MAIN We may define sequences in the following format, a(1) = ^2 f(i_1) \\ a(2) = ^2 ^{f(i_1)} f(i_2) \\ a(3) = ^2 ^{f(i_1)} ^{f(i_2)} f(i_3) \\ \cdots \\ a(n) = ^2 ^{f(i_1)} ^{f(i_2)}\cdots^{f(i_{n-1})} f(i_n) for some f. This can also be extended with some g a(n) = ^2 ^{f(i_1)} ^{f(i_2)}\cdots^{f(i_{n-1})} f(i_n) for example, it would appear that for f(x)=x + 2 and g(n)=n, we have a(n) = ^2 ^{f(i_1)} ^{f(i_2)}\cdots^{f(i_{n-1})} f(i_n) = {n+2}{n+3} and for for f(x)=x + 1 and g(n)=n a(n) = ^2 ^{f(i_1)} ^{f(i_2)}\cdots^{f(i_{n-1})} f(i_n) = (n+1)^2+1 To keep this as general as possible define the following \Sigma(a,b,c,d;n)= ^{a(n)} ^{c(i_1)} ^{c(i_2)}\cdots^{c(i_{n-1})} d(i_n) Then for example we have \Sigma(1,1,n+1,n;n)= {(n+2)!(n-1)!} which is A000245. LIST \Sigma(1,1,1,1;n)=1 \\ \Sigma(n,n,n,n;n)=n \\ \Sigma(n,n,n,f(n);n)=f(n) \\ \Sigma(n,n-1,n,n;n)=n^2 \\ \Sigma(n,n-2,n,n;n)={2} \\ \Sigma(1,n,n+1,n;n)=n \\ \Sigma(1,1,n,n;n)=1 \\ \Sigma(1,1,n+1,n;n)= {(n+2)!(n-1)!} \\ \Sigma(n+1,n+1,n+1,n+1;n) = 3,13,55,231,966,\cdots I have found a very special conjecture \Sigma(1,1,\pi(n+1)+1,n;n) = 3(2(n-1))+0^{n-1} which is true for the first 17 terms. Where π(x) is the prime counting function. ^{a(n)} ^{c(i_1)} ^{c(i_2)}\cdots^{c(i_{n-1})} i_n = 3(2(n-1))+0^{n-1} this most likely is due to the sub linear growth of pi(n). INTEGRALS We also may write a series of integrals I_n = ^{a(n)} ^{c(i_1)} ^{c(i_2)}\cdots^{c(i_{n-1})} d(i_n)\;di_n\;\cdots di_2 di_1 If we let. a(n)=1, b(n)=0, c(n)=n + 1, d(n)=n + 1, This appears to give A000272/(n + 1)!. If we let. a(n)=1, b(n)=0, c(n)=n + 1, d(n)=n, This appears to give A213326/(n + 1)!. If we let. a(n)=n, b(n)=0, c(n)=n + 1, d(n)=1, This appears to give A193678/n! If we let. a(n)=2n, b(n)=0, c(n)=n, d(n)=1, This appears to give A062971/n! If we let. a(n)=n, b(n)=0, c(n)=n, d(n)=1, This appears to give nn/n!

  • Open Access

    Nested Zeta Constant

    by Benedict Irwin

  • Open Access

    Lambert-W Additional Functions

    by Benedict Irwin