If you're seeing this message, it means we're having trouble loading external resources on our website. If you're behind a web filter, please make sure that the domains *.kastatic.org and *.kasandbox.org are unblocked.

2017年4月23日 · Could you do a video explaining Euclid's Algorithm (for finding the GCD (GCF) of two integers). With a couple of worked examples. A question that comes up fairly often in the discussions section is "Is there a way to find the GCF without just listing all the factors? What if there are a lot of factors?" Or words to that effect.

If you're seeing this message, it means we're having trouble loading external resources on our website. If you're behind a web filter, please make sure that the domains *.kastatic.org and *.kasandbox.org are unblocked.

이 메시지는 외부 자료를 칸아카데미에 로딩하는 데 문제가 있는 경우에 표시됩니다. If you're behind a web filter, please make sure that the domains *.kastatic.org and *.kasandbox.org are unblocked.

Donate - Khan Academy

免费学习数学, 美术, 计算机编程, 经济, 物理, 化学, 生物, 医学, 金融, 历史等学科. 可汗学院是一个旨在为任何地方、任何人提供免费的、世界一流教育的非盈利组织.

तुम्ही जर हा संदेश पाहत असाल तर त्याचे कारण हे की आम्हाला काही बाह्य संसाधने लोड करण्यात व्यतयय येत आहे.

যদি তুমি এই বার্তা দেখে থাক, তার মানে আমাদের ওয়েবসাইটে বাইরের কোন উপকরণ লোড করতে সমস্যা হচ্ছে।

Chúng tôi đang gặp khó khăn trong việc tải các tài nguyên bên ngoài có trên trang web. Nếu bạn đang sử dụng web filter (tạm dịch: bộ lọc nội dung trên mạng), vui lòng đảm bảo rằng tên miền *. kastatic.org và *. kasandbox.org không bị chặn.

Lær deg matematikk, kunst, dataprogrammering, økonomi, fysikk, kjemi, biologi, medisin, finans, historie og mer gratis. Khan Academy er en ikke-kommersiell organisasjon og har som mål å tilby gratis læringsressurser i verdensklasse for alle, overalt.