CTK Exchange
Front Page
Movie shortcuts
Personal info
Awards
Reciprocal links
Terms of use
Privacy Policy

Interactive Activities

Cut The Knot!
MSET99 Talk
Games & Puzzles
Arithmetic/Algebra
Geometry
Probability
Eye Opener
Analog Gadgets
Inventor's Paradox
Did you know?...
Proofs
Math as Language
Things Impossible
My Logo
Math Poll
Other Math sit's
Guest book
News sit's

Recommend this site

Manifesto: what CTK is about Search CTK Buying a book is a commitment to learning Table of content |Store| Things you can find on CTK Chronology of updates Email to Cut The Knot Recommend this page

CTK Exchange

Subject: "Triangular a(a+1)/2 as products of two sequence terms"     Previous Topic | Next Topic
Printer-friendly copy     Email this topic to a friend    
Conferences The CTK Exchange College math Topic #506
Reading Topic #506
Ramsey2879
guest
May-01-05, 09:10 AM (EST)
 
"Triangular a(a+1)/2 as products of two sequence terms"
 
   Let T(a)=a(a++1)/2. I found that there are interdependent arithmetic
sequences:
A*n++B, C*n++D, and E*n++F that solve the
formula T(A*n++B)=(C*n++D)*(E*n++F), for all n. The basic
values for A-F are generated by the equations.
A=(2m++1)*(2m++2)
B=(2m++2)*2m
C=+/- (2m++2)*(m++1)
D=+/- (2m++1)*(m++1)
E=+/- (2m++1)*(2m++1)
F=+/- (2m++1)*2m
I also found that other families of solutions for A-F can be obtained
from any solution by creating still another quadratic series for each
of the values of A-F as follows A_0 = A, A_1 = 0, A_2 = A and B_0 = B,
B_1 and B_2 each = B-A. Like series are created for the variables C,D
and E,F of each of the two factors. It will be found T(A_i*n++B_i)= (C_i*n++D_i)*(E_i*n++F_i) in every case. Is this a new discoverey?


  Alert | IP Printer-friendly page | Reply | Reply With Quote | Top
Ramsey2879
guest
May-02-05, 01:19 PM (EST)
 
1. "RE: Triangular a(a+1)/2 as products of two sequence terms"
In response to message #0
 
   This Leads to a posibly new factoring method

I noted that n can be any real number(I suspect that n could even be
complex!!), for instance if m=2,t=2 and n=1/3 the equation T(A*n+B)=
(C*n+D)*(E*n+F) becomes

T(8*5+24) = (8*3+15)*({4/3}*25 + 20)
=T(64)= (39)*(160/3) = 65*32 = 64*65/2

Notice how the factors 13 and 5 of 65 conveniently become separated
between the two factors of T(64). This method could also work if we let
A*n +B be one less than any other number that needs factoring.

As an example of factoring 63 which is a Mersenne number, we can try
letting A*n+B = -64 by setting n = -11/15. Then my tri-equation becomes

T(-64)=-189/5 * -160/3 = 63*64/2 but this didn't factor the 63.

However, let T=2,M=3,n=1/2 then my tri-equation becomes
T(-64)= -36*(-56) which sucessfully factors the 63 by dividing by the factors of 64.

I believe this method has a lot of potential

Feel free to check my new group for more results. https://groups.yahoo.com/group/Figurate_Numbers


  Alert | IP Printer-friendly page | Reply | Reply With Quote | Top

Conferences | Forums | Topics | Previous Topic | Next Topic

You may be curious to have a look at the old CTK Exchange archive.
Please do not post there.

|Front page| |Contents|

Copyright © 1996-2018 Alexander Bogomolny

Search:
Keywords:

Google
Web CTK