mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Math

Reply
 
Thread Tools
Old 2004-02-05, 18:22   #1
Orgasmic Troll
Cranksta Rap Ayatollah
 
Orgasmic Troll's Avatar
 
Jul 2003

641 Posts
Default Can someone help me express this more concisely?

I was goofing around with sorting reduced fractions, and I ended up focusing on ones less than 1/2, and I was looking at what happens if you have all the reduced fractions less than 1/2 with denominators less than n, where do the fractions with denominator n go .. for example


n = 5, [(x), 1/4, 1/3, (x), 1/2]
n = 6, [(x), 1/5, 1/4, 1/3, 2/5, 1/2]
n = 7, [(x), 1/6, 1/5, 1/4, (x), 1/3, 2/5, (x), 1/2]

the (x)'s are where the new fractions will go

if you look at all the places where you could put a new fraction and put a 1 for where a new fraction will go and a 0 where one doesn't go, you get a binary number for each n

n=3, 1
n=4, 10
n=5, 101
n=6, 1000
n=7, 100101
n=8, 100000100

converting them into decimal, you get the sequence 1, 2, 5, 16, 37, 260, 1089, 8224, 33937, 1048584, 4264225, ...

my questions are..

1) Does anybody even get what I'm talking about?
2) If so, how can I express this more concisely, because I feel like I'm all over the map with my explanation
3) I'm generating these by listing everything out by hand, is there some way I could generate these numbers?

I looked up the sequence on OLEIS and nothing came up, and I think it might be worth submitting, but I don't know how to describe it

Thanks!
Orgasmic Troll is offline   Reply With Quote
Old 2004-02-05, 19:47   #2
philmoore
 
philmoore's Avatar
 
"Phil"
Sep 2002
Tracktown, U.S.A.

100010111112 Posts
Default

You are looking at what are called Farey sequences, or one half of the Farey sequences. A Farey sequence of order n is an ordered sequence of all fractions between 0 and 1 which have denominator less than or equal to n. Your binary numbers are one way of describing where to insert the new fractions to expand a Farey sequence of order n-1 to order n. Are you finding any interesting patterns? Farey sequences have been studied quite a lot in number theory, and even have an interesting connection to the Riemann hypothesis.

(Note added in edit: The binary expansion for n=6 should read:
n=6, 10000, as is clear in the list of decimal equivalents.)

Last fiddled with by philmoore on 2004-02-05 at 19:50
philmoore is offline   Reply With Quote
Old 2004-02-06, 14:12   #3
Orgasmic Troll
Cranksta Rap Ayatollah
 
Orgasmic Troll's Avatar
 
Jul 2003

641 Posts
Default

Quote:
Originally Posted by philmoore
You are looking at what are called Farey sequences, or one half of the Farey sequences. A Farey sequence of order n is an ordered sequence of all fractions between 0 and 1 which have denominator less than or equal to n. Your binary numbers are one way of describing where to insert the new fractions to expand a Farey sequence of order n-1 to order n. Are you finding any interesting patterns? Farey sequences have been studied quite a lot in number theory, and even have an interesting connection to the Riemann hypothesis.

(Note added in edit: The binary expansion for n=6 should read:
n=6, 10000, as is clear in the list of decimal equivalents.)
Thanks! Nothing is exactly jumping off the page regarding these numbers, but they interest me :)
Orgasmic Troll is offline   Reply With Quote
Reply



Similar Threads
Thread Thread Starter Forum Replies Last Post
PFGW build help (with MSVC 2012 Express) Prime95 Software 5 2013-08-07 23:51
Influence of PCI Express Lanes to GPU Computing Brain Hardware 6 2012-05-15 18:37
PCI Express 3.0 ATH GPU Computing 2 2011-07-08 13:34
Compiling CUDA programs on VS 2010 Express ET_ GPU Computing 9 2011-03-24 10:11
Visual Studio 2005 express beta. FREE!!! TTn Software 17 2004-08-15 22:31

All times are UTC. The time now is 17:44.


Fri Jul 16 17:44:03 UTC 2021 up 49 days, 15:31, 1 user, load averages: 1.32, 1.45, 1.48

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.