My Omnidimensional AP Research: From a Simple Number Pattern to a General Power-Sum Formula By Kumaran Kanniappan My OMNIBAL research explores a question: If we know exactly how a sequence is generated, can we calculate its powered total without visiting every term? For arithmetic progressions, we can express that calculation through a midpoint, symmetry, and reusable moment formulas. In this article, I explain the approach from a simple example to multidimensional arrangements and higher powers, then describe how I would evaluate its practical usefulness. 1. BEGIN WITH A FAMILIAR PATTERN Consider: 3, 5, 7, 9, 11, 13, 15, 17 Each number increases by two. This is an arithmetic progression, or AP. Write it as: a_i = F + h*i, for i = 0,...,X-1 The parameters are: - F: first value. - h: common difference. - X: number of values. For this sequence: F = 3, h = 2, X = 8 Its last value is: L = F + h*(X-1) = 17 Its midpoint is: M = (F+L)/2 = 10 2. THE MIDPOINT REVEALS THE STRUCTURE Pair the valu...
Program
public class stackpgm {
private int maxSize;
private long[] stackArray;
private int top;
public stackpgm(int s)
{
maxSize = s;
stackArray = new long[maxSize];
top = -1;
}
public void push(long j)
{
if(!isFull())
{
stackArray[++top] = j;
}
}
public long pop()
{
return stackArray[top--];
}
public long peek()
{
return stackArray[top];
}
public boolean isEmpty()
{
return (top == -1);
}
public boolean isFull()
{
return (top == maxSize-1);
}
public static void main(String[] args)
{
stackpgm theStack = new stackpgm(10);
theStack.push(1);
theStack.push(2);
theStack.push(3);
theStack.push(4);
System.out.println("Pop up values");
while( !theStack.isEmpty() )
{
long value = theStack.pop();
System.out.print(value+"\n");
}
}
}
Output
public class stackpgm {
private int maxSize;
private long[] stackArray;
private int top;
public stackpgm(int s)
{
maxSize = s;
stackArray = new long[maxSize];
top = -1;
}
public void push(long j)
{
if(!isFull())
{
stackArray[++top] = j;
}
}
public long pop()
{
return stackArray[top--];
}
public long peek()
{
return stackArray[top];
}
public boolean isEmpty()
{
return (top == -1);
}
public boolean isFull()
{
return (top == maxSize-1);
}
public static void main(String[] args)
{
stackpgm theStack = new stackpgm(10);
theStack.push(1);
theStack.push(2);
theStack.push(3);
theStack.push(4);
System.out.println("Pop up values");
while( !theStack.isEmpty() )
{
long value = theStack.pop();
System.out.print(value+"\n");
}
}
}
Output

Comments
Post a Comment
Share this to your friends