Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • Home
  • SEARCH
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 6078631
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 23, 20262026-05-23T10:51:20+00:00 2026-05-23T10:51:20+00:00

Based on the Wikipedia article , the best I’ve been able to come up

  • 0

Based on the Wikipedia article, the best I’ve been able to come up with so far is this, which works for 9/11 sizes:

A_SERIES = [
    [841, 1189],
    [594, 841],
    [420, 594],
    [297, 420],
    [210, 297],
    [148, 210],
    [105, 148],
    [74, 105],
    [52, 74],
    [37, 52],
    [26, 37]]

C_SERIES = [
    [917, 1297],
    [648, 917],
    [458, 648],
    [324, 458],
    [229, 324],
    [162, 229],
    [114, 162],
    [81, 114],
    [57, 81],
    [40, 57],
    [28, 40]]

def a_to_c(dimension):
    return dimension * pow(2, 1.0 / 8)

def main():
    for a_values, c_values in zip(A_SERIES, C_SERIES):
        a_to_c_values = [
            int(round(a_to_c(a_values[0]))),
            int(round(a_to_c(a_values[1])))]
        if a_to_c_values != c_values:
            print str([a_to_c(a_values[0]), a_to_c(a_values[1])]) + ' != ' + str(c_values)

if __name__ == '__main__':
    main()

$ ./an-to-cn.py 
[161.39514443445813, 229.00662385970412] != [162, 229]
[114.50331192985206, 161.39514443445813] != [114, 162]
[80.69757221722907, 114.50331192985206] != [81, 114]

Edit: Great answers so far, which make it clear that computing the C size based on arbitrary widths and heights (which was the goal of this project) is not possible. I’ll just use the 2^(1/8) factor without rounding to come as close as possible to the idea of the thing. Resulting OpenSCAD code:

outer_width = paper_width * pow(2, 1.0 / 8);
outer_height = paper_height * pow(2, 1.0 / 8);
  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-23T10:51:20+00:00Added an answer on May 23, 2026 at 10:51 am

    I really dont know how they come to that formula, but I would say it is just wrong.

    There is a reasons how it and why it was developed as it is.

    The ratio of A is 1:sqrt(2). So when you half a side you got the next smaller one.
    (The beginning has 1 m^2 – thats why it easy to calc the weight when you got the weight in g/m^2).

    B is the geometric mean from A and A one size bigger.

    And C is the geometric mean from B and A.

    So for C you got:

     h_B = sqrt (h_A * h_(A+1)) = sqrt (h_a * h_a * sqrt(2)) = h_a * sqrt(sqrt (2))
    
     h_C = sqrt (h_A * h_B)
         = sqrt (h_A) * sqrt (h_A * sqrt(sqrt(2)))
         = sqrt (h_A) * sqrt (h_A) * sqrt(sqrt(sqrt(2)))
         = h_A * sqrt(sqrt(sqrt(2)))
    

    The problem is you can not use the final short formula, as there the rounding of the in between h_A size is lost.

    The problem is the h_A * sqrt(2) (h_ for height), as this does NOT give the the size of paper one number higher.
    Its the other way around, you divide by sqrt(2) to get the next smaller size.

    210 / sqrt(2) = 148,49 which is rounded to 148
    but on the other hand 148 * sqrt(2) ist 209,03.
    So you have really to compute

     h_B = sqrt(h_A * h_A(+1))
     h_C = sqrt(h_A * h_B).
    

    So either you need the A size one bigger in addition, or you compute for A the C value one smaller as you can compute the smaller A value from the bigger one.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I've just been researching the ActiveRecord pattern, and based on this ( http://en.wikipedia.org/wiki/Active_record_pattern ),
Based on Wikipedia's article on Bresenham's line algorithm I've implemented the simplified version described
I was looking at this wikipedia article, and couldn't understand how the hell that
this may come as pretty odd but I'm now working on a membership based
Below is the statement written from Wikipedia's Isolation article about REPEATABLE READS In this
I'm looking at this wikipedia article: http://en.wikipedia.org/wiki/Day_length http://en.wikipedia.org/wiki/Sunrise_equation Anybody had experience calculating Sunrise/Sunset times
I'm currently developing a Java-based library for network coding (http://en.wikipedia.org/wiki/Network_coding). This is very CPU-intensive
I found this in the wikipedia article on utf-8: Sorting of UTF-8 strings as
From wikipedia: The Web Services Description Language (WSDL, pronounced 'wiz-dəl') is an XML-based language
Based on the response to this question: Why does C++ have header files and

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.